Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
From MaRDI portal
Publication:3225533
DOI10.1137/100817048zbMATH Open1248.65034OpenAlexW2156291021MaRDI QIDQ3225533FDOQ3225533
Authors: 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
Recommendations
- Algorithms for the computation of the pseudospectral radius and the numerical radius of a matrix
- New algorithms for computing the real structured pseudospectral abscissa and the real stability radius of large and sparse matrices
- Fast methods for computing the \(p\)-radius of matrices
- A fast algorithm for computing the pseudospectra of Toeplitz matrices
- Computation of pseudospectral abscissa for large-scale nonlinear eigenvalue problems
- Fast algorithms for spectral differentiation matrices
- Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness
- scientific article; zbMATH DE number 745262
- Approximating the weighted pseudospectra of large matrices
- An iterative method for computing the pseudospectral abscissa for a class of nonlinear eigenvalue problems
convergencesparse matrixalgorithmspectral abscissaspectral radiuseigenvalueiterative methodsingular valuegroup inversestability radiuspseudospectrumrobustness of linear systemsreduced resolvent
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)
Cited In (51)
- Pseudospectral method for assessing stability robustness for linear time-periodic delayed dynamical systems
- Low-rank dynamics for computing extremal points of real pseudospectra
- Destabilising nonnormal stochastic differential equations
- Stability of gyroscopic systems with respect to perturbations
- A new approach for calculating the real stability radius
- A structured pseudospectral method for \(\mathcal {H}_{\infty}\)-norm computation of large-scale descriptor systems
- A reduced basis approach to large-scale pseudospectra computation.
- Preservers of unitary similarity functions on Lie products of matrices
- Pseudospectra of matrix pencils for transient analysis of differential-algebraic equations
- Polytopic uncertainty for linear systems: new and old complexity results
- Algorithms for the computation of the pseudospectral radius and the numerical radius of a matrix
- A Block Algorithm for Matrix 1-Norm Estimation, with an Application to 1-Norm Pseudospectra
- Taylor's theorem for matrix functions with applications to condition number estimation
- Low rank differential equations for Hamiltonian matrix nearness problems
- Path-Following Method to Determine the Field of Values of a Matrix with High Accuracy
- Variational characterization and Rayleigh quotient iteration of 2D eigenvalue problem with applications
- Rank-1 Matrix Differential Equations for Structured Eigenvalue Optimization.
- Nearest \(\Omega \)-stable matrix via Riemannian optimization
- New algorithms for computing the real structured pseudospectral abscissa and the real stability radius of large and sparse matrices
- Fast approximation of the \(p\)-radius, matrix pressure, or generalized Lyapunov exponent for positive and dominated matrices
- First-order perturbation theory for eigenvalues and eigenvectors
- 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
- Computing the Kreiss constant of a matrix
- Finding the nearest passive or nonpassive system via Hamiltonian eigenvalue optimization
- Continuous approximation of linear impulsive systems and a new form of robust stability
- Spectral portrait for non-Hermitian large sparse matrices
- Computation of the nearest structured matrix triplet with common null space
- Computation of pseudospectral abscissa for large-scale nonlinear eigenvalue problems
- 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
- On matrix nearness problems: distance to delocalization
- Extended and improved criss-cross algorithms for computing the spectral value set abscissa and radius
- A Support Function Based Algorithm for Optimization with Eigenvalue Constraints
- PSAPSR
- Subspace methods for computing the pseudospectral abscissa and the stability radius
- Large-scale minimization of the pseudospectral abscissa
- Robust stability of differential-algebraic equations
- On the Nearest Singular Matrix Pencil
- Matrix Stabilization Using Differential Equations
- An iterative method for computing robustness of polynomial stability
- Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness
- Fast methods for computing the \(p\)-radius of matrices
- Recycling givens rotations for the efficient approximation of pseudospectra of band-dominated operators
- An iterative method for computing the pseudospectral abscissa for a class of nonlinear eigenvalue problems
- Stability and distance to instability for polynomial matrix families. Complex perturbations
- 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
- Faster and more accurate computation of the \(\mathcal{H}_\infty\) norm via optimization
Uses Software
This page was built for publication: Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3225533)
