An iterative method for computing robustness of polynomial stability
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4202151 (Why is no real title available?)
- scientific article; zbMATH DE number 5640277 (Why is no real title available?)
- scientific article; zbMATH DE number 3696942 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- scientific article; zbMATH DE number 2212009 (Why is no real title available?)
- A unified approach for the stability robustness of polynomials in a convex set
- Applications of optimization methods to robust stability of linear systems
- Approximating real stability radii
- Computing extremal points of symplectic pseudospectra and solving symplectic matrix nearness problems
- Differential equations for roaming pseudospectra: paths to extremal points and boundary tracking
- Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
- Fast approximation of the \(H_\infty\) norm via optimization over spectral value sets
- Invariance of the strict Hurwitz property for polynomials with perturbed coefficients
- Large-scale computation of pseudospectra using ARPACK and eigs
- Linear Control Theory
- Low rank differential equations for Hamiltonian matrix nearness problems
- Low-rank dynamics for computing extremal points of real pseudospectra
- On the stability radius of a Schur polynomial
- Perturbation theory for linear operators.
- Pseudozeros of polynomials and pseudospectra of companion matrices
- Real and complex pseudozero sets for polynomials with applications
- Robustness measures for linear systems with application to stability radii of Hurwitz and Schur polynomials
- Root Neighborhoods of a Polynomial
- Some results on robust stability of discrete-time systems
- Stability radius for structured perturbations and the algebraic Riccati equation
- Subspace methods for computing the pseudospectral abscissa and the stability radius
Cited in
(5)- Computation of pseudozero abcissa
- A Method for Identifying Stability Regimes Using Roots of a Reduced-Order Polynomial
- A fast iterative method for determining the stability of a polynomial
- scientific article; zbMATH DE number 4143309 (Why is no real title available?)
- Computing the structured distance to instability
This page was built for publication: An iterative method for computing robustness of polynomial stability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q495097)
