Comparison of radial basis function global method and radial basis function-finite difference (local) method as an interpolation technique

Loading...
Thumbnail Image

Journal Title

Journal ISSN

Volume Title

Publisher

Postgraduate Institute of Science (PGIS), University of Peradeniya, Sri Lanka

Abstract

The Radial Basis Function (RBF) method is a numerical method that can be used to solve interpolation problems and partial differential equations (PDEs). There are two main types of RBFs: infinitely smooth RBFs and piecewise-smooth RBFs. Gaussian, Multiquadric, Inverse Multiquadric, and Inverse Quadric functions are examples of infinitely smooth RBFs commonly used with the global RBF approach. An important factor of the infinitely smooth RBFs is that they contain a shape parameter. When using the global RBF method, one has to choose a suitable value for the shape parameter as it dramatically impacts convergence. In addition, using the global RBF method is computationally expensive as it produces dense matrices. Therefore, the possibility of using the local RBF approach, known as the RBF-FD approach, is studied, along with shape parameter independent Polyharmonic Spline RBFs, to overcome the aforementioned obstacles. In order to create RBF-FD interpolation stencils, Polyharmoic Spline stencils augmented with polynomials were used. This is a common approach used to solve PDEs, which we adapt to solve interpolation problems. In this work, we interpolated 𝑓(𝑥, 𝑦) = 𝑥𝑒 ⁻ˣ²⁻ʸ² with various known nodes and fixed 6400 unknown 2D nodes on [-1, 1] by using Gaussian, Multiquadric and Polyharmonic Spline RBFs. Also, we calculated the error of the approximation for different known numbers of 2D nodes. The accuracy of the solution oscillated with the shape parameter. However, when we used the RBF-FD method, we observed a clear pattern of error decay when increasing the number of nodes. The order of convergence was in the realm of at least 𝑂(ℎ ᵖ ) to a maximum of 𝑂(ℎ ᵖ⁺² ) where ℎ is the fill distance and 𝑝 is the degree of the appended polynomial. In addition, unlike the global approach, the RBF-FD method produced sparse matrices, which leads to a computationally efficient and stable algorithm.

Description

Citation

Proceedings of the Postgraduate Institute of Science Research Congress (RESCON) -2022, University of Peradeniya, P 68

Collections