A suitable domain decomposition for the adaptive mesh refinement method

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We applied the dynamic Domain Decomposition Method (DDM) to the local Adaptive Mesh Refinement method (AMR) and parallelize d the calculations. As a result, it became possible to equalize local increases in load and thus to obtain a high performance. Specifically, when 8PE's were used for the flow problem in jurisdiction with the difference, a 6.2 times speed improvement ratio was obtained. Furthermore, a limitation was added to the calculation area's shape since the calculation area allocated to each PE generally becomes complex in shape when using dynamic division. The complexity of communication was suppressed by applying this limitation and the coding complexity problem was avoided.

Cite

CITATION STYLE

APA

Furuyama, S. I., & Matsuzawa, T. (1999). A suitable domain decomposition for the adaptive mesh refinement method. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1615, pp. 363–372). Springer Verlag. https://doi.org/10.1007/BFb0094938

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free