Robust stability and a criss-cross algorithm for pseudospectra

DOI10.1093/IMANUM/23.3.359zbMath1042.65060OpenAlexW1998990712MaRDI QIDQ4457842

James V. Burke, Michael L. Overton, Adrian 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

convergencerobust stabilitynumerical examplesdynamical systemHamiltonian systemspectral abscissapseudospectrumcriss-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)

Related Items (21)

New Algorithms for Computing the Real Structured Pseudospectral Abscissa and the Real Stability Radius of Large and Sparse Matrices ⋮ Variational analysis of convexly generated spectral max functions ⋮ Pseudospectra of Matrix Pencils for Transient Analysis of Differential-Algebraic Equations ⋮ Convergence Rate Analysis and Improved Iterations for Numerical Radius Computation ⋮ An effective nonsmooth optimization algorithm for locally Lipschitz functions ⋮ Fast computation of \(\mathrm{sep}_\lambda\) via interpolation-based globality certificates ⋮ Criss-Cross Type Algorithms for Computing the Real Pseudospectral Abscissa ⋮ Root-Max Problems, Hybrid Expansion-Contraction, and Quadratically Convergent Optimization of Passive Systems ⋮ A Support Function Based Algorithm for Optimization with Eigenvalue Constraints ⋮ A structured pseudospectral method for \(\mathcal {H}_{\infty}\)-norm computation of large-scale descriptor systems ⋮ A note on computation of pseudospectra ⋮ On sensitivity of eigenvalues and eigendecompositions of matrices ⋮ A Hamiltonian Krylov-Schur-type method based on the symplectic Lanczos process ⋮ A predictor-corrector type algorithm for the pseudospectral abscissa computation of time-delay systems ⋮ Extended and Improved Criss-Cross Algorithms for Computing the Spectral Value Set Abscissa and Radius ⋮ The pseudospectrum and transient of Kaluza-Klein black holes in Einstein-Gauss-Bonnet gravity ⋮ Large-scale minimization of the pseudospectral abscissa ⋮ On the Method by Rostami for Computing the Real Stability Radius of Large and Sparse Matrices ⋮ Fast Interpolation-Based Globality Certificates for Computing Kreiss Constants and the Distance to Uncontrollability ⋮ Computing the Kreiss Constant of a Matrix ⋮ On Matrix Nearness Problems: Distance to Delocalization

Uses Software

• Algorithm 800
• Unnamed Item

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