An RBF-FD closest point method for solving PDEs on surfaces
Argyrios Petras, Leevan Ling, Steven J. Ruuth

TL;DR
This paper introduces an RBF-FD based explicit closest point method for solving PDEs on surfaces, reducing computational costs and improving stability over previous methods, with demonstrated convergence and applicability to various examples.
Contribution
The paper develops a novel RBF-FD based explicit closest point method that improves efficiency and stability for PDEs on surfaces, avoiding point clustering issues.
Findings
Reduces computational domain size compared to standard methods.
Enables higher-order schemes by increasing RBF-FD stencil points.
Demonstrates numerical convergence across multiple surface PDE examples.
Abstract
Partial differential equations (PDEs) on surfaces appear in many applications throughout the natural and applied sciences. The classical closest point method (Ruuth and Merriman, J. Comput. Phys. 227(3):1943-1961, [2008]) is an embedding method for solving PDEs on surfaces using standard finite difference schemes. In this paper, we formulate an explicit closest point method using finite difference schemes derived from radial basis functions (RBF- FD). Unlike the orthogonal gradients method (Piret, J. Comput. Phys. 231(14):4662-4675, [2012]), our proposed method uses RBF centers on regular grid nodes. This formulation not only reduces the computational cost but also avoids the ill-conditioning from point clustering on the surface and is more natural to couple with a grid based manifold evolution algorithm (Leung and Zhao, J. Comput. Phys. 228(8):2993-3024, [2009]). When compared to the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
