- 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., 36 (2024), pp. 485-520.
Published online: 2024-09
Cited by
- BibTex
- RIS
- TXT
Based on Ying’s kernel-free boundary integral (KFBI) method [1], a second-order method for general elliptic partial differential equations (PDEs), this paper develops a GPU-accelerated KFBI method for the heat, wave and Schrödinger equations on the irregular domain. Since the limitation of time steps imposed by CFL conditions in the explicit scheme and the inadequate accuracy generated by the fully implicit scheme for the Laplacian operator, the paper selects a series of second-order time discrete schemes, and the Laplacian operator is split into explicit and implicit mixed ones. The Crank-Nicolson method is used to discretize the heat equation in temporal dimension while the implicit $θ$-scheme is for the wave equation. The Strang splitting method is applied to the Schrödinger equation. After discretizing the temporal dimension implicitly, the heat, wave and Schrödinger equations are transformed into a sequence of elliptic equations. The Laplacian operator on the right-hand side of the elliptic equation is obtained from the numerical scheme instead of being discretized and corrected by the five-point difference method. A Cartesian grid-based KFBI method is used to solve the resulting elliptic equations. The KFBI method is accelerated by the graphics processing unit (GPU) with a parallel Cartesian grid solver, achieving a high degree of parallelism. Numerical results show that the proposed method has a second-order accuracy for the heat, wave, and Schrödinger equations. Additionally, the GPU-accelerated solvers for the three types of time-dependent equations are 30 times faster than CPU-based solvers.
}, issn = {1991-7120}, doi = {https://doi.org/10.4208/cicp.OA-2023-0025}, url = {http://global-sci.org/intro/article_detail/cicp/23390.html} }Based on Ying’s kernel-free boundary integral (KFBI) method [1], a second-order method for general elliptic partial differential equations (PDEs), this paper develops a GPU-accelerated KFBI method for the heat, wave and Schrödinger equations on the irregular domain. Since the limitation of time steps imposed by CFL conditions in the explicit scheme and the inadequate accuracy generated by the fully implicit scheme for the Laplacian operator, the paper selects a series of second-order time discrete schemes, and the Laplacian operator is split into explicit and implicit mixed ones. The Crank-Nicolson method is used to discretize the heat equation in temporal dimension while the implicit $θ$-scheme is for the wave equation. The Strang splitting method is applied to the Schrödinger equation. After discretizing the temporal dimension implicitly, the heat, wave and Schrödinger equations are transformed into a sequence of elliptic equations. The Laplacian operator on the right-hand side of the elliptic equation is obtained from the numerical scheme instead of being discretized and corrected by the five-point difference method. A Cartesian grid-based KFBI method is used to solve the resulting elliptic equations. The KFBI method is accelerated by the graphics processing unit (GPU) with a parallel Cartesian grid solver, achieving a high degree of parallelism. Numerical results show that the proposed method has a second-order accuracy for the heat, wave, and Schrödinger equations. Additionally, the GPU-accelerated solvers for the three types of time-dependent equations are 30 times faster than CPU-based solvers.