A computational method for determining strong stabilizability of n-D systems
From MaRDI portal
(Redirected from Publication:1300577)
A computational method for determining strong stabilizability of \(n\)-D systems
A computational method for determining strong stabilizability of \(n\)-D systems
Recommendations
- Conditions for strong stabilizabilities of \(n\)-dimensional systems
- A constructive approach to stabilizability and stabilization of a class of \(n\)D systems
- scientific article; zbMATH DE number 4048155
- Stability of Computational Methods for Constrained Dynamics Systems
- Lyapunov stability of \(n\)-D strongly autonomous systems
- Stabilization of computational procedures for constrained dynamical systems
- Robust stability: The computational complexity point of view
- Computer-aided determination of stability robustness measure of linear discrete-time systems
- Stability of dynamical systems via semidefinite programming
- Computational tractable guaranteed numerical method to study the stability of \(n\)-dimensional time-independent nonlinear systems with bounded perturbation
Cites work
- scientific article; zbMATH DE number 3904433 (Why is no real title available?)
- scientific article; zbMATH DE number 3918206 (Why is no real title available?)
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- scientific article; zbMATH DE number 4070711 (Why is no real title available?)
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 803199 (Why is no real title available?)
- scientific article; zbMATH DE number 3276402 (Why is no real title available?)
- Algebraic Geometric Aspects of Feedback Stabilization
- Algebraic simplification
- An obstruction to the simultaneous stabilization of two n-D plants
- Conditions for strong stabilizabilities of \(n\)-dimensional systems
- Cylindrical Algebraic Decomposition I: The Basic Algorithm
- Feedback stabilizability of MIMO n-D linear systems
- General procedure for multivariable polynomial positivity test with control applications
- Graph theory applications
- NP-Hardness of Some Linear Control Design Problems
- Nonlinear control system design by quantifier elimination
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- Output feedback stabilizability and stabilization algorithms for 2D systems
- Output feedback stabilization and related problems-solution via decision methods
- Partial cylindrical algebraic decomposition for quantifier elimination
- Robust multi-objective feedback design by quantifier elimination
- Simulation and optimization by quantifier elimination
- Simultaneous stabilizability of three linear systems is rationally undecidable
- Single-loop feedback-stabilization of linear multivariable dynamical plants
- Testing stability by quantifier elimination
Cited in
(3)
This page was built for publication: A computational method for determining strong stabilizability of \(n\)-D systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1300577)