论文信息 - Checking positive definiteness or stability of symmetric interval matrices is NP-hard

Checking positive definiteness or stability of symmetric interval matrices is NP-hard

It is proved that checking positive definiteness, stability or nonsingularity of all [symmetric] matrices contained in a symmetric interval matrix is NP-hard.

J. Rohn

[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2] Svatopluk Poljak,et al. Checking robust nonsingularity is NP-hard , 1993, Math. Control. Signals Syst..

[3] Arkadi Nemirovski,et al. Several NP-hard problems arising in robust stability analysis , 1993, Math. Control. Signals Syst..

[4] J. Rohn. Positive Definiteness and Stability of Interval Matrices , 1994, SIAM J. Matrix Anal. Appl..