𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithms for solving Hermite interpolation problems using the Fast Fourier Transform

✍ Scribed by Elías Berriochoa; Alicia Cachafeiro


Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
297 KB
Volume
235
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

✦ Synopsis


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.


📜 SIMILAR VOLUMES


Iterative image reconstruction for PROPE
✍ Ashish A. Tamhane; Mark A. Anastasio; Minzhi Gui; Konstantinos Arfanakis 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB

## Abstract ## Purpose: To investigate an iterative image reconstruction algorithm using the nonuniform fast Fourier transform (NUFFT) for PROPELLER (Periodically Rotated Overlapping ParallEL Lines with Enhanced Reconstruction) MRI. ## Materials and Methods: Numerical simulations, as well as exp

A Fast Hough Transform for the Parametri
✍ Cheyne Gaw Ho; Rupert C.D. Young; Chris D. Bradfield; Chris R. Chatwin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 768 KB

Hough Transform for the Parametrisation of Straight Lines using Fourier Methods T he Hough transform is a useful technique in the detection of straight lines and curves in an image. Due to the mathematical similarity of the Hough transform and the forward Radon transform, the Hough transform can be