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

Abstract

A graph matching is used to construct aggregation-based coarsening for an algebraic two-grid method. Effects of inexact coarse grid solve is analysed numerically for a highly discontinuous convection–diffusion coefficient matrix, and for problems from the Florida matrix market collection. The proposed strategy is found to be more robust compared to a classical algebraic multi-grid approach based on strength of connections. Basic properties of two-grid method are outlined.

Keywords:

• algebraic multi-grid
• iterative method
• preconditioners
• eigenvalues
• eigenvectors
• two grid

2010 AMS Subject Classifications:

• 15A06
• 65F08
• 65F10

Acknowledgements

Many thanks to Université libre de Bruxelles and KU Leuven for an ideal environment and the fond de la reserche scientifique (FNRS) Ref: 2011/V 6/5/004-IB/CS-15 that made this work possible. This work was funded by Fonds de la recherche scientifique (FNRS)(Ref: 2011/V 6/5/004-IB/CS-15) at Université Libre de Brussels, and the postdoctoral funding of KU Leuven, Belgium.