𝔖 Bobbio Scriptorium
✦   LIBER   ✦

MFFT4: Four dimensional vectorized fast Fourier transforms

✍ Scribed by A. Nobile; V. Roberto; F. Saitta

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
361 KB
Volume
48
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we present the long write-up of MFFT4, an extension of a previous package (MFFT) to include four dimensional fast Fourier transform (FFT) subprograms in vector form.

πŸ“œ SIMILAR VOLUMES

MFFT: A package for two- and three-dimen
MFFT: A package for two- and three-dimensional vectorized discrete fourier transforms
✍ A. Nobile; V. Roberto πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 1018 KB

Title ofprogram: MFFT Nature ofphysical problem Any problem requiring Fourier transforms. Catalogue number: AALL Program obtainable from: CPC Program Library, Queen's Uni-Method of solution versity of Belfast, N. Ireland (see application form in this The Discrete Fourier Transform (DFT) is calculate

Four67, a fast fourier transform package
Four67, a fast fourier transform package
✍ J.P. Christiansen; R.W. Hockney πŸ“‚ Article πŸ“… 1971 πŸ› Elsevier Science 🌐 English βš– 855 KB

Title of program (32 characters maximum): FOUR67 Catalogue number: ABUA Computer for which the program is designed and others upon which it is operable Computer: ICL KDF9. Installation: UKAEA Cuiham Laboratory Operating system or monitor under which the program is executed: EGDON 3 Programming langu

Rotating a three-dimensional array in an
Rotating a three-dimensional array in an optimal position for vector processing: case study for a three-dimensional fast Fourier transform
✍ S. Goedecker πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 399 KB

We show, that a three-dimensional array of dimension n 1. n,, 113 can he rotated in such a way, that all the innermost loops have lengths, which are products of two dimensions, i.e. n1n,, n1n3, n,n3. This technique is then applied to rotate a parallelepiped of data in an optimal position for Fourier

The conjugate-gradient nonuniform fast F
The conjugate-gradient nonuniform fast Fourier transform (CG–NUFFT) method for one- and two-dimensional media
✍ Xue Min Xu; Qing Huo Liu πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 159 KB

A no¨el method combining the conjugate-gradient and ( ) nonuniform fast Fourier transform CG᎐NUFFT algorithms for sol¨ing integral equations in electromagnetics is presented. The CG᎐NUFFT method has been applied to one-and two-dimensional inhomogeneous media. Numerical results show the ad¨antages of