An Adaptive Method for Choosing Center Sets of RBF Interpolation

@article{Gong2011AnAM,
  title={An Adaptive Method for Choosing Center Sets of RBF Interpolation},
  author={Dianxuan Gong and Jincai Chang and Chuanan Wei},
  journal={J. Comput.},
  year={2011},
  volume={6},
  pages={2112-2119}
}
Radial basis functions (RBF) provide powerful meshfree methods for multivariate interpolation for scattered data. RBF methods have been praised for their simplicity and ease of implementation in multivariate scattered data approximation. But both the approximation quality and stability depend on the distribution of the center set. It leads immediately to the problem of finding good or even optimal point sets for the reconstruction process. Many methods are constructed for center choosing. In… 
View via Publisher
researchgate.net
11 Citations
Highly Influential Citations
1
Background Citations
3
Methods Citations
2

Figures from this paper

11 Citations

Citation Type

Citation Type

Research on the Center Sets for Radial Basis Functions Interpolation
TLDR
An improved RBF method by extrapolation is proposed to overcome this disadvantage and an adaptive method that depends on both the fill distance and the interpolated function is recommended.
Multilevel adaptive radial basis function approximation using error indicators
TLDR
A new adaptive algorithm for Radial Basis Function (RBF) interpolation which aims to assess the local approximation quality and adds or removes points as required to improve the error in the specified region is described.
Least-squares hermite radial basis functions implicits with adaptive sampling
TLDR
This work investigates the use of Hermite Radial Basis Functions with least squares for the implicit surface reconstruction of scattered first-order Hermitian data and selects a small subset of point-normals as centers of the HRBF Implicits while considering all pairs as least-squares constraints.
Incremental approach for radial basis functions mesh deformation with greedy algorithm
Tetrahedral mesh deformation with positional constraints
A simple mesh-update procedure for fluidstructure interaction problems
Radial basis functions for option pricing in insurance liabilities
TLDR
An overview of the interpolation method, along with detailed looks into its features, exploring the topics accuracy, numerical stability, calibration of parameters and extrapolation, and a new technique to sample data centers is presented.
A fast mesh deformation method for fluid–structure interaction problems
TLDR
The use of a lumped mass matrix in the forward scheme leads to an explicit algorithm (no linear system to solve) which make the new technique presented here very fast and less computational cost.
Siamese Basis Function Networks for Defect Classification
TLDR
The authors propose a new approach where they introduce the usage of so called Siamese Kernels in a Basis Function Network to create theSiamese Basis function Network (SBF-Network), to classify by comparison using similarity scores.
Siamese Basis Function Networks for Data-efficient Defect Classification in Technical Domains
TLDR
A novel approach based on the combination of Siamese-Networks and Radial-BasisFunction-Network to perform data-efficient classification without pre-Training by measuring the distance between images in semantic space in a data efficient manner is proposed.
...
...

References

SHOWING 1-10 OF 46 REFERENCES
Adaptive residual subsampling methods for radial basis function interpolation and collocation problems
ON OPTIMAL CENTER LOCATIONS FOR RADIAL BASIS FUNCTION INTERPOLATION: COMPUTATIONAL ASPECTS
TLDR
This work presents some results concerning the computation of optimal points sets for interpolation by radial basis functions, and two algorithms for the construction of near-optimal set of points are considered.
Adaptive radial basis function methods for time dependent partial differential equations
Grid-free adaptive semi-Lagrangian advection using radial basis functions
An Adaptive Greedy Algorithm for Solving Large RBF Collocation Problems
TLDR
This contribution proposes an adaptive greedy method with proven (but slow) linear convergence to the full solution of the collocation equations to find “sparse” approximate solutions of general linear systems arising from collocation.
Adaptive greedy techniques for approximate solution of large RBF systems
TLDR
A class of efficient numerical algorithms that iteratively select small subsets of the interpolation points and refine the current approximative solution there turn out to be linear, and the technique can be generalized to positive definite linear systems in general.
Multistep scattered data interpolation using compactly supported radial basis functions
Near-optimal data-independent point locations for radial basis function interpolation
TLDR
This paper collects various results on the power function, which are used to show that good interpolation points are always uniformly distributed in a certain sense, and proves convergence of two different greedy algorithms for the construction of near-optimal sets.
Adaptive thinning for bivariate scattered data
Local error estimates for radial basis function interpolation of scattered data
Introducing a suitable variational formulation for the local error of scattered data intepolation by radial basis functions φ(r), the error can be bounded by a term depending on the Fourier transform…
...
...