The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR

DOI10.1515/amcs-2015-0055zbMath1347.65069OpenAlexW2401104724MaRDI QIDQ327002

Stefan Feuerriegel, H. Martin Bücker

Publication date: 13 October 2016

Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/amcs-2015-0055

zbMATH Keywords

\(s\)-step bicg\(s\)-step Lanczos\(s\)-step QMRefficient recurrencessynchronization-reducing

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18)

Uses Software

• SLEPc
• PETSc

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing synchronizations in sparse iterative solvers for distributed supercomputers
• Parallel iterative S-step methods for unsymmetric linear systems
• An improved GBPi-CG algorithm suitable for distributed parallel computing
• s-step iterative methods for symmetric linear systems
• A class of Lanczos-like algorithms implemented on parallel computers
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• An efficient nonsymmetric Lanczos method on parallel vector computers
• Avoiding Communication in Nonsymmetric Lanczos-Based Krylov Subspace Methods
• A Residual Replacement Strategy for Improving the Maximum Attainable Accuracy of $s$-Step Krylov Subspace Methods
• Krylov Subspace Methods on Supercomputers
• SLEPc
• On Deriving the Quasi-Minimal Residual Method
• An Implementation of the QMR Method Based on Coupled Two-Term Recurrences
• Residual Replacement Strategies for Krylov Subspace Iterative Methods for the Convergence of True Residuals
• Hiding Global Communication Latency in the GMRES Algorithm on Massively Parallel Machines
• Computational and Information Science