返回
A fast algebraic multigrid preconditioned conjugate gradient solver
DOI:10.1016/j.amc.2005.11.115.png)
摘要
En 中文
This work presents a new approach for selecting the coarse grids allowing a faster algebraic multigrid (AMG) preconditioned conjugate gradient solver. This approach is based on an appropriate choice of the parameter alpha considering the matrix density during the coarsening process which implies in a significant reduction in the matrix dimension at all AMG levels. (c) 2005 Elsevier Inc. All rights reserved.
Keyword:
algebraic multigrid
coarsening process
strength threshold
preconditioner
iterative methods
linear systems
sparse matrices

