Lidstone Fractal Interpolation and Error Analysis

preprint2014arXivOpen access

Abstract

In the present paper, the notion of Lidstone Fractal Interpolation Function (Lidstone FIFLidstone \ FIF) is introduced to interpolate and approximate data generating functions that arise from real life objects and outcomes of several scientific experiments. A Lidstone FIF extends the classical Lidstone Interpolation Function which is generally found not to be satisfactory in interpolation and approximation of such functions. For a data {(xn,yn,2k);n=0,1,…,N and k=0,1,…,p}\{(x_n,y_{n,2k}); n=0,1,\ldots,N \ \text{and} \ k=0,1,\ldots,p\} with N,p∈NN,p\in\mathbb{N}, the existence of Lidstone FIF is proved in the present work and a computational method for its construction is developed. The constructed Lidstone FIF is a C2p[x0,xN]C^{2p}[x_0,x_N] fractal function ℓα\ell_α satisfying ℓα(2k)(xn)=yn,2k\ell_α^{(2k)}(x_n)=y_{n,2k}, n=0,1,…,Nn=0,1,\ldots,N,\ k=0,1,…,pk=0,1,\ldots,p. Our error estimates establish that the order of L∞L^\infty-error in approximation of a data generating function in C2p[x0,xN]C^{2p}[x_0,x_N] by Lidstone FIF is of the order N−2pN^{-2p}, while L∞L^\infty-error in approximation of 2k2k-order derivative of the data generating function by corresponding order derivative of Lidstone FIF is of the order N−(2p−2k)N^{-(2p-2k)}. The results found in the present work are illustrated for computational constructions of a Lidstone FIF and its derivatives with an example of a data generating function.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.