Automatic coarsening in Algebraic Multigrid utilizing quality measures for matching-based aggregations Pasqua D'Ambra, Fabio Durastante, Salvatore Filippone, Ludmil Zikatanov
In this paper, we discuss the convergence of an Algebraic MultiGrid
(AMG) method for general symmetric positive-definite matrices. The
method relies on an aggregation algorithm, named coarsening based on
compatible weighted matching, which exploits the interplay between the
principle of compatible relaxation and the maximum product matching
in undirected weighted graphs.