𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two dimensional fast Fourier transform for large data matrices

✍ Scribed by Mulugeta H. Serzu; Wooil M. Moon

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
298 KB
Volume
52
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Outflow Boundary Conditions for the Four
Outflow Boundary Conditions for the Fourier Transformed Two-Dimensional Vlasov Equation
✍ Bengt Eliasson πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 308 KB

In order to facilitate numerical simulations of plasma phenomena where kinetic processes are important, we have studied the technique of Fourier transforming the Vlasov equation analytically in velocity space, and solving the resulting equation numerically. Particular attention has been paid to the

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

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