Adaptive methods for center choosing of radial basis function interpolation: a review

Authors:
Dianxuan Gong;Chuanan Wei;Ling Wang;Lichao Feng;Lidong Wang
Affiliations:
College of Sciences, Hebei Polytechnic Universtiy, Tangshan, China;Department of Information Technology, Hainan Medical College, Haikou, China;College of Sciences, Hebei Polytechnic Universtiy, Tangshan, China;College of Sciences, Hebei Polytechnic Universtiy, Tangshan, China;Department of Mathematics, Dalian Maritime University, Dalian, China
Venue:
ICICA'10 Proceedings of the First international conference on Information computing and applications
Year:
2010

Citing 6
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
Radial Basis Functions

Radial Basis Functions
Adaptive residual subsampling methods for radial basis function interpolation and collocation problems

Computers & Mathematics with Applications
Time series prediction using evolving radial basis function networks with new encoding scheme

Neurocomputing
Adaptive radial basis function methods for time dependent partial differential equations

Applied Numerical Mathematics
Error saturation in Gaussian radial basis functions on a finite interval

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Radial basis functions provide powerful meshfree method for multivariate interpolation for scattered data. But both the approximation quality and stability depend on the distribution of the center set. Many methods have been constructed to select optimal center sets for radial basis function interpolation. A review of these methods is given. Four kinds of center choosing algorithms which are thinning algorithm, greedy algorithm, arclength equipartition like algorithm and k-means clustering algorithm are introduced with some algorithmic analysis.