Towards backward perturbation bounds for approximate dual Krylov subspaces
From MaRDI portal
Publication:1944009
Recommendations
Cites work
- scientific article; zbMATH DE number 3511513 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Krylov--Schur algorithm for large eigenproblems
- Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
- Backword error bounds for approximate Krylov subspaces
- Error Analysis of the Lanczos Algorithm for Tridiagonalizing a Symmetric Matrix
- Error Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue Problem
- Interpolatory model reduction of large-scale dynamical systems
- Krylov subspace techniques for reduced-order modeling of large-scale dynamical systems
- Matrix algorithms. Vol. 2: Eigensystems
- Model reduction using the Vorobyev moment problem
- Numerical methods for large eigenvalue problems
- On efficient numerical approximation of the bilinear form \(c^*A^{-1}b\)
- On the QMR approach for iterative methods including coupled three-term recurrences for solving nonsymmetric linear systems
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Recent computational developments in Krylov subspace methods for linear systems
- Residual Bounds on Approximate Eigensystems of Nonnormal Matrices
- Templates for the Solution of Algebraic Eigenvalue Problems
- The Lanczos and Conjugate Gradient Algorithms
Cited in
(2)
This page was built for publication: Towards backward perturbation bounds for approximate dual Krylov subspaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944009)