Results, challenges and new steps on RBF approximation and computation

2026/08/02 by Stefano De Marchi, Nadaniela Egidi, Josephin Giacomini +1
Mathematics · Computer Science · #math.NA #cs.NA

paper · pdf

arxiv created 2026/08/02 · arxiv updated 2026/08/04

Abstract

We present an up-to-date overview of approximation methods based on Radial Basis Function (RBF) techniques, which have recently attracted attention across various computational tools and application fields. This review study presents relevant results on RBF techniques, highlighting the associated computational challenges and stability issues that must be addressed when high-performance or parallel computation is required.

Citations

• The Price of Linear Time: Error Analysis of Structured Kernel Interpolation
• Samplet basis pursuit: Multiresolution scattered data approximation with sparsity constraints
• Multiresolution kernel matrix algebra
• Computational issues by interpolating with inverse multiquadrics: a solution
• Fourier Neural Operator for Parametric Partial Differential Equations
• Learning nonlinear operators via DeepONet based on the universal approximation theorem of operators
• Physics-informed neural networks: A deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations
• Product Kernel Interpolation for Scalable Gaussian Processes
• On the Error of Random Fourier Features
• Optimal Rates for Random Fourier Features
• Kernel Interpolation for Scalable Structured Gaussian Processes\n (KISS-GP)
• Mesh deformation based on radial basis function interpolation