New algorithms for computing the real structured pseudospectral abscissa and the real stability radius of large and sparse matrices
From MaRDI portal
Publication:3449792
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
Cites work
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 934504 (Why is no real title available?)
- scientific article; zbMATH DE number 2212009 (Why is no real title available?)
- scientific article; zbMATH DE number 2221749 (Why is no real title available?)
- scientific article; zbMATH DE number 4187010 (Why is no real title available?)
- A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations
- A Newton-based method for the calculation of the distance to instability
- A formula for computation of the real stability radius
- A new approach for calculating the real stability radius
- Adaptive rational Krylov subspaces for large-scale dynamical systems
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
- Algorithm 866
- Approximating real stability radii
- Boundary conditions in approximate commutator preconditioners for the Navier-Stokes equations
- Efficient iterative algorithms for linear stability analysis of incompressible flows
- Eigenvalue decay bounds for solutions of Lyapunov equations: the symmetric case
- Eigenvalues of Block Matrices Arising from Problems in Fluid Mechanics
- Existence of a low rank or ℋ︁‐matrix approximant to the solution of a Sylvester equation
- Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Inverse iteration for purely imaginary eigenvalues with application to the detection of Hopf bifurcations in large-scale problems
- Krylov Subspace Methods for Solving Large Lyapunov Equations
- Krylov subspace methods for linear systems with tensor product structure
- Low-rank dynamics for computing extremal points of real pseudospectra
- Lyapunov inverse iteration for computing a few rightmost eigenvalues of large generalized eigenvalue problems
- Lyapunov inverse iteration for identifying Hopf bifurcations in models of incompressible flow
- Matrix algorithms. Vol. 2: Eigensystems
- Matrix transformations for computing rightmost eigenvalues of large sparse non-symmetric eigenvalue problems
- Numerical Methods for Bifurcations of Dynamical Equilibria
- Numerical methods for large eigenvalue problems
- On the decay rate of Hankel singular values and related issues
- Preconditioning strategies for models of incompressible flow
- Robust stability and a criss-cross algorithm for pseudospectra
Cited in
(13)- Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
- On the method by Rostami for computing the real stability radius of large and sparse matrices
- Robust linear stability analysis and a new method for computing the action of the matrix exponential
- A formula for computation of the real stability radius
- Criss-cross type algorithms for computing the real pseudospectral abscissa
- On the real stability radius of sparse systems
- Robust stability optimization for linear delay systems in a probabilistic framework
- Approximating the real structured stability radius with Frobenius-norm bounded perturbations
- Subspace method for the estimation of large-scale structured real stability radius
- A survey on variational characterizations for nonlinear eigenvalue problems
- Large-scale minimization of the pseudospectral abscissa
- Subspace methods for computing the pseudospectral abscissa and the stability radius
- On real structured controllability/stabilizability/stability radius: complexity and unified rank-relaxation based methods
Describes a project that uses
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)
