Advertisement

An Algebraic Multigrid Preconditioner Based on Aggregation from Top to Bottom

Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 849)

Abstract

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.

Keywords

Sparse linear system Aggregation based algebraic multigrid Preconditioner Preconditioned conjugate gradient iteration Graph partitioning 

Notes

Acknowledgment

This work is funded by NSFC(61379022).

References

  1. 1.
    Notay, Y.: Aggregation-based algebraic multilevel preconditioning. SIAM J. Matrix Anal. Appl. 27(4), 998–1018 (2006)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Kim, H., Xu, J., Zikatanov, L.: A multigrid method based on graph matching for convection-diffusion equations. Numer. Linear Algebra Appl. 10, 181–195 (2003)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Notay, Y.: Aggregation-based algebraic multigrid for convection-diffusion equations. SIAM J. Sci. Comput. 34(4), A2288–A2316 (2012)MathSciNetCrossRefGoogle Scholar
  4. 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
  5. 5.
    Dendy Jr., J.E., Moulton, J.D.: Black Box Multigrid with coarsening by a factor of three. Numer. Linear Algebra Appl. 17(2–3), 577–598 (2010)MathSciNetMATHGoogle Scholar
  6. 6.
    Vanek, P., Mandel, J., Brezina, M.: Algebraic multigrid by smoothed aggregation for second order and fourth order elliptic problems. Computing 56, 179–196 (1996)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Kumar, P.: Aggregation based on graph matching and inexact coarse grid solve for algebraic two grid. Int. J. Comput. Math. 91(5), 1061–1081 (2014)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Wu, J.P., Song, J.Q., Zhang, W.M., Ma, H.F.: Coarse grid correction to domain decomposition based preconditioners for meso-scale simulation of concrete. Appl. Mech. Mater. 204–208, 4683–4687 (2012)CrossRefGoogle Scholar
  9. 9.
    Chen, M.H., Greenbaum, A.: Analysis of an aggregation-based algebraic two-grid method for a rotated anisotropic diffusion problem. Numer. Linear Algebra Appl. 22(4), 681–701 (2015)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Braess, D.: Towards algebraic multigrid for elliptic problems of second order. Computing 55, 379–393 (1995)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Deng, L.J., Huang, T.Z., Zhao, X.L., Zhao, L., Wang, S.: An economical aggregation algorithm for algebraic multigrid. (AMG). J. Comput. Anal. Appl. 16(1), 181–198 (2014)MathSciNetMATHGoogle Scholar
  12. 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
  13. 13.
    Saad, Y.: Iterative methods for Sparse Linear Systems. PWS Pub. Co., Boston (1996)MATHGoogle Scholar
  14. 14.
    Wagner, C.: Introduction to algebraic multigrid, Course Notes, University of Heidelberg (1998/1999). http://www.iwr.uni-heidelberg.de/~Christian.Wagner/
  15. 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

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  1. 1.Academy of Ocean Science and EngineeringNational University of Defense TechnologyChangshaChina

Personalised recommendations