# Is there a fast algorithm to test positivity of all principal minors of non-symmetric matrix?

I have a matrix $A \in \mathbb{R}^{n \times n}$ with positive eigenvalues. In the symmetric case, Sylvester's criterion implies that all the principal minors are positive. In the non-symmetric case, is there an $O(n^\omega)$ algorithm to determine if all the principal minors are positive?

• Isn't the determinant the product of the diagonal entries upon reduction to upper triangular form via Gaussian elimination? – Rodrigo de Azevedo Jul 29 '18 at 19:17
• @RodrigodeAzevedo - Thanks for your comments. I have fixed the errors you noted. As you point out there are fast methods to calculate any given minor, but there are an exponential number of such minors. – Gabriel Mitchell Aug 1 '18 at 18:14
• Which minors? What do you want to conclude? Positive definiteness? Then it's only $n$ leading principal minors. Not exponential at all. – Rodrigo de Azevedo Aug 1 '18 at 18:28
• @RodrigodeAzevedo - positivity of all the principal minors if what I am looking for. I don't especially care about positive definiteness, but if it implies positivity of all the principal minors then that is great. Do you know of any proof of that conjecture valid for non-symmetric matrices? I am only aware of the proof in the symmetric case. – Gabriel Mitchell Aug 1 '18 at 21:29
• Why do you care about the positivity of all the principal minors? Why not their non-negativity? Why is the non-symmetric case interesting? The skew-symmetric part contributes nothing to a quadratic form. – Rodrigo de Azevedo Aug 1 '18 at 21:33