Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
From MaRDI portal
Publication:3225533
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
Cited in
(51)- Variational characterization and Rayleigh quotient iteration of 2D eigenvalue problem with applications
- Preservers of unitary similarity functions on Lie products of matrices
- An iterative method for computing robustness of polynomial stability
- Nearest \(\Omega \)-stable matrix via Riemannian optimization
- A Support Function Based Algorithm for Optimization with Eigenvalue Constraints
- Pseudospectral method for assessing stability robustness for linear time-periodic delayed dynamical systems
- Stability and distance to instability for polynomial matrix families. Complex perturbations
- 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
- Pseudospectra of matrix pencils for transient analysis of differential-algebraic equations
- Computing the Kreiss constant of a matrix
- New algorithms for computing the real structured pseudospectral abscissa and the real stability radius of large and sparse matrices
- Taylor's theorem for matrix functions with applications to condition number estimation
- Fast approximation of the \(p\)-radius, matrix pressure, or generalized Lyapunov exponent for positive and dominated matrices
- Recycling givens rotations for the efficient approximation of pseudospectra of band-dominated operators
- Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness
- A Block Algorithm for Matrix 1-Norm Estimation, with an Application to 1-Norm Pseudospectra
- Criss-cross type algorithms for computing the real pseudospectral abscissa
- A novel iterative method to approximate structured singular values
- Polytopic uncertainty for linear systems: new and old complexity results
- First-order perturbation theory for eigenvalues and eigenvectors
- A new approach for calculating the real stability radius
- On matrix nearness problems: distance to delocalization
- Continuous approximation of linear impulsive systems and a new form of robust stability
- Fast methods for computing the \(p\)-radius of matrices
- Computation of the nearest structured matrix triplet with common null space
- Computation of pseudospectral abscissa for large-scale nonlinear eigenvalue problems
- Optimization and Pseudospectra, with Applications to Robust Stability
- Low rank differential equations for Hamiltonian matrix nearness problems
- A reduced basis approach to large-scale pseudospectra computation.
- Approximating the real structured stability radius with Frobenius-norm bounded perturbations
- PSAPSR
- Differential equations for real-structured defectivity measures
- Spectral portrait for non-Hermitian large sparse matrices
- Large-scale minimization of the pseudospectral abscissa
- Subspace methods for computing the pseudospectral abscissa and the stability radius
- Robust stability of differential-algebraic equations
- On the Nearest Singular Matrix Pencil
- Finding the nearest passive or nonpassive system via Hamiltonian eigenvalue optimization
- Faster and more accurate computation of the \(\mathcal{H}_\infty\) norm via optimization
- Low-rank dynamics for computing extremal points of real pseudospectra
- Algorithms for the computation of the pseudospectral radius and the numerical radius of a matrix
- Destabilising nonnormal stochastic differential equations
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
- An iterative method for computing the pseudospectral abscissa for a class of nonlinear eigenvalue problems
- Stability of gyroscopic systems with respect to perturbations
- Path-Following Method to Determine the Field of Values of a Matrix with High Accuracy
- Extended and improved criss-cross algorithms for computing the spectral value set abscissa and radius
- A structured pseudospectral method for \(\mathcal {H}_{\infty}\)-norm computation of large-scale descriptor systems
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)
