Abstract
Generalized Hermite spline interpolation with periodic splines of defect 2 on an equidistant lattice is considered. Then the classic periodic Hermite spline interpolation with shifted interpolation nodes is obtained as a special case.
By means of a new generalization of Euler-Frobenius polynomials the symbol of the considered interpolation problem is defined. Using this symbol, a simple representation of the fundamental splines can be given. Furthermore, an efficient algorithm for the computation of the Hermite spline interpolant is obtained, which is mainly based on the fast Fourier transform.
Similar content being viewed by others
References
K. Jetter, S.D. Riemenschneider and N. Sivakumar, Schoenberg's exponential Euler spline curves, Proc. Roy. Soc. Edinburgh 118A (1991) 21–33.
G. Merz and W. Sippel, Zur Konstruktion periodischer Hermite-Interpolationssplines bei Äquidistanter Knotenverteilung, J. Approx. Theory 54 (1988) 92–106.
G. Plonka, Periodic spline interpolation with shifted nodes, J. Approx. Theory, to appear.
G. Plonka and M. Tasche, Efficient algorithms for periodic Hermite-spline interpolation, Math. Comp. 58 (1992) 693–703.
M. Reimer, Zur reellen Darstellung periodischer Hermite-Spline-Interpolierender bei Äquidistantem Gitter mit Knotenshift,Splines in Numerical Analysis, eds. J.W. Schmidt and H. SpÄth (Springer, 1989) pp. 125–134.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Plonka, G. An efficient algorithm for periodic Hermite spline interpolation with shifted nodes. Numer Algor 5, 51–62 (1993). https://doi.org/10.1007/BF02109283
Issue Date:
DOI: https://doi.org/10.1007/BF02109283