HOME

TheInfoList



OR:

In
mathematics Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many ar ...
, a -matrix is a
complex Complex commonly refers to: * Complexity, the behaviour of a system whose components interact in multiple ways so possible interactions are difficult to describe ** Complex system, a system composed of many components which may interact with each ...
square matrix In mathematics, a square matrix is a Matrix (mathematics), matrix with the same number of rows and columns. An ''n''-by-''n'' matrix is known as a square matrix of order Any two square matrices of the same order can be added and multiplied. Squ ...
with every principal minor is positive. A closely related class is that of P_0-matrices, which are the closure of the class of -matrices, with every principal minor \geq 0.


Spectra of -matrices

By a theorem of Kellogg, the
eigenvalue In linear algebra, an eigenvector ( ) or characteristic vector is a vector that has its direction unchanged (or reversed) by a given linear transformation. More precisely, an eigenvector \mathbf v of a linear transformation T is scaled by a ...
s of - and P_0- matrices are bounded away from a wedge about the negative real axis as follows: :If \ are the eigenvalues of an -dimensional -matrix, where n>1, then ::, \arg(u_i), < \pi - \frac,\ i = 1,...,n :If \, u_i \neq 0, i = 1,...,n are the eigenvalues of an -dimensional P_0-matrix, then ::, \arg(u_i), \leq \pi - \frac,\ i = 1,...,n


Remarks

The class of nonsingular ''M''-matrices is a subset of the class of -matrices. More precisely, all matrices that are both -matrices and ''Z''-matrices are nonsingular -matrices. The class of sufficient matrices is another generalization of -matrices. The
linear complementarity problem In mathematical optimization theory, the linear complementarity problem (LCP) arises frequently in computational mechanics and encompasses the well-known quadratic programming as a special case. It was proposed by Cottle and Dantzig in 1968 ...
\mathrm(M,q) has a unique solution for every vector if and only if is a -matrix. This implies that if is a -matrix, then is a -matrix. If the Jacobian of a function is a -matrix, then the function is injective on any rectangular region of \mathbb^n. A related class of interest, particularly with reference to stability, is that of P^-matrices, sometimes also referred to as N-P-matrices. A matrix is a P^-matrix if and only if (-A) is a -matrix (similarly for P_0-matrices). Since \sigma(A) = -\sigma(-A), the eigenvalues of these matrices are bounded away from the positive real axis.


See also

* Routh–Hurwitz matrix *
Linear complementarity problem In mathematical optimization theory, the linear complementarity problem (LCP) arises frequently in computational mechanics and encompasses the well-known quadratic programming as a special case. It was proposed by Cottle and Dantzig in 1968 ...
* M-matrix * Q-matrix * Z-matrix * Perron–Frobenius theorem


Notes


References

* * David Gale and Hukukane Nikaido, The Jacobian matrix and global univalence of mappings, ''Math. Ann.'' 159:81-93 (1965) * Li Fang, On the Spectra of - and P_0-Matrices, ''Linear Algebra and its Applications'' 119:1-25 (1989) * R. B. Kellogg, On complex eigenvalues of and {{mvar, P matrices, ''Numer. Math.'' 19:170-175 (1972) Matrix theory Matrices (mathematics)