Abstract
The Algebraic MultiGrid method (AMG) has been studied intensively as an ideal solver for large scale Poisson problems. The Smoothed Aggregation Algebraic MultiGrid (SA-AMG) method is one of the most efficient of these methods. The aggregation procedure is the most important part of the method and is the main area of interest of several researchers.
Here we investigate aggregate creation orders in the aggregation procedure. Five types of aggregation procedure are tested for isotropic, anisotropic and simple elastic problems. As a result, it is important that aggregates are created around one aggregate in each domain for isotropic problems. For anisotropic problems, aggregates around domain borders influence the convergence much. The best strategy for both anisotropic and isotropic problems in our numerical test is the aggregate creation method which creates aggregates on borders first then creates aggregates around one aggregate in the internal domain.
In our test, the SA-AMG preconditioned Conjugate Gradient (CG) method is compared to the Localized ILU preconditioned CG method. In the experiments, Poisson problems up to 1.6 × 107 DOF are solved on 125PEs.
Chapter PDF
Similar content being viewed by others
References
M. F. Adams. A parallel maximal independent set algorithm. In Proceedings 5th Copper mountain conference on iterative methods, 1998.
GeoFEM, http://www.geofem.tokyo.rist.or.jp/.
[GGJ+97]_Anshul Gupta, Fred Gustavson, Mahesh Joshi, George Karypis, and Vipin Kumar. Design and implementation of a scalable parallel direct solver for sparse symmetric positive definite systems. In Proceedings of the Eighth SIAM Conference on Parallel Processing, 3 1997.
MPI(Message Passing Interface) Forum Web Site, http://www.mpiforum.org/.
Myrinet Software, http://www.myri.com/scs/.
K. Nakajima. Parallel Iterative Linear Solvers with Preconditioning for Large Scale Problems. Ph.D. dissertation, University of Tokyo, 2003.
K. Nakajima, H. Nakamura, and T. Tanahashi. Parallel iterative solvers with localize ILU preconditioning. In Lecture Notes in Computer Science 1225, pages 342–350, 1997.
K. Nakajima and H. Okuda. Parallel iterative solvers with Localized ILU preconditioning for unstructured grids on workstation clusters. IJCFD, 12:315–322, 1999.
Ray S. Tuminaro and Charles Tong. Parallel smoothed aggregation multigrid: Aggregation strategies on massively parallel machines. In SuperComputing, 2000.
Petr Vanek, Marian Brezina, and Jan Mandel. Convergence of algebraic multigrid based on smoothed aggregation. Numerische Mathematic, 88(3):559–579, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this paper
Cite this paper
Pujii, A., Nishida, A., Oyanagi, Y. (2005). Evaluation of Parallel Aggregate Creation Orders: Smoothed Aggregation Algebraic Multigrid Method. In: Ng, M.K., Doncescu, A., Yang, L.T., Leng, T. (eds) High Performance Computational Science and Engineering. IFIP — The International Federation for Information Processing, vol 172. Springer, Boston, MA. https://doi.org/10.1007/0-387-24049-7_6
Download citation
DOI: https://doi.org/10.1007/0-387-24049-7_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-24048-0
Online ISBN: 978-0-387-24049-7
eBook Packages: Computer ScienceComputer Science (R0)