References
- Tsatsomeros M. Generating and detecting matrices with positive principal minors. Asian Inform-Sci-Life. 2002;1:115–132.
- Cottle RW, Pang JS, Stone RE. The linear complementarity problem. Boston (MA): Academic Press; 1992.
- Coxson G. The P-matrix problem is co-NP-complete. Math Program. 1994;64:173–178. doi: 10.1007/BF01582570
- Megiddo N, Papadimitriou CH. On total functions, existence theorems and computational complexity. Theoret Comput Sci. 1991;81:317–324. doi: 10.1016/0304-3975(91)90200-L
- Johnson CR, Tsatsomeros M. Convex sets of nonsingular and P-matrices. Linear Multilinear A. 1995;38:233–239. doi: 10.1080/03081089508818359
- Morris WD. Recognition of hidden positive row diagonally dominant matrices. Electron J Linear Al. 2003;10:102–105.
- Morris WD, Namiki M. Good hidden P-matrix sandwiches. Linear Algebra Appl. 2007;426:325–341. doi: 10.1016/j.laa.2007.05.004
- Hershkowitz D, Mehrmann V, Schneider H. Nonnegative matrices, M-matrices and their generalizations. Oberwolfach, November 26 – December 2, 2000.
- Tsatsomeros M, Li L. A recursive test for P-matrices. BIT. 2000;40:404–408. doi: 10.1023/A:1022307527408
- Berman A, Plemmons RJ. Nonnegative matrices in the mathematical sciences. Philadelphia (PA): SIAM; 1994.
- Griffin K, Tsatsomeros M. Principal minors, part I: a method for computing all the principal minors of a matrix. Linear Algebra Appl. 2006;419:107–124. doi: 10.1016/j.laa.2006.04.008
- Griffin K, Tsatsomeros M. Principal minors, part II: the principal minor assignment problem. Linear Algebra Appl. 2006;419:125–171. doi: 10.1016/j.laa.2006.04.009