.png){kind=icon}
Return
Parallel algorithms for adaptive mesh refinement
.png){kind=icon}
OA
AI
DOI：10.1137/S106482759528065X.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
adaptive mesh refinement
distributed memory computers
parallel algorithms
sparse matrices
unstructured mesh computation
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W
Organization
No organization information available
Cited Papers
ShareSaveDesign and characterization of a power transfer inductive link for wireless sensor network nodes.png)
2015 IEEE International Instrumentation and Measurement Technology Conference (I2MTC) Proceedings
2015 IEEE International Instrumentation and Measurement Technology Conference (I2MTC) ProceedingsIF0
PREAI
ShareSave
View more