论文信息 - Evaluation of Parallel Aggregate Creation Orders: Smoothed Aggregation Algebraic Multigrid Method

Evaluation of Parallel Aggregate Creation Orders: Smoothed Aggregation Algebraic Multigrid Method

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.

Akira Nishida | Yoshio Oyanagi | Akihiro Pujii

[1] Hisashi Nakamura,et al. Parallel Iterative Solvers with Localized ILU Preconditioning , 1997, HPCN Europe.

[2] Ray S. Tuminaro,et al. Parallel Smoothed Aggregation Multigrid : Aggregation Strategies on Massively Parallel Machines , 2000, ACM/IEEE SC 2000 Conference (SC'00).

[3] Kengo Nakajima,et al. Parallel Iterative Solvers with Localized ILU Preconditioning for Unstructured Grids on Workstation Clusters , 1999 .

[4] Marian Brezina,et al. Convergence of algebraic multigrid based on smoothed aggregation , 1998, Numerische Mathematik.

[5] K. Nakajima. Parallel Iterative Linear Solvers with Preconditioning for Large Scale Problems , 2003 .

[6] M. Adams,et al. A Parallel Maximal Independent Set Algorithm , 1998 .

[7] Vipin Kumar,et al. Design and Implementation of a Scalable Parallel Direct Solver for Sparse Symmetric Positive Definite Systems: Preliminary Results , 1997, PPSC.