An Algebraic Multigrid Preconditioner Based on Aggregation from Top to Bottom
In aggregation based algebraic multigrids, the current schemes are to construct the grid hierarchy from bottom to top, where several nodes on the finer level are clustered into a node on the coarser level step by step. Therefore this kind of scheme is mainly based on local information. In this paper, we present a new aggregation scheme, where the grid hierarchy is formed from top to bottom in a natural way. The adjacent graph of the original coefficient matrix is partitioned first, and then each part is recursively partitioned until some limitations are met for a certain level. Then the grid hierarchy is formed based on the global information, which is completely different from the classical ones. When partitioning graphs, any kind of method can be used, including those based on coordinate information and those based on the element of the matrix only, such as the methods provided in the software package METIS. Finally, the new scheme is validated from the solution of some discrete two-dimensional systems with preconditioned conjugate gradient iterations.
KeywordsSparse linear system Aggregation based algebraic multigrid Preconditioner Preconditioned conjugate gradient iteration Graph partitioning
This work is funded by NSFC(61379022).
- 4.D’Ambra, P., Buttari, A., di Serafino, D., Filippone, S., Gentile, S., Ucar, B.: A novel aggregation method based on graph matching for algebraic multigrid preconditioning of sparse linear systems. In: International Conference on Preconditioning Techniques for Scientific & Industrial Applications, May 2011, Bordeaux, France (2011)Google Scholar
- 12.Wu, J.P., Yin, F.K., Peng, J., Yang, J.H.: Research on two-point aggregated algebraic multigrid preconditioning methods. In: International Conference on Computer Engineering and Information System [CEIS 2016], Shanghai, China (2016)Google Scholar
- 14.Wagner, C.: Introduction to algebraic multigrid, Course Notes, University of Heidelberg (1998/1999). http://www.iwr.uni-heidelberg.de/~Christian.Wagner/
- 15.Karypis, G., Kumar, G.: MeTiS – a software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices – Version 4.0, Technical report, University of Minnesota, September 1998Google Scholar