𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fast elastostatic solver based on fast Fourier transform on multipoles (FFTM)

✍ Scribed by Xuefei He; Kian Meng Lim; Siak Piang Lim

Publisher
John Wiley and Sons
Year
2008
Tongue
English
Weight
190 KB
Volume
76
Category
Article
ISSN
0029-5981

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

Multiple radix fast fourier transformati
Multiple radix fast fourier transformation based on number theoretic transforms
✍ Brooks Lawrence; Robert Polge; Reza Adhami πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 476 KB

A multi-radix ,fust Fourier transform/number theoretic transftirm is proposed ,ftir the calculation of the discrete Fourier transform of sequences with a prime length, P. The proposed technique is applicable to sequences of length P = 2"' \* 3K2\* SK3+ 1, where Kl, K2 and K3 are integers. Advantages

Integration and interpolation based on f
Integration and interpolation based on fast spherical transforms for the multilevel fast multipole method
✍ Indranil Chowdhury; Vikram Jandhyala πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 111 KB

This study presents the application of fast spherical transforms developed by Driscoll and Healy (Adv Appl Math 15 (1994), 202-250) to the full-wave multilevel fast multipole method. An accurate uniformgrid based quadrature rule is presented, along with fast algorithms for interpolation and anterpol

Efficient implementation of multidimensi
Efficient implementation of multidimensional fast fourier transforms on a Cray X-MP
✍ A Nobile; V Roberto πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 849 KB

We review briefly computational methods for Discrete Fourier Transforms (DFT) and present new techniques which are especially efficient for 2-and 3-dimensional DFT implemented on a Cray X-MP. Comparative timings are given.