An iterative method for computing robustness of polynomial stability

DOI10.1016/j.cam.2015.06.012zbMath1327.15013OpenAlexW1458533793MaRDI QIDQ495097

Manuela Manetta, Nicola Guglielmi

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

zbMATH Keywords

polynomial stabilitycompanion matricesperturbations of polynomialspseudozero setstability radiistructured pseudospectra

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Eigenvalues, singular values, and eigenvectors (15A18)

Uses Software

• eigs
• ARPACK
• Eigtool
• Seigtool
• PSAPSR

Cites Work

• Stability radius for structured perturbations and the algebraic Riccati equation
• On the stability radius of a Schur polynomial
• 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
• Perturbation theory for linear operators.
• Low rank differential equations for Hamiltonian matrix nearness problems
• Large-Scale Computation of Pseudospectra Using ARPACK and Eigs
• Fast Approximation of the $H_\infty$ Norm via Optimization over Spectral Value Sets
• Subspace Methods for Computing the Pseudospectral Abscissa and the Stability Radius
• Approximating real stability radii
• 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
• Invariance of the strict Hurwitz property for polynomials with perturbed coefficients
• Root Neighborhoods of a Polynomial
• Some results on robust stability of discrete-time systems
• Robustness measures for linear systems with application to stability radii of Hurwitz and Schur polynomials
• Linear Control Theory
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An iterative method for computing robustness of polynomial stability