Low-Rank Dynamics for Computing Extremal Points of Real Pseudospectra
From MaRDI portal
Publication:5300545
DOI10.1137/120862399zbMath1272.65032OpenAlexW1972112356MaRDI QIDQ5300545
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
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Inequalities involving eigenvalues and eigenvectors (15A42) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (21)
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 ⋮ Robust stability optimization for linear delay systems in a probabilistic framework ⋮ On the real stability radius of sparse systems ⋮ A Novel Iterative Method To Approximate Structured Singular Values ⋮ On the Nearest Singular Matrix Pencil ⋮ Subspace method for the estimation of large-scale structured real stability radius ⋮ Approximating the Real Structured Stability Radius with Frobenius-Norm Bounded Perturbations ⋮ Criss-Cross Type Algorithms for Computing the Real Pseudospectral Abscissa ⋮ Matrix Stabilization Using Differential Equations ⋮ Rank-1 Matrix Differential Equations for Structured Eigenvalue Optimization. ⋮ An iterative method for computing robustness of polynomial stability ⋮ An efficient method for non-negative low-rank completion ⋮ A structured pseudospectral method for \(\mathcal {H}_{\infty}\)-norm computation of large-scale descriptor systems ⋮ Robust Linear Stability Analysis and a New Method for Computing the Action of the Matrix Exponential ⋮ Low rank differential equations for Hamiltonian matrix nearness problems ⋮ On the Method by Rostami for Computing the Real Stability Radius of Large and Sparse Matrices ⋮ Computing the closest real normal matrix and normal completion ⋮ A gradient system for low rank matrix completion ⋮ A scalable controller synthesis method for the robust control of networked systems ⋮ 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
