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/140975413zbMATH Open1325.65067OpenAlexW2209535128MaRDI QIDQ3449792FDOQ3449792
Authors: Minghao W. Rostami 
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
Recommendations
- On the method by Rostami for computing the real stability radius of large and sparse matrices
- Approximating real stability radii
- Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
- scientific article; zbMATH DE number 934504
- Criss-cross type algorithms for computing the real pseudospectral abscissa
Computational methods for sparse matrices (65F50) Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Matrix equations and identities (15A24)
Cites Work
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
- Title not available (Why is that?)
- Matrix algorithms. Vol. 2: Eigensystems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Eigenvalue decay bounds for solutions of Lyapunov equations: the symmetric case
- A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations
- Algorithm 866
- Adaptive rational Krylov subspaces for large-scale dynamical systems
- Krylov Subspace Methods for Solving Large Lyapunov Equations
- Existence of a low rank or ℋ︁‐matrix approximant to the solution of a Sylvester equation
- Title not available (Why is that?)
- Numerical methods for large eigenvalue problems
- Krylov subspace methods for linear systems with tensor product structure
- Boundary conditions in approximate commutator preconditioners for the Navier-Stokes equations
- Lyapunov inverse iteration for identifying Hopf bifurcations in models of incompressible flow
- Numerical Methods for Bifurcations of Dynamical Equilibria
- On the decay rate of Hankel singular values and related issues
- Matrix transformations for computing rightmost eigenvalues of large sparse non-symmetric eigenvalue problems
- A formula for computation of the real stability radius
- A new approach for calculating the real stability radius
- Title not available (Why is that?)
- A Newton-based method for the calculation of the distance to instability
- Inverse iteration for purely imaginary eigenvalues with application to the detection of Hopf bifurcations in large-scale problems
- Eigenvalues of Block Matrices Arising from Problems in Fluid Mechanics
- Approximating real stability radii
- Low-rank dynamics for computing extremal points of real pseudospectra
- Robust stability and a criss-cross algorithm for pseudospectra
- Preconditioning strategies for models of incompressible flow
- Lyapunov Inverse Iteration for Computing a Few Rightmost Eigenvalues of Large Generalized Eigenvalue Problems
- Efficient iterative algorithms for linear stability analysis of incompressible flows
Cited In (13)
- A survey on variational characterizations for nonlinear eigenvalue problems
- Robust stability optimization for linear delay systems in a probabilistic framework
- Criss-Cross Type Algorithms for Computing the Real Pseudospectral Abscissa
- Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
- A formula for computation of the real stability radius
- On the real stability radius of sparse systems
- On the method by Rostami for computing the real stability radius of large and sparse matrices
- On real structured controllability/stabilizability/stability radius: complexity and unified rank-relaxation based methods
- Subspace methods for computing the pseudospectral abscissa and the stability radius
- Large-scale minimization of the pseudospectral abscissa
- Subspace method for the estimation of large-scale structured real stability radius
- 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
Uses Software
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449792)
