Coarse-grid selection for parallel algebraic multigrid
Conference
·
OSTI ID:293405
The need to solve linear systems arising from problems posed on extremely large, unstructured grids has sparked great interest in parallelizing algebraic multigrid (AMG) To date, however, no parallel AMG algorithms exist We introduce a parallel algorithm for the selection of coarse-grid points, a crucial component of AMG, based on modifications of certain paallel independent set algorithms and the application of heuristics designed to insure the quality of the coarse grids A prototype serial version of the algorithm is implemented, and tests are conducted to determine its effect on multigrid convergence, and AMG complexity
- Research Organization:
- Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 293405
- Report Number(s):
- UCRL-JC-130893; CONF-980813-; ON: DE98058631; BR: YN010000
- Resource Relation:
- Conference: 5. international symposium on solving irregularly structured problems in parallel, Berkeley, CA (United States), 9-11 Aug 1998; Other Information: PBD: 1 Jun 1998
- Country of Publication:
- United States
- Language:
- English
Similar Records
Distance-Two Interpolation for Parallel Algebraic Multigrid
Reducing Parallel Communication in Algebraic Multigrid through Sparsification
Non-Galerkin Coarse Grids for Algebraic Multigrid
Journal Article
·
Tue May 08 00:00:00 EDT 2007
· Numerical Linear Algebra with Applications, vol. 15, no. 2-3, December 3, 2007, pp. 115-139
·
OSTI ID:293405
+1 more
Reducing Parallel Communication in Algebraic Multigrid through Sparsification
Journal Article
·
Fri Jan 01 00:00:00 EST 2016
· SIAM Journal on Scientific Computing
·
OSTI ID:293405
+2 more
Non-Galerkin Coarse Grids for Algebraic Multigrid
Journal Article
·
Thu Jun 26 00:00:00 EDT 2014
· SIAM Journal on Scientific Computing
·
OSTI ID:293405