AMG preconditioners for Linear Solvers towards Extreme Scale

06/29/2020
by   Pasqua D'Ambra, et al.
0

Linear solvers for large and sparse systems are a key element of scientific applications, and their efficient implementation is necessary to harness the computational power of current computers. Algebraic Multigrid (AMG) Preconditioners are a popular ingredient of such linear solvers; this is the motivation for the present work where we examine some recent developments in a package of AMG preconditioners to improve efficiency, scalability, and robustness on extreme-scale problems. The main novelty is the design and implementation of a new parallel coarsening algorithm based on aggregation of unknowns employing weighted graph matching techniques; this is a completely automated procedure, requiring no information from the user, and applicable to general symmetric positive definite (s.p.d.) matrices. The new coarsening algorithm improves in terms of numerical scalability at low operator complexity over decoupled aggregation algorithms available in previous releases of the package. The preconditioners package is built on the parallel software framework PSBLAS, which has also been updated to progress towards exascale. We present weak scalability results on two of the most powerful supercomputers in Europe, for linear systems with sizes up to O(10^10) unknowns.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/29/2022

Alya towards Exascale: Algorithmic Scalability using PSCToolkit

In this paper, we describe some work aimed at upgrading the Alya code wi...
research
03/04/2023

Multi-GPU aggregation-based AMG preconditioner for iterative linear solvers

We present and release in open source format a sparse linear solver whic...
research
01/28/2020

Parallel solution of saddle point systems with nested iterative solvers based on the Golub-Kahan Bidiagonalization

We present a scalability study of Golub-Kahan bidiagonalization for the ...
research
03/12/2020

Learning Algebraic Multigrid Using Graph Neural Networks

Efficient numerical solvers for sparse linear systems are crucial in sci...
research
07/06/2023

Efficient parallel implementation of the multiplicative weight update method for graph-based linear programs

Positive linear programs (LPs) model many graph and operations research ...
research
01/27/2020

On the quality of matching-based aggregates for algebraic coarsening of SPD matrices in AMG

In this paper, we discuss a quality measure for an aggregation-based coa...
research
08/30/2022

Solving the One-Dimensional Time-Independent Schrödinger Equation with High Accuracy: The LagrangeMesh Mathematica Package

In order to find the spectrum associated with the one-dimensional Schröo...

Please sign up or login with your details

Forgot password? Click here to reset