Multistep approximation algorithms: Improved convergence rates through postconditioning with smoothing kernels
From MaRDI portal
Publication:1284137
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)
algorithms; convergence; numerical examples; Newton iteration; Nash-Moser iteration; scattered data approximation; smoothing kernel; multilevel interpolation; multistep approximation; postconditioning
65D10: Numerical smoothing, curve fitting
65D05: Numerical interpolation
65Z05: Applications to the sciences
Related Items
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