A computational method for determining strong stabilizability of \(n\)-D systems
From MaRDI portal
Publication:1300577
DOI10.1006/jsco.1999.0263zbMath0936.93045OpenAlexW2038876958MaRDI QIDQ1300577
Jiang Qian Ying, Li Xu, Zhiping Lin
Publication date: 18 May 2000
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1999.0263
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- Partial cylindrical algebraic decomposition for quantifier elimination
- Graph theory applications
- Simultaneous stabilizability of three linear systems is rationally undecidable
- Output feedback stabilizability and stabilization algorithms for 2D systems
- An obstruction to the simultaneous stabilization of two \(n\)-\(D\) plants
- Nonlinear control system design by quantifier elimination
- Robust multi-objective feedback design by quantifier elimination
- Testing stability by quantifier elimination
- Simulation and optimization by quantifier elimination
- Conditions for strong stabilizabilities of \(n\)-dimensional systems
- Feedback stabilizability of MIMO n-D linear systems
- Single-loop feedback-stabilization of linear multivariable dynamical plants
- Algebraic Geometric Aspects of Feedback Stabilization
- Output feedback stabilization and related problems-solution via decision methods
- General procedure for multivariable polynomial positivity test with control applications
- NP-Hardness of Some Linear Control Design Problems
- Cylindrical Algebraic Decomposition I: The Basic Algorithm
This page was built for publication: A computational method for determining strong stabilizability of \(n\)-D systems
