The Non–Symmetric s–Step Lanczos Algorithm: Derivation of Efficient Recurrences and Synchronization–Reducing Variants of BiCG and QMR
The Lanczos algorithm is among the most frequently used iterative techniques for computing a few dominant eigenvalues of a large sparse non-symmetric matrix. At the same time, it serves as a building block within biconjugate gradient (BiCG) and quasi-minimal residual (QMR) methods for solving large...
| Huvudupphovsmän: | , |
|---|---|
| Materialtyp: | Artikel |
| Språk: | English |
| Publicerad: |
Sciendo
2015-12-01
|
| Serie: | International Journal of Applied Mathematics and Computer Science |
| Ämnen: | |
| Länkar: | https://doi.org/10.1515/amcs-2015-0055 |