Abstract

This paper introduces a rational Fractal Interpolation Function (FIF), in the sense that it is obtained using a rational cubic spline transformation involving two shape parameters, and investigates its applicability in some constrained interpolation problems. We identify suitable values for the parameters of the corresponding Iterated Function System (IFS) so that it generates positive rational FIFs for a given set of positive data. Further, the problem of identifying the rational IFS parameters so as to ensure that its attractor (graph of the corresponding rational FIF) lies in a specified rectangle is also addressed. With the assumption that the data defining function is continuously differentiable, an upper bound for the interpolation error (with respect to the uniform norm) for the rational FIF is obtained. As a consequence, the uniform convergence of the rational FIF to the original function as the norm of the partition tends to zero is proven.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call