Arya Kumar Bedabrata Chand

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.

Fractal interpolation is a modern technique for fitting of smooth/non-smooth data. Based on only functional values, we develop two types of 1-rational fractal interpolation surfaces (FISs) on a rectangular grid in the present paper that contain scaling factors in both directions and two types of positive real parameters which are referred as shape parameters. The graphs of these 1-rational FISs are the attractors of suitable rational iterated function systems (IFSs) in R3 which use a collection of rational IFSs in the x-direction and y-direction and hence these FISs are self-referential in nature. Using upper bounds of the interpolation error of the x-direction and y-direction fractal interpolants along the grid lines, we study the convergence results of 1-rational FISs toward the original function. A numerical illustration is provided to explain the visual quality of our rational FISs. An extra feature of these fractal surface schemes is that it allows subsequent interactive alteration of the shape of the surfaces by changing the scaling factors and shape parameters.

Coalescence hidden variable fractal interpolation function (CHFIF) proves more versatile than classical interpolant and fractal interpolation function (FIF). Using rational functions and CHFIF, a general construction of A-fractal rational functions is introduced for the first time in the literature. This construction of A-fractal rational function also allows us to insert shape parameters for positivity-preserving univariate interpolation. The convergence analysis of the proposed scheme is established. With suitably chosen numerical examples and graphs, the effectiveness of the positivity-preserving interpolation scheme is illustrated.

This paper presents the theory of C1-rational quadratic fractal interpolation surfaces (FISs) over a rectangular grid. First we approximate the original function along the grid lines of interpolation domain by using the univariate C1-rational quadratic fractal interpolation functions (fractal boundary curves). Then we construct the rational quadratic FIS as a blending combination with the x-direction and y-direction fractal boundary curves. The developed rational quadratic FISs are monotonic whenever the corresponding fractal boundary curves are monotonic. We derive the optimal range for the scaling parameters in both positive and negative directions such that the rational quadratic fractal boundary curves are monotonic in nature. The relation between x-direction and y-direction scaling matrices is deduced for symmetric rational quadratic FISs for symmetric surface data. The presence of scaling parameters in the fractal boundary curves helps us to get a wide variety of monotonic/symmetric rational quadratic FISs without altering the given surface data. Numerical examples are provided to demonstrate the comprehensive performance of the rational quadratic FIS in fitting a monotonic/symmetric surface data. The convergence analysis of the monotonic rational quadratic FIS to the original function is reported.

The reconstruction of an unknown function providing a set of Lagrange data can be approached by means of fractal interpolation. The power of that methodology allows us to generalize any other interpolant, both smooth and nonsmooth, but the important fact is that this technique provides one of the few methods of nondifferentiable interpolation. In this way, it constitutes a functional model for chaotic processes. This paper studies a generalization of an approximation formula proposed by Dunham Jackson, where a wider range of values of an exponent of the basic trigonometric functions is considered. The trigonometric polynomials are then transformed in close fractal functions that, in general, are not smooth. For suitable election of this parameter, one obtains better conditions of convergence than in the classical case: the hypothesis of continuity alone is enough to ensure the convergence when the sampling frequency is increased. Finally, bounds of discrete fractal Jackson operators and their classical counterparts are proposed.

Despite that the spline theory is a well studied topic, its relationship with the fractal theory is novel. Fractal approach offers a single specification for a large class of interpolants of which the classical spline is a particular member, and hence possesses considerable flexibility in the choice of an interpolant. The explicit construction of a C1-cubic Hermite fractal interpolation function (FIF) is introduced in the present work. If slopes at knot points are not known, then they are calculated through solution of a suitable linear system of equations so as to have C2 global smoothness for the resulting cubic FIF. Thus, the present method generalizes the classical C1-cubic Hermite and C2-cubic spline interpolants simultaneously, and offers a new approach to the development of cubic spline FIF in contrast to the construction through moments by Chand and Kapoor [SIAM J. Numer. Anal., 44(2), (2006), pp. 655-676]. It is shown that, for appropriate values of vertical scaling factors involved in the definition, developed C1-cubic Hermite FIF converges uniformly to the data generating function Φ ε C4 at least as rapidly as fourth power of the mesh norm approaches zero. © 2012 American Institute of Physics.