Proceedings of the 2016 International Conference on Computer Engineering and Information Systems

Research on Two-point Aggregated Algebraic Multigrid Preconditioning Methods

Authors
Jian-Ping Wu, Fu-Kang Yin, Jun Peng, Jin-Hui Yang
Corresponding Author
Jian-Ping Wu
Available Online November 2016.
DOI
https://doi.org/10.2991/ceis-16.2016.15How to use a DOI?
Keywords
sparse linear algebraic equations; aggregation based algebraic multigrid; smoothing process; preconditioner; Krylov subspace method
Abstract
Among the methods to solve sparse linear systems, the aggregation based algebraic multigrid is widely focused on, due to the potential of approximately optimal convergence and the cheap cost to setup. And it is often used as the preconditioner to Krylov subspace methods. But the actual efficiency is restricted to the extent of compliment of two processes, the smoothing and the correction. In the aggregation based algebraic multigrid methods, it is one of the critical steps to aggregate the finer-grid points to construct coarser grids. In this paper, several two-point aggregations are given first, and then for model problems, three characteristics are compared and analyzed, including the spectral radius of the related iterative matrix, the similarity between the spectra of the coefficient matrix on the coarser grid and that on the finer grid, the number of preconditioned conjugate gradient iterations with algebraic multigrid as the preconditioner. The results show that the spectral radius and the similarity of spectra have potentials to direct the design of highly efficient algebraic multigrid methods. Meanwhile, during the aggregation, it is better to match the fine points with heavy edge weights than with weak ones. When Jacobi iteration is used as smoothing, it is difficult to determine the best strategy to aggregate. But if Gauss-Seidel iteration is used as smoothing, the number of iterations is significantly reduced, and the optimal aggregation strategy is more certain, that is, the optimal is always among the three ones with matching priority for edges with heave weights, and the number of iterations with the other two is very close to that with the optimal.
Open Access
This is an open access article distributed under the CC BY-NC license.

Download article (PDF)

Proceedings
2016 International Conference on Computer Engineering and Information Systems
Part of series
Advances in Computer Science Research
Publication Date
November 2016
ISBN
978-94-6252-283-1
ISSN
2352-538X
DOI
https://doi.org/10.2991/ceis-16.2016.15How to use a DOI?
Open Access
This is an open access article distributed under the CC BY-NC license.

Cite this article

TY  - CONF
AU  - Jian-Ping Wu
AU  - Fu-Kang Yin
AU  - Jun Peng
AU  - Jin-Hui Yang
PY  - 2016/11
DA  - 2016/11
TI  - Research on Two-point Aggregated Algebraic Multigrid Preconditioning Methods
BT  - 2016 International Conference on Computer Engineering and Information Systems
PB  - Atlantis Press
SN  - 2352-538X
UR  - https://doi.org/10.2991/ceis-16.2016.15
DO  - https://doi.org/10.2991/ceis-16.2016.15
ID  - Wu2016/11
ER  -