A family of Hermite interpolants by bisection algorithms (Q1192649)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A family of Hermite interpolants by bisection algorithms
scientific article

    Statements

    A family of Hermite interpolants by bisection algorithms (English)
    0 references
    27 September 1992
    0 references
    Let \(z\) be the midpoint of \(x\) and \(y\) and \(h=y-x\). The author investigates the iterative scheme \(f(z)=\lambda[f(y)+f(x)]+\lambda'h[f^ 1(y)-f^ 1(x)]\), \(f^ 1(z)=\mu/h[f(y)-f(x)]+\mu'[f(x)+f(y)]\). By iteration one obtains function values at all dyadic points in \([x,y]\) and the question is whether the functions so obtained have a continuous extension over the entire interval and whether \(f^ 1=f'\). Necessary conditions for \((f,f^ 1)\) to be a \(C^ 1\) interpolant are \(\lambda=1/2\), \(\mu'=(1-\mu)/2\). For \(f\) to be \(C^ 2\), the condition is \(\lambda'=-1/8\) and for \(f\in C^ 3\), \(\mu=3/2\), i.e. Hermite cubic interpolation. More in general, \(f\) is \(C^ 1\) iff \(\lambda'=-1/8\) and \(| 2-\mu| < 1\). The author also gives rather complicated necessary and sufficient conditions for \(f'=f^ 1\) to be continuous. Examples show that in the nonclassical cases, \(f'\) is far from differentiable.
    0 references
    bisection algorithms
    0 references
    two point subdivision scheme
    0 references
    Hermite conditions
    0 references
    dichotomy
    0 references
    curves
    0 references
    iterative scheme
    0 references
    dyadic points
    0 references
    Hermite cubic interpolation
    0 references
    0 references

    Identifiers