New Algorithms for Computing the Real Structured Pseudospectral Abscissa and the Real Stability Radius of Large and Sparse Matrices
From MaRDI portal
Publication:3449792
DOI10.1137/140975413zbMath1325.65067OpenAlexW2209535128MaRDI QIDQ3449792
Publication date: 30 October 2015
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/69ab1a81507e8143a5d8f0376d783427b3247674
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Matrix equations and identities (15A24) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (9)
Robust stability optimization for linear delay systems in a probabilistic framework ⋮ On the real stability radius of sparse systems ⋮ Subspace method for the estimation of large-scale structured real stability radius ⋮ On real structured controllability/stabilizability/stability radius: complexity and unified rank-relaxation based methods ⋮ Approximating the Real Structured Stability Radius with Frobenius-Norm Bounded Perturbations ⋮ Criss-Cross Type Algorithms for Computing the Real Pseudospectral Abscissa ⋮ Robust Linear Stability Analysis and a New Method for Computing the Action of the Matrix Exponential ⋮ On the Method by Rostami for Computing the Real Stability Radius of Large and Sparse Matrices ⋮ A survey on variational characterizations for nonlinear eigenvalue problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new approach for calculating the real stability radius
- Adaptive rational Krylov subspaces for large-scale dynamical systems
- Preconditioning strategies for models of incompressible flow
- A Newton-based method for the calculation of the distance to instability
- Boundary conditions in approximate commutator preconditioners for the Navier-Stokes equations
- Eigenvalue decay bounds for solutions of Lyapunov equations: the symmetric case
- On the decay rate of Hankel singular values and related issues
- A formula for computation of the real stability radius
- Matrix Algorithms
- Efficient iterative algorithms for linear stability analysis of incompressible flows
- Lyapunov Inverse Iteration for Identifying Hopf Bifurcations in Models of Incompressible Flow
- Approximating real stability radii
- Krylov Subspace Methods for Linear Systems with Tensor Product Structure
- Inverse Iteration for Purely Imaginary Eigenvalues with Application to the Detection of Hopf Bifurcations in Large-Scale Problems
- Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
- A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations
- Algorithm 866
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Krylov Subspace Methods for Solving Large Lyapunov Equations
- Eigenvalues of Block Matrices Arising from Problems in Fluid Mechanics
- Robust stability and a criss-cross algorithm for pseudospectra
- Matrix transformations for computing rightmost eigenvalues of large sparse non-symmetric eigenvalue problems
- Numerical Methods for Bifurcations of Dynamical Equilibria
- Low-Rank Dynamics for Computing Extremal Points of Real Pseudospectra
- Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
- Lyapunov Inverse Iteration for Computing a Few Rightmost Eigenvalues of Large Generalized Eigenvalue Problems
- Existence of a low rank or ℋ︁‐matrix approximant to the solution of a Sylvester equation
This page was built for publication: New Algorithms for Computing the Real Structured Pseudospectral Abscissa and the Real Stability Radius of Large and Sparse Matrices
