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
complexitySchur complementparallel computationP-matrixprincipal submatrix\(LU\)-factorizationMATLAB programP-problem
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
Uses Software
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