Abstract
We show how certain widely used multistep approximation algorithms can be interpreted as instances of an approximate Newton method. It was shown in an earlier paper by the second author that the convergence rates of approximate Newton methods (in the context of the numerical solution of PDEs) suffer from a “loss of derivatives”, and that the subsequent linear rate of convergence can be improved to be superlinear using an adaptation of Nash–Moser iteration for numerical analysis purposes; the essence of the adaptation being a splitting of the inversion and the smoothing into two separate steps. We show how these ideas apply to scattered data approximation as well as the numerical solution of partial differential equations. We investigate the use of several radial kernels for the smoothing operation. In our numerical examples we use radial basis functions also in the inversion step.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R.A. Adams, Sobolev Spaces (Academic Press, New York, 1975).
R. Brand, W. Freeden and J. Fröhlich, An adaptive hierarchical approximation method on the sphere using axisymmetric locally supported basis functions, Computing 57 (1996) 187-212.
P.L. Butzer and H. Berens, Semi-Groups of Operators and Approximation, Grundlehren der Mathematischen Wissenschaften, Vol. 145 (Springer, Heidelberg, 1967).
P.L. Butzer and R.J. Nessel, Fourier Analysis and Approximation, Vol. I, One-Dimensional Theory (Birkhäuser, Basel, 1971).
M.S. Floater and A. Iske, Multistep scattered data interpolation using compactly supported radial basis functions, J. Comput. Appl. Math. 73 (1996) 65-78.
L. Hörmander, The boundary problems of physical geodesy, Arch. Rat. Mech. Anal. 62 (1976) 1-52.
J.W. Jerome, An adaptive Newton algorithm based on numerical inversion: regularization as post-conditioner, Numer. Math. 47 (1985) 123-138.
L. Kantorovich and G. Akilov, Functional Analysis in Normed Spaces (Pergamon Press, New York, 1964).
G.G. Lorentz, Approximation of Functions (Holt, Rinehart and Winston, New York, 1966).
J. Moser, A rapidly convergent iteration method and nonlinear partial differential equations I, Ann. Scuola Norm. Sup. Pisa Cl. Sci. (4) 20 (1966) 265-315.
F.J. Narcowich, R. Schaback and J.D. Ward, Multilevel interpolation and approximation; preprint (1997).
R. Schaback, On the efficiency of interpolation by radial basis functions, in: Surface Fitting and Multiresolution Methods, A. Le Méhauté, C. Rabut and L.L. Schumaker, eds. (Vanderbilt University Press, Nashville, TN, 1997) pp. 309-318.
H. Triebel, Spaces of Besov-Hardy-Sobolev Type (Teubner, Leipzig, 1978).
H. Wendland, Piecewise polynomial, positive definite and compactly supported radial functions of minimal degree, Adv. Comput. Math. 4 (1995) 389-396.
H. Wendland, Error estimates for interpolation by compactly supported radial basis functions of minimal degree, J. Approx. Theory 93 (1998) 258-272.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Fasshauer, G.E., Jerome, J.W. Multistep approximation algorithms: Improved convergence rates through postconditioning with smoothing kernels. Advances in Computational Mathematics 10, 1–27 (1999). https://doi.org/10.1023/A:1018962112170
Issue Date:
DOI: https://doi.org/10.1023/A:1018962112170