Optimal error bounds for the cubic spline interpolation of lower smooth function. II (Q1129818): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 03:14, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal error bounds for the cubic spline interpolation of lower smooth function. II |
scientific article |
Statements
Optimal error bounds for the cubic spline interpolation of lower smooth function. II (English)
0 references
5 November 1998
0 references
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)\).
0 references
cubic spline interpolation
0 references
optimal error bounds
0 references
reproducing kernel
0 references