scholarly journals A necessary condition ensuring the strong hyperbolicity of first-order systems

2019 ◽  
Vol 16 (01) ◽  
pp. 193-221
Author(s):  
Fernando Abalos
Keyword(s):  
Evolution Equations ◽  
Sufficient Conditions ◽  
Singular Values ◽  
Singular Value ◽  
Necessary Condition ◽  
Finite Conductivity ◽  
Charged Fluids ◽  
First Order ◽  
Value Decomposition ◽  
Necessary And Sufficient

We study strong hyperbolicity of first-order partial differential equations for systems with differential constraints. In these cases, the number of equations is larger than the unknown fields, therefore, the standard Kreiss necessary and sufficient conditions of strong hyperbolicity do not directly apply. To deal with this problem, one introduces a new tensor, called a reduction, which selects a subset of equations with the aim of using them as evolution equations for the unknown. If that tensor leads to a strongly hyperbolic system we call it a hyperbolizer. There might exist many of them or none. A question arises on whether a given system admits any hyperbolization at all. To sort-out this issue, we look for a condition on the system, such that, if it is satisfied, there is no hyperbolic reduction. To that purpose we look at the singular value decomposition of the whole system and study certain one parameter families ([Formula: see text]) of perturbations of the principal symbol. We look for the perturbed singular values around the vanishing ones and show that if they behave as [Formula: see text], with [Formula: see text], then there does not exist any hyperbolizer. In addition, we further notice that the validity or failure of this condition can be established in a simple and invariant way. Finally, we apply the theory to examples in physics, such as Force-Free Electrodynamics in Euler potentials form and charged fluids with finite conductivity. We find that they do not admit any hyperbolization.

scholarly journals Pure PSVD approach to Sylvester-type quaternion matrix equations

2019 ◽  
Vol 35 ◽  
pp. 266-284 ◽  
Author(s):  
Zhuo-Heng He
Keyword(s):  
General Solution ◽  
Sufficient Conditions ◽  
Singular Value ◽  
Matrix Equations ◽  
Quaternion Matrix ◽  
Existence Of A Solution ◽  
Quaternion Matrices ◽  
Pure Product ◽  
Value Decomposition ◽  
Necessary And Sufficient

In this paper, the pure product singular value decomposition (PSVD) for four quaternion matrices is given. The system of coupled Sylvester-type quaternion matrix equations with five unknowns $X_{i}A_{i}-B_{i}X_{i+1}=C_{i}$ is considered by using the PSVD approach, where $A_{i},B_{i},$ and $C_{i}$ are given quaternion matrices of compatible sizes $(i=1,2,3,4)$. Some necessary and sufficient conditions for the existence of a solution to this system are derived. Moreover, the general solution to this system is presented when it is solvable.

scholarly journals Linear Hyperbolic Systems on Networks: well-posedness and qualitative properties

2020 ◽  
Author(s):  
Marjeta Kramar ◽  
Delio Mugnolo ◽  
Serge Nicaise
Keyword(s):  
Boundary Conditions ◽  
Evolution Equations ◽  
Hyperbolic Systems ◽  
Sufficient Conditions ◽  
Order Reduction ◽  
Well Posedness ◽  
Qualitative Properties ◽  
Local Boundary ◽  
First Order ◽  
Necessary And Sufficient

We study hyperbolic systems of one - dimensional partial differential equations under general , possibly non-local boundary conditions. A large class of evolution equations, either on individual 1- dimensional intervals or on general networks , can be reformulated in our rather flexible formalism , which generalizes the classical technique of first - order reduction . We study forward and backward well - posedness ; furthermore , we provide necessary and sufficient conditions on both the boundary conditions and the coefficients arising in the first - order reduction for a given subset of the relevant ambient space to be invariant under the flow that governs the system. Several examples are studied . p, li { white-space: pre-wrap; }

Some generalized characters associated to a transitive permutation group

2020 ◽  
Vol 23 (3) ◽  
pp. 393-397
Author(s):  
Wolfgang Knapp ◽  
Peter Schmid
Keyword(s):  
Positive Integer ◽  
Permutation Group ◽  
Frobenius Group ◽  
Sufficient Conditions ◽  
Necessary Condition ◽  
Transitive Permutation Group ◽  
Point Stabilizer ◽  
Necessary And Sufficient ◽  
Regular Character ◽  
Permutation Character

