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