Self-sorting mixed-radix fast Fourier transforms
From MaRDI portal
Publication:1050756
DOI10.1016/0021-9991(83)90013-XzbMath0513.65092OpenAlexW2060469182MaRDI QIDQ1050756
Publication date: 1983
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9991(83)90013-x
discrete Fourier transformmatrix factorizationnumerical weather predictionFFT algorithmFast Fourier TransformFortran routinesself-sorting mixed-radix
Analysis of algorithms and problem complexity (68Q25) Meteorology and atmospheric physics (86A10) Numerical methods for trigonometric approximation and interpolation (65T40)
Related Items (26)
Implementation of a self-sorting in-place prime factor FFT algorithm ⋮ A self-sorting in-place prime factor real/half-complex FFT algorithm ⋮ A new set of minimum-add small-n rotated DFT modules ⋮ Large eddy simulation of turbulence-driven secondary flow in a square duct ⋮ Quantum time-dependent treatment of molecular collisions: Scattering of He by \(H_ 2 (B^ 1 \Sigma^ +_ u)\) ⋮ Efficient implementation of multidimensional fast Fourier transforms on a Cray X-MP ⋮ Parallelism in spectral methods ⋮ Inverse cascades in two-dimensional compressible turbulence. I. Incompressible forcing at low Mach number ⋮ Increasing horizontal resolution in numerical weather prediction and climate simulations: illusion or panacea? ⋮ A one-dimensional turbulence model; Enstrophy cascades and small-scale intermittency in decaying turbulence ⋮ Efficient and generic algorithm for rigorous integration forward in time of dPDEs. I ⋮ Ultrahigh-performance FFTs for the CRAY-2 and CRAY Y-MP supercomputers ⋮ Direct methods for the solution of the discrete Poisson equation: some comparisons ⋮ A semi-implicit spectral method for the anelastic equations ⋮ A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures ⋮ Pseudospectral simulation of compressible magnetohydrodynamic turbulence ⋮ Nesting strategies for prime factor FFT algorithms ⋮ A model for the simulation of turbulent boundary layers in an incompressible stratified flow ⋮ A note on prime factor FFT algorithms ⋮ Fast mixed-radix real Fourier transforms ⋮ In-place self-sorting fast Fourier transform algorithm with local memory references ⋮ Parallel computing of the global spectral atmospheric model on the YH-2 supercomputer ⋮ Finite element preconditioning for spectral multigrid methods ⋮ A comparison of different propagation schemes for the time dependent Schrödinger equation ⋮ Analysis of pipe flow transition. I: Direct numerical simulation ⋮ Transient response analysis of systems with different damping models.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast Poisson-solver for large grids
- The direct solution of the discrete Poisson equation on the surface of a sphere
- Fast Fourier Methods in Computational Complex Analysis
- FFT as Nested Multiplication, with a Twist
- On Computing the Discrete Fourier Transform
- Computing the Fast Fourier Transform on a Vector Computer
- An Algorithm for the Machine Calculation of Complex Fourier Series
- On computing the fast Fourier transform
- An Adaptation of the Fast Fourier Transform for Parallel Processing
- A Generalization of the Fast Fourier Transform
- Numerical Simulation of Incompressible Flows Within Simple Boundaries. I. Galerkin (Spectral) Representations
This page was built for publication: Self-sorting mixed-radix fast Fourier transforms