Ji\v r\'\i {} Rohn

Ji\v r\'\i {} Rohn
Checking positive definiteness or stability of symmetric interval matrices is NP-hard

Comment.Math.Univ.Carolinae 35,4 (1994) 795-797.

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

Keywords: positive definiteness, stability, nonsingularity, NP-hardness
AMS Subject Classification: 15A48, 15A18, 68Q25

PDF

Ji\v r\'\i {} Rohn Checking positive definiteness or stability of symmetric interval matrices is NP-hard

Ji\v r\'\i {} Rohn
Checking positive definiteness or stability of symmetric interval matrices is NP-hard