Robust Linear Stability Analysis and a New Method for Computing the Action of the Matrix Exponential
From MaRDI portal
Publication:4691177
DOI10.1137/17M1132537zbMath1401.65019OpenAlexW2897131593WikidataQ115525613 ScholiaQ115525613MaRDI QIDQ4691177
No author found.
Publication date: 19 October 2018
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/17m1132537
linear stability analysisrational approximationLeja pointsmatrix exponentialArnoldi's methodrightmost eigenvaluepseudospectral analysis
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical interpolation (65D05)
Related Items
Augmented Lagrangian preconditioner for large-scale hydrodynamic stability analysis ⋮ Inexact rational Krylov Subspace methods for approximating the action of functions of 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
- Adaptive rational Krylov subspaces for large-scale dynamical systems
- A reflection on the implicitly restarted Arnoldi method for computing eigenvalues near a vertical line
- Computing \(exp(-\tau A) b\) with Laguerre polynomials
- Newton interpolation at Leja points
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
- Fast Leja points
- RD-rational approximations of the matrix exponential
- Interpolating discrete advection--diffusion propagators at Leja sequences
- Comparison of software for computing the action of the matrix exponential
- Accurate evaluation of divided differences for polynomial interpolation of exponential propagators
- Matrix Algorithms
- Efficient iterative algorithms for linear stability analysis of incompressible flows
- The Leja Method Revisited: Backward Error Analysis for the Matrix Exponential
- Rational Krylov approximation of matrix functions: Numerical methods and optimal pole selection
- Finite Elements and Fast Iterative Solvers
- Algorithm 919
- Numerical Methods for Large Eigenvalue Problems
- Inverse Iteration for Purely Imaginary Eigenvalues with Application to the Detection of Hopf Bifurcations in Large-Scale Problems
- Computing the Action of the Matrix Exponential, with an Application to Exponential Integrators
- Analysis of the Rational Krylov Subspace and ADI Methods for Solving the Lyapunov Equation
- Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
- New Algorithms for Computing the Real Structured Pseudospectral Abscissa and the Real Stability Radius of Large and Sparse Matrices
- A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations
- The Spectral Transformation Lanczos Method for the Numerical Solution of Large Sparse Generalized Symmetric Eigenvalue Problems
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator
- Expokit
- On Krylov Subspace Approximations to the Matrix Exponential Operator
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- 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
- Efficient approximation of the exponential operator for discrete 2D advection–diffusion problems
- Lyapunov Inverse Iteration for Computing a Few Rightmost Eigenvalues of Large Generalized Eigenvalue Problems
