Low-rank dynamics for computing extremal points of real pseudospectra
DOI10.1137/120862399zbMATH Open1272.65032OpenAlexW1972112356MaRDI QIDQ5300545FDOQ5300545
Nicola Guglielmi, Christian Lubich
Publication date: 27 June 2013
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/7e16136c38f6caf054f436601b1e550930a4fd26
Recommendations
- Differential equations for roaming pseudospectra: paths to extremal points and boundary tracking
- Approximating real stability radii
- Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
- Pseudospectra of rectangular matrices
- Criss-cross type algorithms for computing the real pseudospectral abscissa
Eigenvalues, singular values, and eigenvectors (15A18) Inequalities involving eigenvalues and eigenvectors (15A42) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cited In (25)
- Pseudospectral method for assessing stability robustness for linear time-periodic delayed dynamical systems
- A scalable controller synthesis method for the robust control of networked systems
- A structured pseudospectral method for \(\mathcal {H}_{\infty}\)-norm computation of large-scale descriptor systems
- On the real stability radius for some classes of matrices
- Robust stability optimization for linear delay systems in a probabilistic framework
- Criss-Cross Type Algorithms for Computing the Real Pseudospectral Abscissa
- Low rank differential equations for Hamiltonian matrix nearness problems
- Rank-1 Matrix Differential Equations for Structured Eigenvalue Optimization.
- On the real stability radius of sparse systems
- A gradient system for low rank matrix completion
- On the method by Rostami for computing the real stability radius of large and sparse matrices
- An efficient method for non-negative low-rank completion
- Computing the Structured Pseudospectrum of a Toeplitz Matrix and Its Extreme Points
- A Novel Iterative Method To Approximate Structured Singular Values
- Large-scale minimization of the pseudospectral abscissa
- New Algorithms for Computing the Real Structured Pseudospectral Abscissa and the Real Stability Radius of Large and Sparse Matrices
- On the Nearest Singular Matrix Pencil
- Matrix Stabilization Using Differential Equations
- Subspace method for the estimation of large-scale structured real stability radius
- An iterative method for computing robustness of polynomial stability
- Computing the closest real normal matrix and normal completion
- Approximating the Real Structured Stability Radius with Frobenius-Norm Bounded Perturbations
- Robust Linear Stability Analysis and a New Method for Computing the Action of the Matrix Exponential
- Optimization and Pseudospectra, with Applications to Robust Stability
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
Uses Software
This page was built for publication: Low-rank dynamics for computing extremal points of real pseudospectra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300545)
