Robust stability and a criss-cross algorithm for pseudospectra

DOI10.1093/IMANUM/23.3.359MaRDI QIDQ4457842zbMATH OpenOpenAlexFDO

Authors James V. Burke, Michael L. Overton, A. S. Lewis

Publication date 17 March 2004

Published in IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/823f805f68a6a5a9819fb1202619cfeb7e3722de

zbMATH Keywords

convergencenumerical examplesspectral abscissadynamical systemHamiltonian systemrobust stabilitypseudospectrumcriss-cross algorithm

Mathematics Subject Classification ID

Stability and convergence of numerical methods for ordinary differential equations (65L20) Numerical solution of eigenvalue problems involving ordinary differential equations (65L15)

Recommendations

• Criss-cross type algorithms for computing the real pseudospectral abscissa
• Optimization and Pseudospectra, with Applications to Robust Stability
• Algorithms for the computation of the pseudospectral radius and the numerical radius of a matrix
• Approximating real stability radii
• Computation of pseudozero abcissa

Cited in

(28)

• A structured pseudospectral method for \(\mathcal {H}_{\infty}\)-norm computation of large-scale descriptor systems
• Pseudospectra of matrix pencils for transient analysis of differential-algebraic equations
• Algorithms for the computation of the pseudospectral radius and the numerical radius of a matrix
• The transient response analysis of power systems by using pseudo-spectra
• Convergence Rate Analysis and Improved Iterations for Numerical Radius Computation
• Fast Interpolation-Based Globality Certificates for Computing Kreiss Constants and the Distance to Uncontrollability
• New algorithms for computing the real structured pseudospectral abscissa and the real stability radius of large and sparse matrices
• A Hamiltonian Krylov-Schur-type method based on the symplectic Lanczos process
• Computing the Kreiss constant of a matrix
• An effective nonsmooth optimization algorithm for locally Lipschitz functions
• Computation of pseudozero abcissa
• On the method by Rostami for computing the real stability radius of large and sparse matrices
• Criss-cross type algorithms for computing the real pseudospectral abscissa
• On matrix nearness problems: distance to delocalization
• Root-Max Problems, Hybrid Expansion-Contraction, and Quadratically Convergent Optimization of Passive Systems
• A note on computation of pseudospectra
• A Support Function Based Algorithm for Optimization with Eigenvalue Constraints
• Extended and improved criss-cross algorithms for computing the spectral value set abscissa and radius
• Subspace methods for computing the pseudospectral abscissa and the stability radius
• The pseudospectrum and transient of Kaluza-Klein black holes in Einstein-Gauss-Bonnet gravity
• Large-scale minimization of the pseudospectral abscissa
• A predictor-corrector type algorithm for the pseudospectral abscissa computation of time-delay systems
• Validated Spectral Stability via Conjugate Points
• On sensitivity of eigenvalues and eigendecompositions of matrices
• Fast computation of \(\mathrm{sep}_\lambda\) via interpolation-based globality certificates
• Variational analysis of convexly generated spectral max functions
• scientific article; zbMATH DE number 1424508 (Why is no real title available?)
• Optimization and Pseudospectra, with Applications to Robust Stability

Describes a project that uses

Uses Software

• Algorithm 800
• Matlab

This page was built for publication: Robust stability and a criss-cross algorithm for pseudospectra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4457842)