scientific article; zbMATH DE number 733109

MaRDI QIDQ4325575zbMATH OpenFDO

Authors Jiří Rohn

Publication date 13 March 1995

Full work available at URL https://eudml.org/doc/118628

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

interval matrixNP-hardpositive definitenessstability

Mathematics Subject Classification ID

Positive matrices and their generalizations; cones of matrices (15B48) Interval and finite arithmetic (65G30) Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Several NP-hard problems arising in robust stability analysis
• Interval P-Matrices
• Positive-definiteness of interval families of symmetric matrices
• Checking robust nonsingularity is NP-hard
• Linear interval equations: Computing enclosures with bounded relative or absolute overestimation is NP-hard

Cited in

(27)

• Several NP-hard problems arising in robust stability analysis
• Positive-definiteness of interval families of symmetric matrices
• Diagonal matrix scaling is NP-hard
• Complexity issues for the symmetric interval eigenvalue problem
• On the complexity of matrix rank and rigidity
• An iterative algorithm for the stability analysis of dynamic interval systems
• Determining the positive definiteness margin of interval matrices
• Verification of positive definiteness
• Eigenvalue range determination for interval and parametric matrices
• Checking strict positivity of Kraus maps is NP-hard
• Determining the range of real eigenvalues for the interval generalized eigenvalue problem
• Interval Linear Algebra and Computational Complexity
• Determinants of interval matrices
• Tolerances, robustness and parametrization of matrix properties related to optimization problems
• Interval P-Matrices
• Upper (lower) bounds of the eigenvalues, spread and the open problems for the real symmetric interval matrices
• On the NP-Hardness of Checking Matrix Polytope Stability and Continuous-Time Switching Stability
• Enclosure of all index-1 saddle points of general nonlinear functions
• Properties of the Solution Set of Absolute Value Equations and the Related Matrix Classes
• A survey of computational complexity results in systems and control
• NP-hardness of the stable matrix in unit interval family problem in discrete time
• Probabilistic solutions to some NP-hard matrix problems
• Calculation of exact bounds for the solution set of linear interval systems
• Testing pseudoconvexity via interval computation
• Lyapunov matrix equation with interval right-hand side: CR-method for the united inner solution set
• Positive definiteness of Hermitian interval matrices
• Reduced vertex set result for interval semidefinite optimization problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4325575)