Hiding Global Communication Latency in the GMRES Algorithm on Massively Parallel Machines

DOI10.1137/12086563XzbMath1273.65050MaRDI QIDQ4917164

Karl Meerbergen, Pieter Ghysels, T. Ashby, Wim Vanroose

Publication date: 29 April 2013

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

algorithm numerical examples GMRES parallel computing numerical stability Krylov subspace method parallel efficiency Gram-Schmidt global communication latency hiding

Mathematics Subject Classification ID

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

Related Items (28)

Anatomically accurate high resolution modeling of human whole heart electromechanics: A strongly scalable algebraic multigrid solver method for nonlinear deformation ⋮ Deflation-accelerated preconditioning of the Poisson-Neumann Schur problem on long domains with a high-order discontinuous element-based collocation method ⋮ A Communication Optimization Scheme for Basis Computation of Krylov Subspace Methods on Multi-GPUs ⋮ Minimizing synchronizations in sparse iterative solvers for distributed supercomputers ⋮ The non-symmetric $s$-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR ⋮ The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology ⋮ Robust and efficient adjoint solver for complex flow conditions ⋮ Analysis and practical use of flexible biCGStab ⋮ The Adaptive $s$-Step Conjugate Gradient Method ⋮ Chaotic multigrid methods for the solution of elliptic equations ⋮ Alternating Anderson-Richardson method: an efficient alternative to preconditioned Krylov methods for large, sparse linear systems ⋮ Coarsest-level improvements in multigrid for lattice QCD on large-scale computers ⋮ Novel Multilevel Preconditioners for the Systems Arising from Plane Wave Discretization of Helmholtz Equations with Large Wave Numbers ⋮ Inner product free iterative solution and elimination methods for linear systems of a three-by-three block matrix form ⋮ GMRES algorithms over 35 years ⋮ Communication-hiding pipelined BiCGSafe methods for solving large linear systems ⋮ Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method ⋮ Scalable Asynchronous Domain Decomposition Solvers ⋮ DASHMM Accelerated Adaptive Fast Multipole Poisson-Boltzmann Solver on Distributed Memory Architecture ⋮ Distributed fast boundary element methods for Helmholtz problems ⋮ s-Step Enlarged Krylov Subspace Conjugate Gradient Methods ⋮ Enlarged Krylov Subspace Conjugate Gradient Methods for Reducing Communication ⋮ Pipelined, Flexible Krylov Subspace Methods ⋮ ViennaCL---Linear Algebra Library for Multi- and Many-Core Architectures ⋮ On the cost of iterative computations ⋮ An adaptive $s$-step conjugate gradient algorithm with dynamic basis updating. ⋮ Communication Avoiding ILU0 Preconditioner ⋮ Pipelined Iterative Solvers with Kernel Fusion for Graphics Processing Units

Uses Software

This page was built for publication: Hiding Global Communication Latency in the GMRES Algorithm on Massively Parallel Machines