- Journal Home
- Volume 36 - 2024
- Volume 35 - 2024
- Volume 34 - 2023
- Volume 33 - 2023
- Volume 32 - 2022
- Volume 31 - 2022
- Volume 30 - 2021
- Volume 29 - 2021
- Volume 28 - 2020
- Volume 27 - 2020
- Volume 26 - 2019
- Volume 25 - 2019
- Volume 24 - 2018
- Volume 23 - 2018
- Volume 22 - 2017
- Volume 21 - 2017
- Volume 20 - 2016
- Volume 19 - 2016
- Volume 18 - 2015
- Volume 17 - 2015
- Volume 16 - 2014
- Volume 15 - 2014
- Volume 14 - 2013
- Volume 13 - 2013
- Volume 12 - 2012
- Volume 11 - 2012
- Volume 10 - 2011
- Volume 9 - 2011
- Volume 8 - 2010
- Volume 7 - 2010
- Volume 6 - 2009
- Volume 5 - 2009
- Volume 4 - 2008
- Volume 3 - 2008
- Volume 2 - 2007
- Volume 1 - 2006
Commun. Comput. Phys., 29 (2021), pp. 1446-1468.
Published online: 2021-03
Cited by
- BibTex
- RIS
- TXT
In this paper, we study a highly scalable communication-free parallel domain boundary decomposition algorithm for the Laplace equation based on a hybrid method combining boundary integral equations and walk-on-spheres (BIE-WOS) method, which provides a numerical approximation of the Dirichlet-to-Neumann (DtN) mapping for the Laplace equation. The BIE-WOS is a local method on the boundary of the domain and does not require a structured mesh, and only needs a covering of the domain boundary by patches and a local mesh for each patch for a local BIE. A new version of the BIE-WOS method with second kind integral equations is introduced for better error controls. The effect of errors from the Feynman-Kac formula based path integral WOS method on the overall accuracy of the BIE-WOS method is analyzed for the BIEs, especially in the calculation of the right hand sides of the BIEs. For the special case of flat patches, it is shown that the second kind integral equation of BIE-WOS method can be simplified where the local BIE solutions can be given in closed forms. A key advantage of the parallel BIE-WOS method is the absence of communications during the computation of the DtN mapping on individual patches of the boundary, resulting in a complete independent computation using a large number of cluster nodes. In addition, the BIE-WOS has an intrinsic capability of fault tolerance for exascale computations. The nearly linear scalability of the parallel BIE-WOS method on a large-scale cluster with 6400 CPU cores is verified for computing the DtN mapping of exterior Laplace problems with Dirichlet data for several domains.
}, issn = {1991-7120}, doi = {https://doi.org/10.4208/cicp.OA-2020-0099}, url = {http://global-sci.org/intro/article_detail/cicp/18721.html} }In this paper, we study a highly scalable communication-free parallel domain boundary decomposition algorithm for the Laplace equation based on a hybrid method combining boundary integral equations and walk-on-spheres (BIE-WOS) method, which provides a numerical approximation of the Dirichlet-to-Neumann (DtN) mapping for the Laplace equation. The BIE-WOS is a local method on the boundary of the domain and does not require a structured mesh, and only needs a covering of the domain boundary by patches and a local mesh for each patch for a local BIE. A new version of the BIE-WOS method with second kind integral equations is introduced for better error controls. The effect of errors from the Feynman-Kac formula based path integral WOS method on the overall accuracy of the BIE-WOS method is analyzed for the BIEs, especially in the calculation of the right hand sides of the BIEs. For the special case of flat patches, it is shown that the second kind integral equation of BIE-WOS method can be simplified where the local BIE solutions can be given in closed forms. A key advantage of the parallel BIE-WOS method is the absence of communications during the computation of the DtN mapping on individual patches of the boundary, resulting in a complete independent computation using a large number of cluster nodes. In addition, the BIE-WOS has an intrinsic capability of fault tolerance for exascale computations. The nearly linear scalability of the parallel BIE-WOS method on a large-scale cluster with 6400 CPU cores is verified for computing the DtN mapping of exterior Laplace problems with Dirichlet data for several domains.