Polynomial Preconditioned GMRES to Reduce Communication in Parallel Computing

06/28/2019
by   Jennifer A. Loe, et al.
0

Polynomial preconditioning with the GMRES minimal residual polynomial has the potential to greatly reduce orthogonalization costs, making it useful for communication reduction. We implement polynomial preconditioning in the Belos package from Trilinos and show how it can be effective in both serial and parallel implementations. We further show it is a communication-avoiding technique and is a viable option to CA-GMRES for large-scale parallel computing.

READ FULL TEXT

page 7

page 8

research
03/12/2021

EventGraD: Event-Triggered Communication in Parallel Machine Learning

Communication in parallel systems imposes significant overhead which oft...
research
03/15/2023

A numerically stable communication-avoiding s-step GMRES algorithm

Krylov subspace methods are extensively used in scientific computing to ...
research
08/02/2022

Parallel Matrix-free polynomial preconditioners with application to flow simulations in discrete fracture networks

We develop a robust matrix-free, communication avoiding parallel, high-d...
research
12/17/2017

Avoiding Synchronization in First-Order Methods for Sparse Convex Optimization

Parallel computing has played an important role in speeding up convex op...
research
11/16/2019

New Polynomial Preconditioned GMRES

A new polynomial preconditioner is given for solving large systems of li...
research
01/07/2018

Arrows for Parallel Computation

Arrows are a general interface for computation and an alternative to Mon...
research
11/08/2018

Poster: Parallel Implementation of the OMNeT++ INET Framework for V2X Communications

The field of parallel network simulation frameworks is evolving at a gre...

Please sign up or login with your details

Forgot password? Click here to reset