Optimal error bounds for the cubic spline interpolation of lower smooth function. II

DOI10.1007/S11766-998-0044-0MaRDI QIDQ1129818zbMATH OpenOpenAlexFDO

Publication date 5 November 1998

Published in Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11766-998-0044-0

cubic spline interpolation optimal error bounds reproducing kernel

Spline approximation (41A15) Rate of convergence, degree of approximation (41A25) Numerical computation using splines (65D07)

Review text

For part I see the author in Approximation Theory Appl. 9, No. 4, 46-54 (1993; Zbl 0786.41011). For \(n \in \mathbb N\) and a function \(f \in C^1[0,1]\) let \(s_f\) denote a clamped cubic spline, interpolating \(f\) at \(n+1\) equally spaced nodes \(x_i n\), \(i, \dots, n\). The optimal error bound \[ e_{m,r}(n) \sup_{f \in C^m[0,1]} {\| s_f^{(r)} -f^{(r)} \| _\infty \over \| f^{(m)} \| _\infty} n^{m-r} \] is studied. Using an explicit expression of the reproducing kernel of the interpolating splines, the author finds upper and lower bounds for \(e_{1,0}(n)\) and \(e_{2,2}(n)\), as well as the exact value of \(\sup_n e_{1,0}(n)\) and \(\sup_n e_{2,2}(n)\).

Cites work

Cited in

(11)

This page was built for publication: Optimal error bounds for the cubic spline interpolation of lower smooth function. II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1129818)