A numerically stable communication-avoiding s-step GMRES algorithm

03/15/2023
by   Zan Xu, et al.
0

Krylov subspace methods are extensively used in scientific computing to solve large-scale linear systems. However, the performance of these iterative Krylov solvers on modern supercomputers is limited by expensive communication costs. The s-step strategy generates a series of s Krylov vectors at a time to avoid communication. Asymptotically, the s-step approach can reduce communication latency by a factor of s. Unfortunately, due to finite-precision implementation, the step size has to be kept small for stability. In this work, we tackle the numerical instabilities encountered in the s-step GMRES algorithm. By choosing an appropriate polynomial basis and block orthogonalization schemes, we construct a communication avoiding s-step GMRES algorithm that automatically selects the optimal step size to ensure numerical stability. To further maximize communication savings, we introduce scaled Newton polynomials that can increase the step size s to a few hundreds for many problems. An initial step size estimator is also developed to efficiently choose the optimal step size for stability. The guaranteed stability of the proposed algorithm is demonstrated using numerical experiments. In the process, we also evaluate how the choice of polynomial and preconditioning affects the stability limit of the algorithm. Finally, we show parallel scalability on more than 14,000 cores in a distributed-memory setting. Perfectly linear scaling has been observed in both strong and weak scaling studies with negligible communication costs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/24/2023

Stability of step size control based on a posteriori error estimates

A posteriori error estimates based on residuals can be used for reliable...
research
07/13/2022

NySALT: Nyström-type inference-based schemes adaptive to large time-stepping

Large time-stepping is important for efficient long-time simulations of ...
research
12/21/2014

Implicit Temporal Differences

In reinforcement learning, the TD(λ) algorithm is a fundamental policy e...
research
06/28/2019

Polynomial Preconditioned GMRES to Reduce Communication in Parallel Computing

Polynomial preconditioning with the GMRES minimal residual polynomial ha...
research
03/07/2020

Stability and error estimates for the variable step-size BDF2 method for linear and semilinear parabolic equations

In this paper stability and error estimates for time discretizations of ...
research
11/21/2021

A Data-Driven Line Search Rule for Support Recovery in High-dimensional Data Analysis

In this work, we consider the algorithm to the (nonlinear) regression pr...
research
11/20/2022

An integral-like numerical approach for solving Burgers' equation

An integral-like approach established on spline polynomial interpolation...

Please sign up or login with your details

Forgot password? Click here to reset