Characterizations of complex P-matrices
A P-matrix is a square matrix all of whose principal minors are positive. Real P-matrices can be characterized as follows:\N\N{Theorem.} A real \(n\times n\) matrix \(A\) is a P-matrix if and only if, for every nonzero vector \(x\in \mathbb{R}^n\), there exists at least one \(j\in \{ 1, 2, \dots, n\}\) such that \(x_j(Ax)_j>0\); that is, the \(j\)-th entries of vectors \(x\) and \(Ax\) are both nonzero and have the same sign.\N\NIn this paper, the authors aim to characterize complex P-matrices and obtain the following characterization:\N\N{Theorem.} Let \(A\) be a complex \(n\times n\) matrix such that all principal submatrices of \(A\) have real characteristic polynomials. Then \(A\) is a P-matrix if and only if for every nonzero vector \(x\in \mathbb{C}^n\), \(Ax\) is not a reflection of \(x\).\N\NMoreover, the authors study the properties and factorizations of complex P-matrices.
- Convex sets of nonsingular and P:–Matrices
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- scientific article; zbMATH DE number 3212891 (Why is no real title available?)
- Matrix Positivity
- On the Cayley transform of positivity classes of matrices
- Principal pivot transforms: Properties and applications
- Recent directions in matrix stability
- Stabilization by a Diagonal Matrix
- The fibre of P-matrices: the recursive construction of all matrices with positive principal minors
This page was built for publication: Characterizations of complex P-matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6628872)
