Compatible coarsening in the multigraph algorithm

Authors:
Randolph E. Bank
Affiliations:
Department of Mathematics, University of California, San Diego La Jolla, CA 92093-0112, United States
Venue:
Advances in Engineering Software
Year:
2007

Citing 13
Cited 1

On the robustness of Ilu smoothing

SIAM Journal on Scientific and Statistical Computing
An analysis of the composite step biconjugate gradient method

Numerische Mathematik
Energy optimization of algebraic multigrid bases

Computing
The Incomplete Factorization Multigraph Algorithm

SIAM Journal on Scientific Computing
An energy-minimizing interpolation for robust multigrid methods

SIAM Journal on Scientific Computing
Robustness and Scalability of Algebraic Multigrid

SIAM Journal on Scientific Computing
A review of algebraic multigrid

Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 Vol. VII: partial differential equations
Computer Solution of Large Sparse Positive Definite

Computer Solution of Large Sparse Positive Definite
Algebraic Multigrid Based on Element Interpolation (AMGe)

SIAM Journal on Scientific Computing
An Algebraic Multilevel Multigraph Algorithm

SIAM Journal on Scientific Computing
BoomerAMG: a parallel algebraic multigrid solver and preconditioner

Applied Numerical Mathematics - Developments and trends in iterative methods for large systems of equations—in memoriam Rüdiger Weiss
Coarse-Grid Selection for Parallel Algebraic Multigrid

IRREGULAR '98 Proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel
On Generalizing the Algebraic Multigrid Framework

SIAM Journal on Numerical Analysis

Compatible Relaxation and Coarsening in Algebraic Multigrid

SIAM Journal on Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present some heuristics incorporating the philosophy of compatible relaxation into an existing algebraic multigrid method, the so-called multigraph solver of Bank and Smith [Bank Randolph E., Kent Smith R. An algebraic multilevel multigraph algorithm. SIAM J Sci Comput 2002;25:1572-92]. In particular, approximate left and right eigenvectors of the iteration matrix for the smoother are used in computing both the sparsity pattern and the numerical values of the transfer matrices that correspond to restriction and prolongation. Some numerical examples illustrate the effectiveness of the procedure.