Robust stability and a criss-cross algorithm for pseudospectra
DOI10.1093/IMANUM/23.3.359zbMATH Open1042.65060OpenAlexW1998990712MaRDI QIDQ4457842FDOQ4457842
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
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
convergencenumerical examplesspectral abscissadynamical systemHamiltonian systemrobust stabilitypseudospectrumcriss-cross algorithm
Stability and convergence of numerical methods for ordinary differential equations (65L20) Numerical solution of eigenvalue problems involving ordinary differential equations (65L15)
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
- Convergence Rate Analysis and Improved Iterations for Numerical Radius Computation
- The transient response analysis of power systems by using pseudo-spectra
- 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
- Computation of pseudozero abcissa
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- On the method by Rostami for computing the real stability radius of large and sparse matrices
- Root-Max Problems, Hybrid Expansion-Contraction, and Quadratically Convergent Optimization of Passive Systems
- Criss-cross type algorithms for computing the real pseudospectral abscissa
- On matrix nearness problems: distance to delocalization
- Extended and improved criss-cross algorithms for computing the spectral value set abscissa and radius
- A Support Function Based Algorithm for Optimization with Eigenvalue Constraints
- A note on computation of pseudospectra
- 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
- Validated Spectral Stability via Conjugate Points
- A predictor-corrector type algorithm for the pseudospectral abscissa computation of time-delay systems
- Fast computation of \(\mathrm{sep}_\lambda\) via interpolation-based globality certificates
- On sensitivity of eigenvalues and eigendecompositions of matrices
- Title not available (Why is that?)
- Variational analysis of convexly generated spectral max functions
- Optimization and Pseudospectra, with Applications to Robust Stability
Uses Software
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)
