Abstract | ||
---|---|---|
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 this paper, we give a short overview of these algorithms including thinning algorithm, greedy algorithm, arclength equipartition like algorithm and k-means clustering algorithm. A new adaptive data-dependent method is provided at the end with some numerical examples to show its effectiveness. © 2011 ACADEMY PUBLISHER. |
Year | DOI | Venue |
---|---|---|
2011 | 10.4304/jcp.6.10.2112-2119 | JCP |
Keywords | Field | DocType |
adaptive method,greedy algorithm,native space,radial basis function interpolation,thinning algorithm | Mathematical optimization,Radial basis function,Meshfree methods,Multivariate interpolation,Multivariate statistics,Computer science,Interpolation,Hierarchical RBF,Greedy algorithm,Artificial intelligence,Cluster analysis,Machine learning | Journal |
Volume | Issue | Citations |
6 | 10 | 2 |
PageRank | References | Authors |
0.39 | 6 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Dianxuan Gong | 1 | 9 | 5.91 |
Jincai Chang | 2 | 4 | 4.18 |
Chuanan Wei | 3 | 20 | 7.98 |