Doubling the rate -- improved error bounds for orthogonal projection with application to interpolation
Ian H. Sloan, Vesa Kaarnioja

TL;DR
This paper proves that under certain conditions, the convergence rate of orthogonal projections in $L_2$ can be doubled for smoother functions, improving error bounds in interpolation methods.
Contribution
It generalizes and extends the doubling of convergence rates to a broad class of Hilbert space projections and interpolation techniques.
Findings
Doubling of $L_2$ convergence rates for smoother functions.
Improved error bounds in the $H$-norm for orthogonal projections.
Application to kernel and radial basis function interpolation methods.
Abstract
Convergence rates for approximation in a Hilbert space are a central theme in numerical analysis. The present work is inspired by Schaback (Math. Comp., 1999), who showed, in the context of best pointwise approximation for radial basis function interpolation, that the convergence rate for sufficiently smooth functions can be doubled, compared to the best rate for functions in the "native space" . Motivated by this, we obtain a general result for -orthogonal projection onto a finite dimensional subspace of : namely, that any known convergence rate for all functions in translates into a doubled convergence rate for functions in a smoother normed space , along with a similarly improved error bound in the -norm, provided that , and are suitably related. As a special case we improve the known and -norm convergence rates for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical methods in engineering · Numerical methods in inverse problems · Advanced Numerical Methods in Computational Mathematics
