Low-rank dynamics for computing extremal points of real pseudospectra
DOI10.1137/120862399zbMATH Open1272.65032OpenAlexW1972112356MaRDI QIDQ5300545FDOQ5300545
Authors: Christian Lubich, Nicola Guglielmi 
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 (30)
- Pseudospectral method for assessing stability robustness for linear time-periodic delayed dynamical systems
- Differential equations for roaming pseudospectra: paths to extremal points and boundary tracking
- Computing extremal points of symplectic pseudospectra and solving symplectic matrix nearness problems
- 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
- Low rank differential equations for Hamiltonian matrix nearness problems
- Rank-1 Matrix Differential Equations for Structured Eigenvalue Optimization.
- New algorithms for computing the real structured pseudospectral abscissa and the real stability radius of large and sparse matrices
- 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
- On the real stability radius of sparse systems
- A gradient system for low rank matrix completion
- Pseudospectra of Loewner matrix pencils
- On the method by Rostami for computing the real stability radius of large and sparse matrices
- Criss-cross type algorithms for computing the real pseudospectral abscissa
- An efficient method for non-negative low-rank completion
- Computing the Structured Pseudospectrum of a Toeplitz Matrix and Its Extreme Points
- Large-scale minimization of the pseudospectral abscissa
- 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
- Erratum/addendum: Differential equations for roaming pseudospectra: paths to extremal points and boundary tracking
- Optimization and Pseudospectra, with Applications to Robust Stability
- A novel iterative method to approximate structured singular values
- Differential equations for real-structured defectivity measures
- 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)
