An Algebraic Multigrid Method Based on Matching in Graphs
We present an Algebraic Multigrid (AMG) method for graph Laplacian problems. The coarse graphs are constructed recursively by pair-wise aggregation, or matching as in  and we use an Algebraic Multilevel Iterations (AMLI) [1, 6] for the solution phase.
KeywordsStructure Grid Unstructured Grid Graph Match Coarse Space Unweighted Graph
Unable to display preview. Download preview PDF.
The authors gratefully acknowledge the support by the Austrian Academy of Sciences and by the Austrian Science Fund (FWF), Project No. P19170-N18 and the support from the National Science Foundation under grants NSF-DMS 0810982 and NSF-OCI 0749202.