DMCA
Modifying CLJP to Select Grid Hierarchies with Lower Operator Complexities and Better Performance ∗
| Citations: | 2 - 2 self |
BibTeX
@MISC{Alber_modifyingcljp,
author = {David M. Alber},
title = {Modifying CLJP to Select Grid Hierarchies with Lower Operator Complexities and Better Performance ∗},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Algebraic multigrid (AMG) is an efficient algorithm for solving certain types of large, sparse linear systems. For solving very large problems with AMG it becomes necessary to use parallel algorithms. Coarse grid selection algorithms such as CLJP were created to parallelize the setup phase of AMG. For some problems, such as those discretized on structured meshes, CLJP tends to select coarse grids with more nodes than alternative coarsening algorithms. In this paper, the cause for the selection of too many coarse nodes by CLJP is examined, and a new technique which lowers the operator complexities generated by CLJP is introduced. To validate the new method, the modified CLJP is compared to other coarsening algorithms for large-scale problems. 1
Keyphrases
better performance lower operator complexity select grid hierarchy new technique parallel algorithm certain type new method efficient algorithm large-scale problem setup phase coarse grid algebraic multigrid sparse linear system coarse grid selection algorithm modified cljp many coarse node operator complexity large problem structured mesh
