𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Individual-based models solved using fast Fourier transforms

✍ Scribed by James W. Haefner; Christopher J. Dugaw

Book ID
117466384
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
202 KB
Volume
125
Category
Article
ISSN
0304-3800

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Fast Fourier Transformation Based on Num
Fast Fourier Transformation Based on Number Theoretic Transforms
✍ Reza Adhami; Robert J. Polge πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 643 KB

Many fast algorithms have been proposed for computing the discrete Fourier transformation. Most of them are based on factorization with the goal of reducing the number of multiplications. They usejoating point arithmetic to avoid repetitious scaling and a sizeable wordlength to minimize quantization

Algorithms for solving Hermite interpola
Algorithms for solving Hermite interpolation problems using the Fast Fourier Transform
✍ ElΓ­as Berriochoa; Alicia Cachafeiro πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 297 KB

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 pro