Subspace methods for computing the pseudospectral abscissa and the stability radius
From MaRDI portal
Recommendations
- New algorithms for computing the real structured pseudospectral abscissa and the real stability radius of large and sparse matrices
- An iterative method for computing the pseudospectral abscissa for a class of nonlinear eigenvalue problems
- Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
- Subspace method for the estimation of large-scale structured real stability radius
- Computation of pseudospectral abscissa for large-scale nonlinear eigenvalue problems
- Pseudospectra for matrix pencils and stability of equilibria
- Robust stability and a criss-cross algorithm for pseudospectra
- Guaranteed stability with subspace methods
- Some regularity results for the pseudospectral abscissa and pseudospectral radius of a matrix
- Subspace iterative methods for eigenvalue problems
Cited in
(28)- Computing spectral value sets using the subharmonicity of the norm of rational matrices
- Nearest -stable matrix via Riemannian optimization
- Solving symmetric and positive definite second-order cone linear complementarity problem by a rational Krylov subspace method
- Black-box learning of multigrid parameters
- Inheritance properties of Krylov subspace methods for continuous-time algebraic Riccati equations
- Krylov subspace methods for discrete-time algebraic Riccati equations
- On the method by Rostami for computing the real stability radius of large and sparse matrices
- Subspace acceleration for large-scale parameter-dependent Hermitian eigenproblems
- A subspace method for large-scale eigenvalue optimization
- A new approach for calculating the real stability radius
- Subspace acceleration for the Crawford number and related eigenvalue optimization problems
- Pseudospectra of matrix pencils for transient analysis of differential-algebraic equations
- Approximating the real structured stability radius with Frobenius-norm bounded perturbations
- Path-Following Method to Determine the Field of Values of a Matrix with High Accuracy
- Large-scale and global maximization of the distance to instability
- Computation of pseudospectral abscissa for large-scale nonlinear eigenvalue problems
- An iterative method for computing robustness of polynomial stability
- On matrix nearness problems: distance to delocalization
- Criss-cross type algorithms for computing the real pseudospectral abscissa
- Computing the Kreiss constant of a matrix
- Model Order Reduction in Contour Integral Methods for Parametric PDEs
- Rank-1 Matrix Differential Equations for Structured Eigenvalue Optimization.
- Variational characterization and Rayleigh quotient iteration of 2D eigenvalue problem with applications
- Large-scale minimization of the pseudospectral abscissa
- A reduced-\textsc{\textsc{irka}} method for large-scale \(\mathcal{H}_2\)-optimal model order reduction
- Minimization of the pseudospectral abscissa of a quadratic matrix polynomial
- Subspace methods for spectral and pseudo-spectral quantities
- Structured linear stability problems
Describes a project that uses
Uses Software
This page was built for publication: Subspace methods for computing the pseudospectral abscissa and the stability radius
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2877090)
