返回
Parallel algorithms for adaptive mesh refinement
DOI:10.1137/S106482759528065X.png)
摘要
En 中文
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, we 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.
Keyword:
adaptive mesh refinement
distributed memory computers
parallel algorithms
sparse matrices
unstructured mesh computation
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
暂无机构信息

