Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
From MaRDI portal
Publication:3225533
DOI10.1137/100817048zbMath1248.65034OpenAlexW2156291021MaRDI QIDQ3225533
Michael L. Overton, Nicola Guglielmi
Publication date: 21 March 2012
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/223094377a87446ba31912c427e1ceb0d2fb7da5
algorithmconvergenceeigenvaluespectral radiusiterative methodsparse matrixstability radiusspectral abscissagroup inversepseudospectrumsingular valuerobustness of linear systemsreduced resolvent
Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Preservers of unitary similarity functions on Lie products of matrices, Taylor's theorem for matrix functions with applications to condition number estimation, New Algorithms for Computing the Real Structured Pseudospectral Abscissa and the Real Stability Radius of Large and Sparse Matrices, Faster and More Accurate Computation of the $\mathcal{H}_\infty$ Norm via Optimization, Computation of the nearest structured matrix triplet with common null space, Stability and distance to instability for polynomial matrix families. Complex perturbations, Continuous approximation of linear impulsive systems and a new form of robust stability, A Novel Iterative Method To Approximate Structured Singular Values, Pseudospectra of Matrix Pencils for Transient Analysis of Differential-Algebraic Equations, On the Nearest Singular Matrix Pencil, A new approach for calculating the real stability radius, Approximating the Real Structured Stability Radius with Frobenius-Norm Bounded Perturbations, Matrix Stabilization Using Differential Equations, Rank-1 Matrix Differential Equations for Structured Eigenvalue Optimization., First-Order Perturbation Theory for Eigenvalues and Eigenvectors, A Support Function Based Algorithm for Optimization with Eigenvalue Constraints, Stability of Gyroscopic Systems with Respect to Perturbations, Polytopic uncertainty for linear systems: new and old complexity results, An iterative method for computing robustness of polynomial stability, Path-Following Method to Determine the Field of Values of a Matrix with High Accuracy, A structured pseudospectral method for \(\mathcal {H}_{\infty}\)-norm computation of large-scale descriptor systems, Robust Stability of Differential-Algebraic Equations, Robust Linear Stability Analysis and a New Method for Computing the Action of the Matrix Exponential, Extended and Improved Criss-Cross Algorithms for Computing the Spectral Value Set Abscissa and Radius, 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, Nearest \(\Omega \)-stable matrix via Riemannian optimization, PSAPSR, Computing the Kreiss Constant of a Matrix, On Matrix Nearness Problems: Distance to Delocalization, Differential Equations for Real-Structured Defectivity Measures, Destabilising nonnormal stochastic differential equations, Finding the Nearest Passive or Nonpassive System via Hamiltonian Eigenvalue Optimization, An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
Uses Software
