Preconditioning of Radial Basis Function Interpolation Systems via Accelerated Iterated Approximate Moving Least Squares Approximation
The standard approach to the solution of the radial basis function interpolation problem has been recognized as an ill-conditioned problem for many years. This is especially true when infinitely smooth basic functions such as multiquadrics or Gaussians are used with extreme values of their associated shape parameters. Various approaches have been described to deal with this phenomenon. These techniques include applying specialized preconditioners to the system matrix, changing the basis of the approximation space or using techniques from complex analysis. In this paper we present a preconditioning technique based on residual iteration of an approximate moving least squares quasi-interpolant that can be interpreted as a change of basis. In the limit our algorithm will produce the perfectly conditioned cardinal basis of the underlying radial basis function approximation space. Although our method is motivated by radial basis function interpolation problems, it can also be adapted for similar problems when the solution of a linear system is involved such as collocation methods for solving differential equations.
KeywordsPreconditioning methods Radial Basis Functions Accelerated Iterated least squares
Unable to display preview. Download preview PDF.
- 8.L. Cesari, “Sulla risoluzione dei sistemi di equazioni lineari per approssimazioni successive”, Ricerca Sci., Roma Vol. 2 8I, pp. 512–522, 1937Google Scholar
- 10.S. De Marchi and R. Schaback, “Stability of Kernel-Based Interpolation”, preprint, 2007Google Scholar
- 13.N. Dyn, “Interpolation of scattered data by radial functions”, in Topics in Multivariate Approximation, C. K. Chui, L. L. Schumaker, and F. Utreras (eds.), Academic New York, pp. 47–61, 1987Google Scholar
- 15.G. E. Fasshauer, “Solving partial differential equations by collocation with radial basis functions”, in Surface Fitting and Multiresolution Methods, A. Le Mehaute, C. Rabut, and L. L. Schumaker (eds.), Vanderbilt University Press, Nashville, TN, pp. 131–138, 1997Google Scholar
- 16.G. E. Fasshauer, “Meshfree approximation methods with Matlab”, Interdisciplinary Mathematical Sciences, Vol. 6, World Scientific Publishers, Singapore, 2007Google Scholar
- 17.G. E. Fasshauer and J. G. Zhang, “Scattered data approximation of noisy data via iterated moving least squares”, in Curve and Surface Fitting: Avignon 2006, T. Lyche, J. L. Merrien and L. L. Schumaker (eds.), Nashboro Press, Brentwood, TN, pp. 150–159, 2007Google Scholar
- 24.C.-F. Lee, L. Ling and R. Schaback, “On convergent numerical algorithms for unsymmetric collocation”, Adv. Comp. Math, to appearGoogle Scholar
- 27.L. Ling and R. Schaback, “Stable and convergent unsymmetric meshless collocation methods”, SIAM J. Numer. Anal., to appearGoogle Scholar
- 28.V. Maz'ya, “A new approximation method and its applications to the calculation of volume potentials. Boundary point method”, in DFG-Kolloquium des DFG-Forschungsschwerpunktes “Randelementmethoden”, 1991Google Scholar
- 32.J. G. Zhang, “Iterated Approximate Moving Least-Squares: Theory and Applications”, Ph.D. Dissertation, Illinois Institute of Technology, 2007Google Scholar