Distance-two interpolation for parallel algebraic multigrid
In this paper we study the use of long distance interpolation methods with the low complexity coarsening algorithm PMIS. AMG performance and scalability is compared for classical as well as long distance interpolation methods on parallel computers. It is shown that the increased interpolation accuracy largely restores the scalability of AMG convergence factors for PMIS-coarsened grids, and in combination with complexity reducing methods, such as interpolation truncation, one obtains a class of parallel AMG methods that enjoy excellent scalability properties on large parallel computers.
- Research Organization:
- Lawrence Livermore National Laboratory (LLNL), Livermore, CA
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 910210
- Report Number(s):
- UCRL-PROC-231994
- Country of Publication:
- United States
- Language:
- English
BoomerAMG: A parallel algebraic multigrid solver and preconditioner
|
journal | April 2002 |
Reducing Complexity in Parallel Algebraic Multigrid Preconditioners
|
journal | January 2006 |
Similar Records
Distance-Two Interpolation for Parallel Algebraic Multigrid
Reducing Complexity in Parallel Algebraic Multigrid Preconditioners
Parallel Algebraic Multigrid Methods - High Performance Preconditioners
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:940875
Reducing Complexity in Parallel Algebraic Multigrid Preconditioners
Journal Article
·
Tue Sep 21 00:00:00 EDT 2004
· SIAM (Society for Industrial and Applied Mathematics) Journal on Matrix Analysis and Applications
·
OSTI ID:883821
Parallel Algebraic Multigrid Methods - High Performance Preconditioners
Book
·
Wed Nov 10 23:00:00 EST 2004
·
OSTI ID:883808