AbstractLet G be a finite transitive permutation group of degree n, with point stabilizer {H\neq 1} and permutation character π. For every positive integer t, we consider the generalized character {\psi_{t}=\rho_{G}-t(\pi-1_{G})}, where {\rho_{G}} is the regular character of G and {1_{G}} the 1-character. We give necessary and sufficient conditions on t (and G) which guarantee that {\psi_{t}} is a character of G. A necessary condition is that {t\leq\min\{n-1,\lvert H\rvert\}}, and it turns out that {\psi_{t}} is a character of G for {t=n-1} resp. {t=\lvert H\rvert} precisely when G is 2-transitive resp. a Frobenius group.

Resolution systems and their applications I

1980 ◽  
Vol 3 (2) ◽  
pp. 235-268
Author(s):  
Ewa Orłowska
Keyword(s):  
Theorem Proving ◽  
Sufficient Conditions ◽  
Predicate Calculus ◽  
Resolution Method ◽  
First Order ◽  
Deductive Systems ◽  
Resolution System ◽  
Resolution Principle ◽  
Necessary And Sufficient ◽  
Classical Predicate

The central method employed today for theorem-proving is the resolution method introduced by J. A. Robinson in 1965 for the classical predicate calculus. Since then many improvements of the resolution method have been made. On the other hand, treatment of automated theorem-proving techniques for non-classical logics has been started, in connection with applications of these logics in computer science. In this paper a generalization of a notion of the resolution principle is introduced and discussed. A certain class of first order logics is considered and deductive systems of these logics with a resolution principle as an inference rule are investigated. The necessary and sufficient conditions for the so-called resolution completeness of such systems are given. A generalized Herbrand property for a logic is defined and its connections with the resolution-completeness are presented. A class of binary resolution systems is investigated and a kind of a normal form for derivations in such systems is given. On the ground of the methods developed the resolution system for the classical predicate calculus is described and the resolution systems for some non-classical logics are outlined. A method of program synthesis based on the resolution system for the classical predicate calculus is presented. A notion of a resolution-interpretability of a logic L in another logic L ′ is introduced. The method of resolution-interpretability consists in establishing a relation between formulas of the logic L and some sets of formulas of the logic L ′ with the intention of using the resolution system for L ′ to prove theorems of L. It is shown how the method of resolution-interpretability can be used to prove decidability of sets of unsatisfiable formulas of a given logic.

scholarly journals On circulant codes with prescribed distances

1977 ◽  
Vol 16 (3) ◽  
pp. 361-369
Author(s):  
M. Deza ◽  
Peter Eades
Keyword(s):  
Sufficient Conditions ◽  
Difference Sets ◽  
Necessary And Sufficient Conditions ◽  
Necessary Condition ◽  
Weighing Matrices ◽  
Cyclic Difference Sets ◽  
The Matrix ◽  
Circulant Codes ◽  
Necessary And Sufficient ◽  
Square Matrix

Necessary and sufficient conditions are given for a square matrix to te the matrix of distances of a circulant code. These conditions are used to obtain some inequalities for cyclic difference sets, and a necessary condition for the existence of circulant weighing matrices.

System Properties of One-Dimensional Distributed Systems

1977 ◽  
Vol 99 (2) ◽  
pp. 85-90 ◽  
Author(s):  
L. S. Bonderson
Keyword(s):  
Distributed Systems ◽  
Sufficient Conditions ◽  
State Variables ◽  
One Dimensional ◽  
First Order ◽  
Lumped Element ◽  
Order Form ◽  
Power Product ◽  
System Properties ◽  
Necessary And Sufficient

The system properties of passivity, losslessness, and reciprocity are defined and their necessary and sufficient conditions are derived for a class of linear one-dimensional multipower distributed systems. The utilization of power product pairs as state variables and the representation of the dynamics in first-order form allows results completely analogous to those for lumped-element systems.

Separability criteria based on the Bloch representation of density matrices

2007 ◽  
Vol 7 (7) ◽  
pp. 624-638
Author(s):  
J. de Vicente
Keyword(s):  
Sufficient Conditions ◽  
Quantum Systems ◽  
Necessary Condition ◽  
Sufficient Condition ◽  
Pure Product ◽  
Separability Problem ◽  
Arbitrary Dimensions ◽  
Necessary And Sufficient ◽  
Bloch Representation

We study the separability of bipartite quantum systems in arbitrary dimensions using the Bloch representation of their density matrix. This approach enables us to find an alternative characterization of the separability problem, from which we derive a necessary condition and sufficient conditions for separability. For a certain class of states the necessary condition and a sufficient condition turn out to be equivalent, therefore yielding a necessary and sufficient condition. The proofs of the sufficient conditions are constructive, thus providing decompositions in pure product states for the states that satisfy them. We provide examples that show the ability of these conditions to detect entanglement. In particular, the necessary condition is proved to be strong enough to detect bound entangled states.

Sign in / Sign up

Export Citation Format

Share Document