Multistep approximation algorithms: Improved convergence rates through postconditioning with smoothing kernels

DOI10.1023/A:1018962112170zbMath0924.65009MaRDI QIDQ1284137

Gregory E. Fasshauer, Joseph W. Jerome

Publication date: 1 November 1999

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmsconvergencenumerical examplesNewton iterationNash-Moser iterationscattered data approximationsmoothing kernelmultilevel interpolationmultistep approximationpostconditioning

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Numerical interpolation (65D05) Applications to the sciences (65Z05)

Related Items (12)

Local multilevel scattered data interpolation ⋮ Numerical solution for biharmonic equation using multilevel radial basis functions and domain decomposition methods ⋮ Multiscale RBF collocation for solving PDEs on spheres ⋮ Solving Partial Differential Equations with Multiscale Radial Basis Functions ⋮ Accurate emulators for large-scale computer experiments ⋮ A Nash-Hörmander iteration and boundary elements for the Molodensky problem ⋮ Recursive computation of Hermite spherical spline interpolants ⋮ CONTINUATION FOR NONLINEAR ELLIPTIC PARTIAL DIFFERENTIAL EQUATIONS DISCRETIZED BY THE MULTIQUADRIC METHOD ⋮ Circumventing the ill-conditioning problem with multiquadric radial basis functions: Applications to elliptic partial differential equations ⋮ Algorithms defined by Nash iteration: Some implementations via multilevel collocation and smoothing ⋮ Multilevel RBF collocation method for the fourth-order thin plate problem ⋮ Newton iteration with multiquadrics for the solution of nonlinear PDEs

This page was built for publication: Multistep approximation algorithms: Improved convergence rates through postconditioning with smoothing kernels