2005
DOI: 10.4171/zaa/1248
|View full text |Cite
|
Sign up to set email alerts
|

Fractal Polynomial Interpolation

Abstract: A general procedure to define non-smooth versions of classical approximants by means of fractal interpolation functions is proposed. A complete and explicit description in the frequency domain of the functions constructed is obtained through their exact Fourier transforms. In particular, the generalization of the polynomial interpolation is developed. The Lagrange basis of the space of polynomials of degree lower or equal than N is generalized to a basis of fractal polynomials. As a consequence of the process,… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
114
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 199 publications
(114 citation statements)
references
References 0 publications
0
114
0
Order By: Relevance
“…This case is proposed by Barnsley [1] and Navascués [11] as generalization of any continuous function. Here the interpolation data are…”
Section: α-Fractal Functionmentioning
confidence: 99%
“…This case is proposed by Barnsley [1] and Navascués [11] as generalization of any continuous function. Here the interpolation data are…”
Section: α-Fractal Functionmentioning
confidence: 99%
“…They have been developed both in theory and applications by many authors; see for example [25,40,89,90,95,101,108,109,120]. They provide an alternative view on wavelets, [40,53].…”
Section: Fractal Continuationmentioning
confidence: 99%
“…These maps tend to bridge the gap between smoothness of classical mathematical objets and pseudo-randomness of experimental variables, breaking in this way their apparent diversity. Navascues and coworkers [17,18,22] contributed to the theory by defining "rough" approximants as perturbation of the functions generally used in classical approximation (polynomial, trigonometric, rational, etc.) via this operator.…”
Section: Prologuementioning
confidence: 99%
“…Following the publication of Fractals Everywhere [2], a beautiful exposition of IFS theory, fractal functions and their applications, various related issues such as calculus, Holder continuity, convergence, stability, smoothness, determination of scaling parameters, and perturbation error have been investigated in the literature [3][4][5][6][7][8][9][10][11][12][13]. The concept of smooth FIFs has been used to generalize the traditional splines [14][15][16][17][18] and to demonstrate that the interaction of classical numerical methods with fractal theory provides new interpolation schemes that supplement the existing ones. Various other extensions of FIFs include multivariable FIFs [7,9,16,[19][20][21][22][23][24][25] generated by using higher-dimensional or recurrent IFSs, the hidden variable FIFs produced by projecting the attractors of vector valued IFSs to a lower-dimensional space.…”
Section: Prologuementioning
confidence: 99%