Geodesic
A parallel multigrid method using the full domain partition
Electronic transactions on numerical analysis, Tome 6 (1997), pp. 224-233
The combination of adaptive refinement, multigrid and parallel computing for solving partial differential equations is considered. In the full domain partition approach, each processor contains a partition of the grid plus the minimum number of additional coarse elements required to cover the whole domain. A parallel multigrid algorithm using the full domain partition is presented. Multigrid rates of convergence have been observed while communicating between processors only twice per V-cycle. Numerical computations on a network of up to 32 workstations show that parallel efficiency rates of 50% to 90% can be obtained.
Classification : 65N30, 65N55, 65Y05, 65N50
Keywords: grid partitioning, multigrid, parallel algorithms 
@article{ETNA_1997__6__a4,
     author = {Mitchell,  William F.},
     title = {A parallel multigrid method using the full domain partition},
     journal = {Electronic transactions on numerical analysis},
     pages = {224--233},
     year = {1997},
     volume = {6},
     zbl = {0898.65080},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ETNA_1997__6__a4/}
}
TY  - JOUR
AU  - Mitchell,  William F.
TI  - A parallel multigrid method using the full domain partition
JO  - Electronic transactions on numerical analysis
PY  - 1997
SP  - 224
EP  - 233
VL  - 6
UR  - http://geodesic.mathdoc.fr/item/ETNA_1997__6__a4/
LA  - en
ID  - ETNA_1997__6__a4
ER  - 
%0 Journal Article
%A Mitchell,  William F.
%T A parallel multigrid method using the full domain partition
%J Electronic transactions on numerical analysis
%D 1997
%P 224-233
%V 6
%U http://geodesic.mathdoc.fr/item/ETNA_1997__6__a4/
%G en
%F ETNA_1997__6__a4
Mitchell,  William F. A parallel multigrid method using the full domain partition. Electronic transactions on numerical analysis, Tome 6 (1997), pp. 224-233. http://geodesic.mathdoc.fr/item/ETNA_1997__6__a4/