The fibre of P-matrices: the recursive construction of all matrices with positive principal minors
From MaRDI portal
Publication:4965585
Recommendations
Cites work
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- A recursive test for P-matrices
- Convex sets of nonsingular and P:–Matrices
- Good hidden \(P\)-matrix sandwiches
- On total functions, existence theorems and computational complexity
- Principal minors. I: A method for computing all the principal minors of a matrix
- Principal minors. II: The principal minor assignment problem
- Recognition of hidden positive row diagonally dominant matrices
- The P-matrix problem is co-NP-complete
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
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)