Geodesic
A New Method for High-Degree Spline Interpolation: Proof of Continuity for Piecewise Polynomials
Canadian mathematical bulletin, Tome 63 (2020) no. 3, pp. 655-669

Voir la notice de l'article provenant de la source Cambridge University Press

Effective and accurate high-degree spline interpolation is still a challenging task in today’s applications. Higher degree spline interpolation is not so commonly used, because it requires the knowledge of higher order derivatives at the nodes of a function on a given mesh.In this article, our goal is to demonstrate the continuity of the piecewise polynomials and their derivatives at the connecting points, obtained with a method initially developed by Beaudoin (1998, 2003) and Beauchemin (2003). This new method, involving the discrete Fourier transform (DFT/FFT), leads to higher degree spline interpolation for equally spaced data on an interval $[0,T]$. To do this, we analyze the singularities that may occur when solving the system of equations that enables the construction of splines of any degree. We also note an important difference between the odd-degree splines and even-degree splines. These results prove that Beaudoin and Beauchemin’s method leads to spline interpolation of any degree and that this new method could eventually be used to improve the accuracy of spline interpolation in traditional problems.
DOI : 10.4153/S0008439519000742
Mots-clés : spline, continuity, FFT, DFT, discrete Fourier transform, numerical derivative 
Pepin, A.; Beauchemin, S. S.; Léger, S.; Beaudoin, N. A New Method for High-Degree Spline Interpolation: Proof of Continuity for Piecewise Polynomials. Canadian mathematical bulletin, Tome 63 (2020) no. 3, pp. 655-669. doi: 10.4153/S0008439519000742
@article{10_4153_S0008439519000742,
     author = {Pepin, A. and Beauchemin, S. S. and L\'eger, S. and Beaudoin, N.},
     title = {A {New} {Method} for {High-Degree} {Spline} {Interpolation:} {Proof} of {Continuity} for {Piecewise} {Polynomials}},
     journal = {Canadian mathematical bulletin},
     pages = {655--669},
     year = {2020},
     volume = {63},
     number = {3},
     doi = {10.4153/S0008439519000742},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/S0008439519000742/}
}
TY  - JOUR
AU  - Pepin, A.
AU  - Beauchemin, S. S.
AU  - Léger, S.
AU  - Beaudoin, N.
TI  - A New Method for High-Degree Spline Interpolation: Proof of Continuity for Piecewise Polynomials
JO  - Canadian mathematical bulletin
PY  - 2020
SP  - 655
EP  - 669
VL  - 63
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.4153/S0008439519000742/
DO  - 10.4153/S0008439519000742
ID  - 10_4153_S0008439519000742
ER  - 
%0 Journal Article
%A Pepin, A.
%A Beauchemin, S. S.
%A Léger, S.
%A Beaudoin, N.
%T A New Method for High-Degree Spline Interpolation: Proof of Continuity for Piecewise Polynomials
%J Canadian mathematical bulletin
%D 2020
%P 655-669
%V 63
%N 3
%U http://geodesic.mathdoc.fr/articles/10.4153/S0008439519000742/
%R 10.4153/S0008439519000742
%F 10_4153_S0008439519000742

[1] Ahlberg, J. H., Nilson, E. N., and Walsh, J. L., The theory of splines and their applications. Academic Press, New York-London, 1967. Google Scholar

[2] Beauchemin, N. and Beauchemin, S. S., A new numerical Fourier transform in d-dimensions. IEEE Trans. Signal Process. 51(2003), 1422–1430. https://doi.org/10.1109/TSP.2003.810285 Google Scholar

[3] Beaudoin, N., Tutorial/Article didactique: A high-accuracy mathematical and numerical method for Fourier transform, integral, derivatives, and polynomial splines of any order. Canadian J. Phys. 76(1998), 659–677. Google Scholar

[4] Cahill, N., et al. , Fibonacci determinants. College Math. J. 33(2002). Google Scholar

[5] De Boor, C., A practical guide to splines. Applied Mathematical Sciences, 27, Springer-Verlag, New York-Berlin, 1978.10.1007/978-1-4612-6333-3 Google Scholar | DOI

[6] Foata, D., Eulerian polynomials: from Euler’s time to the present. In: The legacy of Alladi Ramakrishnan in the mathematical sciences. Springer, New York, 2010, pp. 253–273. https://doi.org/10.1007/978-1-4419-6263-8_15 Google Scholar | DOI

[7] Froeyen, M. and Hellemans, L., Improved algorithm for the discrete Fourier transform. Review of Scientific Instruments 56(1985), 2325–2327. Google Scholar | DOI

[8] Graham, R. L., Knuth, D. E., and Patashnik, O., Concrete mathematics. A foundation for computer science. Second ed., Addison-Wesley Publishing Company, Reading, MA, 1994. Google Scholar

[9] Kyrala, A., Applied functions of a complex variable. Wiley-Interscience, New York-London-Sydney, 1972. Google Scholar

[10] Merca, M., A note on the determinant of a Toeplitz-Hessenberg matrix. Spec. Matrices 2(2014), 10–16. Google Scholar

[11] Mäkinen, S., New algorithm for the calculation of the Fourier transform of discrete signals. Review of Scientific Instruments 53(1982), 627–630.10.1063/1.1137022 Google Scholar | DOI

[12] Petersen, K. T., Eulerian numbers. Birkhäuser Advanced Texts: Basel Textbooks, Birkhäuser/Springer, New York, 2015.10.1007/978-1-4939-3091-3 Google Scholar | DOI

[13] Savage, C. D. and Mirkó, V., The s-Eulerian polynomials have only real roots. Trans. Amer. Math. Soc. 367(2015), 1441–1466. https://doi.org/10.1090/S0002-9947-2014-06256-9 Google Scholar | DOI

[14] Schütte, J., New fast Fourier transform algorithm for linear system analysis applied in molecular beam relaxation spectroscopy. Review of Scientific Instruments 52(1981), 400–404.10.1063/1.1136592 Google Scholar | DOI

[15] Sorella, S. and Ghosh, S. K., Improved method for the discrete fast Fourier transform. Review of Scientific Instruments 55(1984), 1348–1352.10.1063/1.1137938 Google Scholar | DOI

Cité par Sources :