DMCA
The Full Domain Partition Approach To Parallel Adaptive Refinement (1998)
Cached
Download Links
- [math.nist.gov]
- [math.nist.gov]
- [math.nist.gov]
- DBLP
Other Repositories/Bibliography
| Venue: | in Grid Generation and Adaptive Algorithms, IMA Volumes in Mathematics and it Applications 113 Springer-Verlag |
| Citations: | 6 - 3 self |
BibTeX
@INPROCEEDINGS{Mitchell98thefull,
author = {William F. Mitchell},
title = {The Full Domain Partition Approach To Parallel Adaptive Refinement},
booktitle = {in Grid Generation and Adaptive Algorithms, IMA Volumes in Mathematics and it Applications 113 Springer-Verlag},
year = {1998},
pages = {151--162},
publisher = {Springer-Verlag}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
. 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 adaptive refinement algorithm using the full domain partition is presented. The method is a small modification of a sequential adaptive refinement algorithm, and uses no interprocessor communication during the refinement process. The only communication is one global reduction before refinement and three all-to-all communication steps for synchronization after the refinement is completed. Numerical computations on a network of up to 4 workstations show that parallel efficiency rates of 85% to near 100% can be obtained. Key words. adaptive refinement, finite elements, parallel algorithms, partial differential equations. AMS(MOS) subject classifications. 35J25, 65N30, 65N5...
Keyphrases
full domain partition approach parallel adaptive refinement partial differential equation adaptive refinement refinement process full domain partition parallel algorithm all-to-all communication step subject classification additional coarse element interprocessor communication sequential adaptive refinement algorithm parallel efficiency rate numerical computation finite element global reduction minimum number parallel adaptive refinement algorithm whole domain key word small modification
