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

DOI10.1515/AMCS-2015-0055MaRDI QIDQ327002zbMATH OpenOpenAlexFDO

Authors 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)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

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

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

Recommendations

• An Efficient Implementation of the Nonsymmetric Lanczos Algorithm
• A Breakdown-Free Variation of the Nonsymmetric Lanczos Algorithms
• An efficient nonsymmetric Lanczos method on parallel vector computers
• A Convergence Analysis for Nonsymmetric Lanczos Algorithms
• scientific article; zbMATH DE number 2067026
• scientific article; zbMATH DE number 77983
• s-Step Iterative Methods for (Non)Symmetric (In)Definite Linear Systems
• scientific article; zbMATH DE number 1748480

Cites work

• scientific article; zbMATH DE number 434716 (Why is no real title available?)
• scientific article; zbMATH DE number 176399 (Why is no real title available?)
• scientific article; zbMATH DE number 3511513 (Why is no real title available?)
• scientific article; zbMATH DE number 1069512 (Why is no real title available?)
• scientific article; zbMATH DE number 1069613 (Why is no real title available?)
• scientific article; zbMATH DE number 1113872 (Why is no real title available?)
• scientific article; zbMATH DE number 1424566 (Why is no real title available?)
• A class of Lanczos-like algorithms implemented on parallel computers
• A residual replacement strategy for improving the maximum attainable accuracy of \(s\)-step Krylov subspace methods
• An Implementation of the QMR Method Based on Coupled Two-Term Recurrences
• An efficient nonsymmetric Lanczos method on parallel vector computers
• An improved GBPi-CG algorithm suitable for distributed parallel computing
• Avoiding communication in nonsymmetric Lanczos-based Krylov subspace methods
• Computational and Information Science
• Hiding global communication latency in the GMRES algorithm on massively parallel machines
• Krylov Subspace Methods on Supercomputers
• Minimizing synchronizations in sparse iterative solvers for distributed supercomputers
• On Deriving the Quasi-Minimal Residual Method
• Parallel iterative S-step methods for unsymmetric linear systems
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• Residual Replacement Strategies for Krylov Subspace Iterative Methods for the Convergence of True Residuals
• SLEPc
• s-step iterative methods for symmetric linear systems

Cited in

(4)

• An Efficient Implementation of the Nonsymmetric Lanczos Algorithm
• Finding solution of linear systems via new forms of BiCG, BiCGstab and CGS algorithms
• An efficient nonsymmetric Lanczos method on parallel vector computers
• scientific article; zbMATH DE number 1424566 (Why is no real title available?)

Describes a project that uses

Uses Software

• SLEPc
• PETSc

This page was built for publication: The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q327002)