Updating the QR decomposition of block tridiagonal and block Hessenberg matrices
DOI10.1016/j.apnum.2007.04.010zbMath1143.65032OpenAlexW2079903960MaRDI QIDQ928841
Martin H. Gutknecht, Thomas Schmelzer
Publication date: 11 June 2008
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apnum.2007.04.010
eigenvalueseigenvectorsQR factorizationblock tridiagonal matrixblock Arnoldi processblock GMResblock Hessenberg matrixblock Krylov space methodblock Lanczos processblock MinResblock QMRblock SymmIQ
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Related Items (7)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
- The block conjugate gradient algorithm and related methods
- The WY Representation for Products of Householder Matrices
- Block Reflectors: Theory and Computation
- Implementation Aspects of Band Lanczos Algorithms for Computation of Eigenvalues of Large Sparse Symmetric Matrices
- A Stabilized QMR Version of Block BiCG
- The computation of elementary unitary matrices
- A Lanczos-type method for multiple starting vectors
- ABLE: An Adaptive Block Lanczos Method for Non-Hermitian Eigenvalue Problems
- A Block QMR Method for Computing Multiple Simultaneous Solutions to Complex Symmetric Systems
- Analysis of Algorithms for Reflections in Bisectors
This page was built for publication: Updating the QR decomposition of block tridiagonal and block Hessenberg matrices