Aggregation based on graph matching and inexact coarse grid solve for algebraic multigrid
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.