Semicoarsening Multigrid on Distributed Memory Machines
Authors:
- Peter N. BrownPBPeter N. Brown
- Robert D. FalgoutRFRobert D. Falgout
- Jim E. JonesJJJim E. Jones
- 1 January 2000
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 21 (5) , 1823-1834
Abstract
This paper presents the results of a scalability study for a three-dimensional semicoarsening multigrid solver on a distributed memory computer. In particular, we are interested in the scalability of the solver---how the solution time varies as both problem size and number of processors are increased. For an iterative linear solver, scalability involves both algorithmic issues and implementation issues. We examine the scalability of the solver theoretically by constructing a simple parallel model and experimentally by results obtained on an IBM SP. The results are compared with those obtained for other solvers on the same computer.Keywords
This publication has 8 references indexed in Scilit:
- Iterative Linear Solvers in a 2D Radiation–Hydrodynamics Code: Methods and PerformanceJournal of Computational Physics, 1999
- Some Multigrid Algorithms for Elliptic Problems on Data Parallel MachinesSIAM Journal on Scientific Computing, 1998
- A Semicoarsening Multigrid Method for Elliptic Partial Differential Equations with Highly Discontinuous and Anisotropic CoefficientsSIAM Journal on Scientific Computing, 1998
- A Parallel Multigrid Preconditioned Conjugate Gradient Algorithm for Groundwater Flow SimulationsNuclear Science and Engineering, 1996
- The Improved Robustness of Multigrid Elliptic Solvers Based on Multiple Semicoarsened GridsSIAM Journal on Numerical Analysis, 1993
- A Semicoarsening Multigrid Algorithm for SIMD MachinesSIAM Journal on Scientific and Statistical Computing, 1992
- Semicoarsening Multigrid on a HypercubeSIAM Journal on Scientific and Statistical Computing, 1992
- Black box multigridJournal of Computational Physics, 1982