Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers

DOI10.1016/0168-9274(95)00079-AzbMath0842.65019OpenAlexW1507702133MaRDI QIDQ1904023

Henk A. van der Vorst, Eric De Sturler

Publication date: 24 July 1996

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-9274(95)00079-a

zbMATH Keywords

iterative methodsGMRESparallel computingconjugate gradient methodsdistributed memory computersreduction of the communication overhead

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Related Items

A parallel version of QMRCGSTAB method for large linear systems in distributed parallel environments, Minimizing synchronizations in sparse iterative solvers for distributed supercomputers, Improved QMRCGSTAB method in distributed parallel environments, Analysis and parallel implementation of a forced \(N\)-body problem, Analysis and practical use of flexible biCGStab, Incomplete block LU preconditioners on slightly overlapping subdomains for a massively parallel computer, Parallelizable approximate solvers for recursions arising in preconditioning, An improved bi-conjugate residual algorithm suitable for distributed parallel computing, Alternating Anderson-Richardson method: an efficient alternative to preconditioned Krylov methods for large, sparse linear systems, GMRES algorithms over 35 years, Resolved particle simulations using the Physalis method on many GPUs, Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method, Varying the \(s\) in your \(s\)-step GMRES, An improved GBPi-CG algorithm suitable for distributed parallel computing, A parallel version of GPBi-CG method suitable for distributed parallel computing, Conjugate residual squared method and its improvement for non-symmetric linear systems, A parallel nearly implicit time-stepping scheme, An improved generalized conjugate residual squared algorithm suitable for distributed parallel computing, The parallel computation of the smallest eigenpair of an acoustic problem with damping, An improved parallel hybrid bi-conjugate gradient method suitable for distributed parallel computing, A parallel generalized global conjugate gradient squared algorithm for linear systems with multiple right-hand sides, On the cost of iterative computations, An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating., An improved generalized conjugate residual squared (IGCRS2) algorithm suitable for distributed parallel computing, SOLVING SPARSE LEAST SQUARES PROBLEMS WITH PRECONDITIONED CGLS METHOD ON PARALLEL DISTRIBUTED MEMORY COMPUTERS

Uses Software

• BiCGstab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A performance model for Krylov subspace methods on mesh-based parallel computers
• s-step iterative methods for symmetric linear systems
• A class of Lanczos-like algorithms implemented on parallel computers
• BiCGstab(\(l\)) and other hybrid Bi-CG methods
• Incomplete block LU preconditioners on slightly overlapping subdomains for a massively parallel computer
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Generalized Schwarz Splittings
• A Newton basis GMRES implementation
• Methods of conjugate gradients for solving linear systems