Principal minors. I: A method for computing all the principal minors of a matrix

DOI10.1016/J.LAA.2006.04.008zbMath1110.65034OpenAlexW2130604401MaRDI QIDQ854862

Kent Griffin, Michael J. Tsatsomeros

Publication date: 7 December 2006

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2006.04.008

zbMATH Keywords

complexitySchur complementparallel computationP-matrixprincipal submatrix\(LU\)-factorizationMATLAB programP-problem

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Positive matrices and their generalizations; cones of matrices (15B48) Parallel numerical computation (65Y05) Numerical computation of determinants (65F40) Complexity and performance of numerical algorithms (65Y20) Software, source code, etc. for problems pertaining to linear algebra (15-04)

Related Items (18)

Principal minors. II: The principal minor assignment problem ⋮ The quadrifocal variety ⋮ A practical test for assessing the reachability of discrete-time Takagi-Sugeno fuzzy systems ⋮ Hadamard Matrices: Insights into Their Growth Factor and Determinant Computations ⋮ Characterizing principal minors of symmetric matrices via determinantal multiaffine polynomials ⋮ Mapping and preserver properties of the principal pivot transform ⋮ On sign-real spectral radii and sign-real expansive matrices ⋮ An eigenvalue approach evaluating minors for weighing matrices \(W(n, n-1)\) ⋮ The sepr-sets of sign patterns ⋮ The signed enhanced principal rank characteristic sequence ⋮ Hyperdeterminantal relations among symmetric principal minors ⋮ Determination of the degrees of \(P\)-property and nonnegative invertibility for a fuzzy matrix ⋮ Determinant evaluations for binary circulant matrices ⋮ Noncirculant Toeplitz matrices all of whose powers are Toeplitz ⋮ The fibre of P-matrices: the recursive construction of all matrices with positive principal minors ⋮ Skew-symmetric matrices and their principal minors ⋮ Unnamed Item ⋮ An efficient algorithm for the symmetric principal minor assignment problem

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Drużkowski matrix search and \(D\)-nilpotent automorphisms.
• Principal minors. II: The principal minor assignment problem
• On inverse multiplicative eigenvalue problems for matrices
• The P-matrix problem is co-NP-complete
• Open problems on GKK \(\tau\)-matrices
• Computing exact bounds on elements of an inverse interval matrix is NP-hard
• Principal pivot transforms: Properties and applications
• Some generalizations of positive definiteness and monotonicity
• Matrix Analysis
• An Algorithm for Checking Regularity of Interval Matrices
• Interval P-Matrices
• An Identity for the Schur Complement of a Matrix
• Self-validating methods
• Verification for existence of solutions of linear complementarity problems

This page was built for publication: Principal minors. I: A method for computing all the principal minors of a matrix