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

DOI10.1515/AMCS-2015-0055zbMATH Open1347.65069OpenAlexW2401104724MaRDI QIDQ327002FDOQ327002

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)

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

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
• s-Step Iterative Methods for (Non)Symmetric (In)Definite Linear Systems
• scientific article; zbMATH DE number 1748480

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)

Cites Work

• Title not available (Why is that?)
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Implementation of the QMR Method Based on Coupled Two-Term Recurrences
• Title not available (Why is that?)
• Title not available (Why is that?)
• s-step iterative methods for symmetric linear systems
• Minimizing synchronizations in sparse iterative solvers for distributed supercomputers
• SLEPc
• Hiding global communication latency in the GMRES algorithm on massively parallel machines
• Parallel iterative S-step methods for unsymmetric linear systems
• An improved GBPi-CG algorithm suitable for distributed parallel computing
• A class of Lanczos-like algorithms implemented on parallel computers
• 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
• On Deriving the Quasi-Minimal Residual Method
• Title not available (Why is that?)
• Residual Replacement Strategies for Krylov Subspace Iterative Methods for the Convergence of True Residuals
• Title not available (Why is that?)
• Computational and Information Science

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
• Title not available (Why is that?)
• An efficient nonsymmetric Lanczos method on parallel vector computers

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)