A parallel version of the quasi-minimal residual method based on coupled two-term recurrences

DOI10.1007/3-540-62095-8_17MaRDI QIDQ4375647zbMATH OpenFDO

Authors H. Martin Bücker, Manfred Sauren

Publication date 13 May 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-62095-8_17

zbMATH Keywords

efficiencyKrylov subspace methodLanczos algorithmnumerical experimentsorthogonalizationparallel algorithmsquasi-minimal residual methodscaling

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05)

Recommendations

• Quantitative performance analysis of the improved quasi-minimal residual method on massively distributed memory computers.
• Parallel performance analysis of the improved quasi-minimal residual method on bulk synchronous parallel architectures
• scientific article; zbMATH DE number 592769
• scientific article; zbMATH DE number 176399

Cited in

(19)

• Quantitative performance analysis of the improved quasi-minimal residual method on massively distributed memory computers.
• Numerical implementation of the QMR algorithm by using discrete stochastic arithmetic
• Software for simplified Lanczos and QMR algorithms
• A parallel version of GPBi-CG method suitable for distributed parallel computing
• An improved generalized conjugate residual squared (IGCRS2) algorithm suitable for distributed parallel computing
• A parallel version of QMRCGSTAB method for large linear systems in distributed parallel environments
• An improved generalized conjugate residual squared algorithm suitable for distributed parallel computing
• A modified QMR algorithm based on the A-Lanczos biorthogonal process
• The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR
• An Implementation of the QMR Method Based on Coupled Two-Term Recurrences
• scientific article; zbMATH DE number 592769 (Why is no real title available?)
• QMR Smoothing for Lanczos-Type Product Methods Based on Three-Term Rrecurrences
• scientific article; zbMATH DE number 953007 (Why is no real title available?)
• Parallel block ILUT/ILDLT preconditioning for sparse eigenproblems and sparse linear systems
• scientific article; zbMATH DE number 1424568 (Why is no real title available?)
• Conjugate residual squared method and its improvement for non-symmetric linear systems
• FQMR: A flexible quasi-minimal residual method with inexact preconditioning
• A parallel generalized global conjugate gradient squared algorithm for linear systems with multiple right-hand sides
• An improved bi-conjugate residual algorithm suitable for distributed parallel computing

This page was built for publication: A parallel version of the quasi-minimal residual method based on coupled two-term recurrences

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