An iterative method for computing robustness of polynomial stability
DOI10.1016/J.CAM.2015.06.012zbMATH Open1327.15013OpenAlexW1458533793MaRDI QIDQ495097FDOQ495097
Authors: Nicola Guglielmi, Manuela Manetta
Publication date: 9 September 2015
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2015.06.012
Recommendations
polynomial stabilitycompanion matricesperturbations of polynomialspseudozero setstability radiistructured pseudospectra
Numerical mathematical programming methods (65K05) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Large-scale computation of pseudospectra using ARPACK and eigs
- Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
- Title not available (Why is that?)
- Perturbation theory for linear operators.
- Title not available (Why is that?)
- Stability radius for structured perturbations and the algebraic Riccati equation
- Subspace methods for computing the pseudospectral abscissa and the stability radius
- Linear Control Theory
- A unified approach for the stability robustness of polynomials in a convex set
- Applications of optimization methods to robust stability of linear systems
- Pseudozeros of polynomials and pseudospectra of companion matrices
- Low rank differential equations for Hamiltonian matrix nearness problems
- Fast approximation of the \(H_\infty\) norm via optimization over spectral value sets
- Approximating real stability radii
- Differential equations for roaming pseudospectra: paths to extremal points and boundary tracking
- Invariance of the strict Hurwitz property for polynomials with perturbed coefficients
- Title not available (Why is that?)
- Title not available (Why is that?)
- Root Neighborhoods of a Polynomial
- Some results on robust stability of discrete-time systems
- Title not available (Why is that?)
- Robustness measures for linear systems with application to stability radii of Hurwitz and Schur polynomials
- Computing Extremal Points of Symplectic Pseudospectra and Solving Symplectic Matrix Nearness Problems
- Low-rank dynamics for computing extremal points of real pseudospectra
- Real and complex pseudozero sets for polynomials with applications
- On the stability radius of a Schur polynomial
Cited In (4)
Uses Software
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)