On the complexity of the robust stability problem for linear parameter varying systems

DOI10.1016/S0005-1098(97)00129-5zbMath0914.93046WikidataQ126773974 ScholiaQ126773974MaRDI QIDQ1129709

Onur Toker

Publication date: 20 August 1998

Published in: Automatica (Search for Journal in Brave)

zbMATH Keywords

computational complexitydiscrete systemsNP-hardlinear parameter varying systemsinput/output stability

Mathematics Subject Classification ID

Discrete-time control/observation systems (93C55) Input-output approaches in control theory (93D25) Robust stability (93D09) Model systems in control theory (93C99)

Related Items (5)

Design of linear parameter varying quadratic regulator in polynomial chaos framework ⋮ Probabilistic design of LPV control systems. ⋮ A survey of computational complexity results in systems and control ⋮ Model reference FTC for LPV systems using virtual actuators and set‐membership fault estimation ⋮ The boundedness of all products of a pair of matrices is undecidable

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic unsolvability of problem of absolute stability of desynchronized systems
• Bounded semigroups of matrices
• Several NP-hard problems arising in robust stability analysis
• The finiteness conjecture for the generalized spectral radius of a set of matrices
• Checking robust nonsingularity is NP-hard
• Stability of discrete linear inclusion
• Stability of dynamical systems: A constructive approach
• Constructive stability and asymptotic stability of dynamical systems
• Computational complexity of μ calculation
• Robust stability with time-varying structured uncertainty
• Robust performance against time-varying structured perturbations

This page was built for publication: On the complexity of the robust stability problem for linear parameter varying systems