An efficient algebraic multigrid preconditioned conjugate gradient solver
β Scribed by Chihiro Iwamura; Franco S. Costa; Igor Sbarski; Alan Easton; Nian Li
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 441 KB
- Volume
- 192
- Category
- Article
- ISSN
- 0045-7825
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper, we present a robust and efficient algebraic multigrid preconditioned conjugate gradient solver for systems of linear equations arising from the finite element discretization of a scalar elliptic partial differential equation of second order on unstructured meshes. The algebraic multigrid (AMG) method is one of most promising methods for solving large systems of linear equations arising from unstructured meshes. The conventional AMG method usually requires an expensive setup time, particularly for three dimensional problems so that generally it is not used for small and medium size systems or low-accuracy approximations. Our solver has a quick setup phase for the AMG method and a fast iteration cycle. These allow us to apply this solver for not only large systems but also small to medium systems of linear equations and also for systems requiring low-accuracy approximations.
π SIMILAR VOLUMES
An algebraic multigrid (AMG) scheme is presented for the efficient solution of large systems of coupled algebraic equations involving second-order discrete differentials. It is based on elementary (zero-order) intergrid transfer operators but exhibits convergence rates that are independent of the sy
Parallel preconditioners are considered for improving the convergence rate of the conjugate gradient method for solving sparse symmetric positive definite systems generated by finite element models of subsurface flow. The difficulties of adapting effective sequential preconditioners to the parallel