On Compatible Transfer Operators in Nonsymmetric Algebraic Multigrid

07/12/2023
by   Ben S. Southworth, et al.
0

The standard goal for an effective algebraic multigrid (AMG) algorithm is to develop relaxation and coarse-grid correction schemes that attenuate complementary error modes. In the nonsymmetric setting, coarse-grid correction Π will almost certainly be nonorthogonal (and divergent) in any known inner product, meaning Π > 1. This introduces a new consideration, that one wants coarse-grid correction to be as close to orthogonal as possible, in an appropriate norm. In addition, due to non-orthogonality, Π may actually amplify certain error modes that are in the range of interpolation. Relaxation must then not only be complementary to interpolation, but also rapidly eliminate any error amplified by the non-orthogonal correction, or the algorithm may diverge. This note develops analytic formulae on how to construct “compatible” transfer operators in nonsymmetric AMG such that Π = 1 in any standard matrix-induced norm. Discussion is provided on different options for norm in the nonsymmetric setting, the relation between “ideal” transfer operators in different norms, and insight into the convergence of nonsymmetric reduction-based AMG.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/14/2022

Efficient multigrid reduction-in-time for method-of-lines discretizations of linear advection

Parallel-in-time methods for partial differential equations (PDEs) have ...
research
02/17/2021

A new convergence analysis of two-level hierarchical basis methods

This paper is concerned with the convergence analysis of two-level hiera...
research
07/15/2023

Reducing operator complexity in Algebraic Multigrid with Machine Learning Approaches

We propose a data-driven and machine-learning-based approach to compute ...
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
03/24/2022

Fast multigrid reduction-in-time for advection via modified semi-Lagrangian coarse-grid operators

Many iterative parallel-in-time algorithms have been shown to be highly ...
research
07/05/2021

Weighted Relaxation for Multigrid Reduction in Time

Based on current trends in computer architectures, faster compute speeds...

Please sign up or login with your details

Forgot password? Click here to reset