NANAJun 17, 2011

Aggregation based on graph matching and inexact coarse grid solve for algebraic multigrid

arXiv:1105.346824 citationsh-index: 11
Originality Synthesis-oriented
AI Analysis

For practitioners of algebraic multigrid, this work offers a more robust aggregation strategy, though it is an incremental improvement over existing methods.

The paper proposes a graph-based matching aggregation for algebraic multigrid and analyzes the effects of inexact coarse grid solves. The method shows improved robustness over classical AMG on discontinuous convection-diffusion problems and Florida matrix market problems.

A graph based matching is used to construct aggregation for algebraic multigrid. Effects of inexact coarse grid solve is analyzed numerically for a highly discontinuous convection diffusion coefficient matrix and problems from Florida matrix market collection. The proposed strategy is found to be more robust compared to a classical AMG approach.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes