Radial Basis Function Approximations: Comparison and Applications
arXiv:1806.07705 · doi:10.1016/j.apm.2017.07.033
Abstract
Approximation of scattered data is often a task in many engineering problems. The Radial Basis Function (RBF) approximation is appropriate for large scattered (unordered) datasets in d-dimensional space. This approach is useful for a higher dimension d>2, because the other methods require the conversion of a scattered dataset to an ordered dataset (i.e. a semi-regular mesh is obtained by using some tessellation techniques), which is computationally expensive. The RBF approximation is non-separable, as it is based on the distance between two points. This method leads to a solution of Linear System of Equations (LSE) Ac=h. In this paper several RBF approximation methods are briefly introduced and a comparison of those is made with respect to the stability and accuracy of computation. The proposed RBF approximation offers lower memory requirements and better quality of approximation.
References in corpus (1)
Cited by in corpus (7)
- CENN: Conservative energy method based on neural networks with subdomains for solving variational problems involving heterogeneous and complex geometries
- Data-driven fluid mechanics of wind farms: A review
- A unified meshfree pseudospectral method for solving both classical and fractional PDEs
- Integration of spectator qubits into quantum computer architectures for hardware tuneup and calibration
- Grassmannian diffusion maps based surrogate modeling via geometric harmonics
- Determination of Stationary Points and Their Bindings in Dataset using RBF Methods
- Convolutional module for heart localization and segmentation in MRI