Generalization of Hermite functions by fractal interpolation
نویسندگان
چکیده
منابع مشابه
Generalization of Hermite functions by fractal interpolation
Fractal interpolation techniques provide good deterministic representations of complex phenomena. This paper approaches the Hermite interpolation using fractal procedures. This problem prescribes at each support abscissa not only the value of a function but also its first p derivatives. It is shown here that the proposed fractal interpolation function and its first p derivatives are good approx...
متن کاملGeneralization of the Piecewise Polynomial Interpolation by Fractal Functions
The fractal interpolation functions defined by iterated function systems provide new methods of approximation and quantification of experimental data. The polynomial fractal functions can be considered as generalization of the piecewise polynomial interpolants. Assuming some hypotheses on the original function, a bound of the representation of the error for this kind of approximants is obtained...
متن کاملSuper Fractal Interpolation Functions
Abstract: In the present work, the notion of Super Fractal Interpolation Function (SFIF) is introduced for finer simulation of the objects of nature or outcomes of scientific experiments that reveal one or more structures embedded in to another. In the construction of SFIF, an IFS is chosen from a pool of several IFSs at each level of iteration leading to implementation of the desired randomnes...
متن کاملSpectrum of Fractal Interpolation Functions
where (x, y) ∈ S. The effects of an affine transform on a set are depicted in fig. 1. The union of N affine transformations is called the Hutchinson operator: W = ⋃N n=1 wn. For a specified metric the distance h(A, B) between two sets A, B can be defined. Under certain conditions [2] the Hutchinson operator is contractive, h(W (A),W (B)) ≤ sh(A, B), s < 1. Successive iterations with Hutchinson ...
متن کاملConstrained Interpolation via Cubic Hermite Splines
Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation. It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 2004
ISSN: 0021-9045
DOI: 10.1016/j.jat.2004.09.001