Towards backward perturbation bounds for approximate dual Krylov subspaces
From MaRDI portal
Publication:1944009
DOI10.1007/s10543-012-0402-4zbMath1278.65034OpenAlexW1987535943MaRDI QIDQ1944009
Gang Wu, Lu Zhang, Yi-Min Wei, Zhi-Gang Jia, Si-Tao Ling
Publication date: 3 April 2013
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10543-012-0402-4
numerical experimentKrylov subspace methodbackward perturbationperturbation matrixArnolid decompositiondual Krylov decompositiondual Krylov subspacestwo-sided Lanczos decomposition
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Model reduction using the Vorobyev moment problem
- Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- On the QMR approach for iterative methods including coupled three-term recurrences for solving nonsymmetric linear systems
- Krylov subspace techniques for reduced-order modeling of large-scale dynamical systems
- Matrix Algorithms
- A Krylov--Schur Algorithm for Large Eigenproblems
- Numerical Methods for Large Eigenvalue Problems
- On Efficient Numerical Approximation of the Bilinear Form $c^*A^{-1}b$
- Interpolatory Model Reduction of Large-Scale Dynamical Systems
- Recent computational developments in Krylov subspace methods for linear systems
- Residual Bounds on Approximate Eigensystems of Nonnormal Matrices
- Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric Matrix
- Error Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue Problem
- Templates for the Solution of Algebraic Eigenvalue Problems
- The Lanczos and Conjugate Gradient Algorithms
- Backword error bounds for approximate Krylov subspaces
