Parareal-radial basis function-finite difference (RBF-FD) framework for solving time-dependent partial differential equations
| dc.contributor.author | Dissanayake, N.L. | |
| dc.contributor.author | Blazejewski, J.J. | |
| dc.contributor.author | Ong, B.W. | |
| dc.contributor.author | Piret, C.M. | |
| dc.date.accessioned | 2025-11-14T08:40:58Z | |
| dc.date.available | 2025-11-14T08:40:58Z | |
| dc.date.issued | 2021-10-29 | |
| dc.description.abstract | This study combines the Parareal time solver algorithm with the Radial Basis Function-Finite Difference (RBF-FD) space discretisation to create a computationally efficient approach for solving large-scale partial differential equations (PDEs). The Parareal algorithm utilises a combination of coarse and fine standard ODE solvers to simultaneously approximate solutions at different time intervals. The RBF-FD is a mesh-free method used to discretise PDEs in space. The Polyharmonic Spline RBF is commonly used in RBF-FD computations; however, any other RBF could be used as well. The RBF methodology is similar to the method of lines approach, where the space discretisation would transform a time dependent PDE into a system of ordinary differential equations (ODEs). Therefore, to solve a time-dependent PDE, one could discretise the PDE in space using the RBF-FD method and use the Parareal algorithm to solve the system of ODEs. However, there are several issues when it comes to pairing the RBF-FD differentiation matrices with ODE solvers. Firstly, the RBF-FD differentiation matrices could have spurious eigenvalues that may fall outside the stability region of the ODE solver. To stabilise the algorithm, one needs to use unacceptably small-time steps, which increase computational costs. Secondly, the higher degree polynomials used in RBF-FD discretisation to achieve higher-order convergence increased the computational cost, especially in large-scale problems. The novelty of our work is that we address these issues by pairing a coarse and fine RBF-FD space discretisation with a respective coarse and fine time solver in the Parareal algorithm. We show that the coarse RBF-FD stencil preserves the higher-order convergence of the fine RBF-FD stencil through error analysis. Furthermore, we show the finite step convergence of the Parareal algorithm for various test cases, including the shallow water equations. | |
| dc.identifier.citation | Proceedings of the Postgraduate Institute of Science Research Congress (RESCON) -2021, University of Peradeniya, P 69 | |
| dc.identifier.isbn | 978-955-8787-09-0 | |
| dc.identifier.uri | https://ir.lib.pdn.ac.lk/handle/20.500.14444/6665 | |
| dc.language.iso | en_US | |
| dc.publisher | Postgraduate Institute of Science, University of Peradeniya, Sri Lanka | |
| dc.subject | Higher-order convergence | |
| dc.subject | Parallel Time Solvers | |
| dc.subject | Parareal | |
| dc.subject | RBF-FD | |
| dc.subject | Spurious Eigenvalues | |
| dc.title | Parareal-radial basis function-finite difference (RBF-FD) framework for solving time-dependent partial differential equations | |
| dc.title.alternative | ICT, mathematics, and statistics | |
| dc.type | Article |