Parallel algorithms for adaptive mesh refinement
- Univ. of Tennessee, Knoxville, TN (United States). Computer Science Dept.
- Argonne National Lab., IL (United States). Mathematics and Computer Science Div.
Computational methods based on the use of adaptively constructed nonuniform meshes reduce the amount of computation and storage necessary to perform many scientific calculations. The adaptive construction of such nonuniform meshes is an important part of these methods. In this paper, the authors present a parallel algorithm for adaptive mesh refinement that is suitable for implementation on distributed-memory parallel computers. Experimental results obtained on the Intel DELTA are presented to demonstrate that for scientific computations involving the finite element method, the algorithm exhibits scalable performance and has a small run time in comparison with other aspects of the scientific computations examined. It is also shown that the algorithm has a fast expected running time under the parallel random access machine (PRAM) computation model.
- Research Organization:
- Argonne National Laboratory (ANL), Argonne, IL
- Sponsoring Organization:
- USDOE, Washington, DC (United States); National Science Foundation, Washington, DC (United States)
- DOE Contract Number:
- W-31109-ENG-38
- OSTI ID:
- 509276
- Journal Information:
- SIAM Journal on Scientific Computing, Journal Name: SIAM Journal on Scientific Computing Journal Issue: 3 Vol. 18; ISSN 1064-8275; ISSN SJOCE3
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel algorithms for the adaptive refinement and partitioning of unstructured meshes
A parallel algorithm for mesh smoothing