A parallel halfsweep multigrid algorithm on the shared memory multiprocessors
The halfsweep multigrid algorithm, introduced by Othman et al in 1998 for solving a linear system, is known as a fast multigrid poisson solver. In this paper, the implementation of the parallel halfsweep multigrid algorithm with several parallel strategies is discussed. The experiments were carried...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Faculty of Computer Science and Information Technology, University of Malaya
2000
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/49466/ http://psasir.upm.edu.my/id/eprint/49466/1/A%20parallel%20halfsweep%20multigrid%20algorithm%20on%20the%20shared%20memory%20multiprocessors.pdf |
| Summary: | The halfsweep multigrid algorithm, introduced by Othman et al in 1998 for solving a linear system, is known as a fast multigrid poisson solver. In this paper, the implementation of the parallel halfsweep multigrid algorithm with several parallel strategies is discussed. The experiments were carried out on the shared memory multiprocessors computer system, Sequent S27, and the results of the test problem are included. |
|---|