Scalable Parallel Algebraic Multigrid Solvers

Technical Report · Wed Mar 23 00:00:00 EST 2005

DOI:https://doi.org/10.2172/15015127· OSTI ID:15015127

Bank, R; Lu, S; Tong, C; Vassilevski, P

The authors propose a parallel algebraic multilevel algorithm (AMG), which has the novel feature that the subproblem residing in each processor is defined over the entire partition domain, although the vast majority of unknowns for each subproblem are associated with the partition owned by the corresponding processor. This feature ensures that a global coarse description of the problem is contained within each of the subproblems. The advantages of this approach are that interprocessor communication is minimized in the solution process while an optimal order of convergence rate is preserved; and the speed of local subproblem solvers can be maximized using the best existing sequential algebraic solvers.

• Research Organization: Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
• Sponsoring Organization: US Department of Energy (US)
• DOE Contract Number: W-7405-ENG-48
• OSTI ID: 15015127
• Report Number(s): UCRL-TR-210788; TRN: US200509%%56
• Resource Relation: Other Information: PBD: 23 Mar 2005
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
ALGORITHMS
COMMUNICATIONS
CONVERGENCE
VELOCITY