Principal minors, Part II: The principal minor assignment problem

Linear Algebra and Its Applications

Volumn 419, Issue 1, 2006, Pages 125-171

  Griffin, Kent ^a   Tsatsomeros, Michael J ^a  

^a WASHINGTON STATE UNIVERSITY   (United States)

Author keywords

Inverse eigenvalue problem; Principal submatrix; Schur complement

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; MATRIX ALGEBRA; NUMERICAL METHODS; POLYNOMIALS; PROBLEM SOLVING;

ALGORITHMIC CONSTRUCTIONS; INVERSE EIGENVALUE PROBLEMS; PRINCIPAL SUBMATRIX; SCHUR COMPLEMENTS;

INVERSE PROBLEMS;

EID: 33748318179     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2006.04.009     Document Type: Article

References (5)

1. Coxson G.E. The P-matrix problem is co-NP-complete. Math. Program. 64 (1994) 173-178
2. K. Griffin and M.J. Tsatsomeros, Principal minors, Part I: A method for computing all the principal minors of a matrix, Linear Algebra Appl., in press, doi:10.1016/j.laa.2006.04.008.
3. Holtz O., and Schneider H. Open problems on GKK τ-matrices. Linear Algebra Appl. 345 (2002) 263-267
4. Loewy R. Principal minors and diagonal similarity of matrices. Linear Algebra Appl. 78 (1986) 23-64
5. Stouffer E.B. On the independence of principal minors of determinants. Trans. Amer. Math. Soc. 26 3 (1924) 356-368