Skip to Main content Skip to Navigation
Journal articles

Scalable Linear Solvers Based on Enlarged Krylov Subspaces with Dynamic Reduction of Search Directions

Laura Grigori 1 Olivier Tissot 1
1 ALPINES - Algorithms and parallel tools for integrated numerical simulations
INSMI - Institut National des Sciences Mathématiques et de leurs Interactions, Inria de Paris, LJLL (UMR_7598) - Laboratoire Jacques-Louis Lions
Abstract : Krylov methods are widely used for solving large sparse linear systems of equations. On distributed architectures, their performance is limited by the communication needed at each iteration of the algorithm. In this paper, we study the use of so-called enlarged Krylov subspaces for reducing the number of iterations, and therefore the overall communication, of Krylov methods. In particular, we consider a reformulation of the conjugate gradient method using these enlarged Krylov subspaces: the enlarged conjugate gradient method. We present the parallel design of two variants of the enlarged conjugate gradient method, as well as their corresponding dynamic versions, where the number of search directions is dynamically reduced during the iterations. For a linear elasticity problem with heterogeneous coefficients, using a block Jacobi preconditioner, we show that this implementation scales up to 16,384 cores and is up to 6.9 times faster than the PETSc implementation of PCG.
Complete list of metadata
Contributor : Laura Grigori Connect in order to contact the contributor
Submitted on : Monday, December 30, 2019 - 2:24:49 PM
Last modification on : Friday, January 21, 2022 - 3:17:43 AM

Links full text



Laura Grigori, Olivier Tissot. Scalable Linear Solvers Based on Enlarged Krylov Subspaces with Dynamic Reduction of Search Directions. SIAM Journal on Scientific Computing, Society for Industrial and Applied Mathematics, 2019, 41 (5), pp.C522-C547. ⟨10.1137/18M1196285⟩. ⟨hal-02425400⟩



Les métriques sont temporairement indisponibles