Exploring Oversampling in RBF Least-Squares Collocation Method of Lines for Surface Diffusion
Meng Chen, Leevan Ling
TL;DR
This work addresses stable spatial discretization for surface diffusion PDEs using RBF-LSC-MoL by analyzing oversampling effects on the induced ODEs. The authors implement an oversampling strategy with ratio $n_X/n_Z$ and perform numerical experiments on isotropic and anisotropic surface diffusion on manifolds, using fully discretized schemes and a QR-based ODE reduction. They find that high kernel smoothness $m$ and larger center counts $n_Z$ can cause eigenvalue instability without oversampling, while modest oversampling ($1.5$–$2$) restores stability and efficiency. The results lead to practical guidelines for configuring RBF-LSC-MoL: ensure sufficient spatial approximation power with $n_Z$, and oversample by about $1.5$–$2$ to balance accuracy and computational cost, with a caveat about spurious zero eigenvalues due to rank deficiency. The work advances mesh-free methods for parabolic PDEs on surfaces by providing concrete, implementable recommendations.
Abstract
This paper investigates the numerical behavior of the radial basis functions least-squares collocation (RBF-LSC) method of lines (MoL) for solving surface diffusion problems, building upon the theoretical analysis presented in [SIAM J. Numer. Anal., 61 (3), 1386-1404}]. Specifically, we examine the impact of the oversampling ratio, defined as the number of collocation points used over the number of RBF centers for quasi-uniform sets, on the stability of the eigenvalues, time stepping sizes taken by Runge-Kutta methods, and overall accuracy of the method. By providing numerical evidence and insights, we demonstrate the importance of the oversampling ratio for achieving accurate and efficient solutions with the RBF-LSC-MoL method. Our results reveal that the oversampling ratio plays a critical role in determining the stability of the eigenvalues, and we provide guidelines for selecting an optimal oversampling ratio that balances accuracy and computational efficiency.
