Extended and improved criss-cross algorithms for computing the spectral value set abscissa and radius
From MaRDI portal
Publication:5203963
Abstract: In this paper, we extend the original criss-cross algorithms for computing the -pseudospectral abscissa and radius to general spectral value sets. By proposing new root-finding-based strategies for the horizontal/radial search subphases, we significantly reduce the number of expensive Hamiltonian eigenvalue decompositions incurred, which typically translates to meaningful speedups in overall computation times. Furthermore, and partly necessitated by our root-finding approach, we develop a new way of handling the singular pencils or problematic interior searches that can arise when computing the -spectral value set radius. Compared to would-be direct extensions of the original algorithms, that is, without our additional modifications, our improved criss-cross algorithms are not only noticeably faster but also more robust and numerically accurate, for both spectral value set and pseudospectral problems.
Recommendations
- Criss-cross type algorithms for computing the real pseudospectral abscissa
- Robust stability and a criss-cross algorithm for pseudospectra
- Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
- Computation of pseudospectral abscissa for large-scale nonlinear eigenvalue problems
- Computing spectral value sets using the subharmonicity of the norm of rational matrices
Cites work
- scientific article; zbMATH DE number 3912200 (Why is no real title available?)
- scientific article; zbMATH DE number 3920686 (Why is no real title available?)
- scientific article; zbMATH DE number 1405268 (Why is no real title available?)
- scientific article; zbMATH DE number 1445419 (Why is no real title available?)
- scientific article; zbMATH DE number 2212009 (Why is no real title available?)
- A Bisection Method for Measuring the Distance of a Stable Matrix to the Unstable Matrices
- A structured pseudospectral method for \(\mathcal {H}_{\infty}\)-norm computation of large-scale descriptor systems
- Algorithms for the computation of the pseudospectral radius and the numerical radius of a matrix
- Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
- Fast approximation of the \(H_\infty\) norm via optimization over spectral value sets
- Faster and more accurate computation of the \(\mathcal{H}_\infty\) norm via optimization
- Hybrid expansion-contraction: a robust scaleable method for approximating the \(H_{\infty}\) norm
- Hydrodynamic stability without eigenvalues
- Large-scale computation of pseudospectra using ARPACK and eigs
- Mathematical Systems Theory I
- On eigenvalues of matrices dependent on a parameter
- Robust stability and a criss-cross algorithm for pseudospectra
- Second Derivatives for Optimizing Eigenvalues of Symmetric Matrices
- Singular control systems
- Stability radii of linear discrete‐time systems and symplectic pencils
Cited in
(8)- Convergence Rate Analysis and Improved Iterations for Numerical Radius Computation
- Fast Interpolation-Based Globality Certificates for Computing Kreiss Constants and the Distance to Uncontrollability
- Nearest \(\Omega \)-stable matrix via Riemannian optimization
- Computing the Kreiss constant of a matrix
- Criss-cross type algorithms for computing the real pseudospectral abscissa
- Root-Max Problems, Hybrid Expansion-Contraction, and Quadratically Convergent Optimization of Passive Systems
- Large-scale minimization of the pseudospectral abscissa
- Fast computation of \(\mathrm{sep}_\lambda\) via interpolation-based globality certificates
This page was built for publication: Extended and improved criss-cross algorithms for computing the spectral value set abscissa and radius
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5203963)
