Interval P-Matrices
Copyright policy )Interval P-Matrices
Summary: A characterization of interval \(P\)-matrices is given. The result implies that a symmetric interval matrix is a \(P\)-matrix if and only if it is positive definite (although nonsymmetric matrices may be involved). As a consequence it is proved that the problem of checking whether a symmetric interval matrix is a \(P\)-matrix is NP-hard.
Positive matrices and their generalizations; cones of matrices, \(P\)-matrix, positive definiteness, Analysis of algorithms and problem complexity, Interval and finite arithmetic, interval matrix, NP-hardness
Positive matrices and their generalizations; cones of matrices, \(P\)-matrix, positive definiteness, Analysis of algorithms and problem complexity, Interval and finite arithmetic, interval matrix, NP-hardness
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).24 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!