The fibre of P-matrices: the recursive construction of all matrices with positive principal minors
DOI10.1080/03081087.2019.1593311zbMATH Open1461.15036OpenAlexW2922898185WikidataQ128185875 ScholiaQ128185875MaRDI QIDQ4965585FDOQ4965585
Authors: Yueqiao Faith Zhang, M. Tsatsomeros 
Publication date: 6 March 2021
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2019.1593311
Recommendations
Factorization of matrices (15A23) Determinants, permanents, traces, other special matrix functions (15A15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Special matrices (15B99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convex sets of nonsingular and P:–Matrices
- On total functions, existence theorems and computational complexity
- Principal minors. II: The principal minor assignment problem
- Principal minors. I: A method for computing all the principal minors of a matrix
- The P-matrix problem is co-NP-complete
- Good hidden \(P\)-matrix sandwiches
- A recursive test for P-matrices
- Recognition of hidden positive row diagonally dominant matrices
Cited In (6)
- An asymptotic approach for testing \(P_{0}\)-matrices
- Good hidden \(P\)-matrix sandwiches
- Characterizations of complex P-matrices
- Recursive rank one perturbations for pole placement and cone reachability
- Principal minors. I: A method for computing all the principal minors of a matrix
- The almost semimonotone matrices
Uses Software
This page was built for publication: The fibre of P-matrices: the recursive construction of all matrices with positive principal minors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4965585)
