Stable and accurate least squares radial basis function approximations on bounded domains

11/22/2022
by   Ben Adcock, et al.
0

The computation of global radial basis function (RBF) approximations requires the solution of a linear system which, depending on the choice of RBF parameters, may be ill-conditioned. We study the stability and accuracy of approximation methods using the Gaussian RBF in all scaling regimes of the associated shape parameter. The approximation is based on discrete least squares with function samples on a bounded domain, using RBF centers both inside and outside the domain. This results in a rectangular linear system. We show for one-dimensional approximations that linear scaling of the shape parameter with the degrees of freedom is optimal, resulting in constant overlap between neighbouring RBF's regardless of their number, and we propose an explicit suitable choice of the proportionality constant. We show numerically that highly accurate approximations to smooth functions can also be obtained on bounded domains in several dimensions, using a linear scaling with the degrees of freedom per dimension. We extend the least squares approach to a collocation-based method for the solution of elliptic boundary value problems and illustrate that the combination of centers outside the domain, oversampling and optimal scaling can result in accuracy close to machine precision in spite of having to solve very ill-conditioned linear systems.

READ FULL TEXT
research
08/28/2023

Efficient least squares approximation and collocation methods using radial basis functions

We describe an efficient method for the approximation of functions using...
research
08/10/2023

Efficient Function Approximation in Enriched Approximation Spaces

An enriched approximation space is the span of a conventional basis with...
research
10/30/2022

A new variable shape parameter strategy for RBF approximation using neural networks

The choice of the shape parameter highly effects the behaviour of radial...
research
06/22/2022

A stable, efficient scheme for 𝒞^n function extensions on smooth domains in ℝ^d

A new scheme is proposed to construct a 𝒞^n function extension for smoot...
research
04/23/2020

On the adaptive spectral approximation of functions using redundant sets and frames

The approximation of smooth functions with a spectral basis typically le...
research
11/18/2019

Efficient function approximation on general bounded domains using splines on a cartesian grid

Functions on a bounded domain in scientific computing are often approxim...

Please sign up or login with your details

Forgot password? Click here to reset