Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4640536 | Journal of Computational and Applied Mathematics | 2010 | 13 Pages |
Abstract
We present a method for computing the Hermite interpolation polynomial based on equally spaced nodes on the unit circle with an arbitrary number of derivatives in the case of algebraic and Laurent polynomials. It is an adaptation of the method of the Fast Fourier Transform (FFT) for this type of problems with the following characteristics: easy computation, small number of operations and easy implementation.In the second part of the paper we adapt the algorithm for computing the Hermite interpolation polynomial based on the nodes of the Tchebycheff polynomials and we also study Hermite trigonometric interpolation problems.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Elías Berriochoa, Alicia Cachafeiro,