Low-rank dynamics for computing extremal points of real pseudospectra

DOI10.1137/120862399MaRDI QIDQ5300545zbMATHOpenAlexFDO

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

zbMATH Keywords

algorithmreal stability radiusextremal pointsreal pseudospectral abscissareal pseudospectrum

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Inequalities involving eigenvalues and eigenvectors (15A42) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

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

Cited in

(30)

• Computing the Structured Pseudospectrum of a Toeplitz Matrix and Its Extreme Points
• An iterative method for computing robustness of polynomial stability
• Pseudospectral method for assessing stability robustness for linear time-periodic delayed dynamical systems
• On the method by Rostami for computing the real stability radius of large and sparse matrices
• Rank-1 Matrix Differential Equations for Structured Eigenvalue Optimization.
• Robust linear stability analysis and a new method for computing the action of the matrix exponential
• Matrix Stabilization Using Differential Equations
• Computing the closest real normal matrix and normal completion
• On the real stability radius for some classes of matrices
• New algorithms for computing the real structured pseudospectral abscissa and the real stability radius of large and sparse matrices
• Criss-cross type algorithms for computing the real pseudospectral abscissa
• A novel iterative method to approximate structured singular values
• On the real stability radius of sparse systems
• Pseudospectra of Loewner matrix pencils
• Optimization and Pseudospectra, with Applications to Robust Stability
• Differential equations for roaming pseudospectra: paths to extremal points and boundary tracking
• Low rank differential equations for Hamiltonian matrix nearness problems
• Robust stability optimization for linear delay systems in a probabilistic framework
• Approximating the real structured stability radius with Frobenius-norm bounded perturbations
• Subspace method for the estimation of large-scale structured real stability radius
• Differential equations for real-structured defectivity measures
• Large-scale minimization of the pseudospectral abscissa
• On the Nearest Singular Matrix Pencil
• A scalable controller synthesis method for the robust control of networked systems
• Erratum/addendum: Differential equations for roaming pseudospectra: paths to extremal points and boundary tracking
• A gradient system for low rank matrix completion
• An efficient method for non-negative low-rank completion
• An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
• A structured pseudospectral method for \(\mathcal {H}_{\infty}\)-norm computation of large-scale descriptor systems
• Computing extremal points of symplectic pseudospectra and solving symplectic matrix nearness problems

Describes a project that uses

Uses Software

• ARPACK

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)