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 [3] and we use an Algebraic Multilevel Iterations (AMLI) [1, 6] for the solution phase.

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.

Authors and Affiliations

1. Department of Mathematics, The Pennsylvania State University, University Park, PA, 16802, USA

   James Brannick, Yao Chen & Ludmil Zikatanov

2. Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences, Altenbergerstraße 69, A-4040, Linz, Austria

   Johannes Kraus

Corresponding author

Correspondence to James Brannick .

Editors and Affiliations

1. , Department of Mathematics, University of California, San Diego, Gilman Drive 9500, La Jolla, 92093-0112, California, USA

   Randolph Bank

2. , Department of Mathematics, University of California, San Diego, Gilman Drive 9500, La Jolla, 92093-0112, California, USA

   Michael Holst

3. , Courant Institute of Mathematical, New York University, Mercer Street 251, New York, 10012-1185, New York, USA

   Olof Widlund

4. , Department of Mathematics, Pennsylvania State University, State College, 16802, Pennsylvania, USA

   Jinchao Xu

Reprints and permissions

© 2013 Springer-Verlag Berlin Heidelberg

Policies and ethics