Pages that link to "Item:Q3992213"
From MaRDI portal
The following pages link to A Generalized Prime Factor FFT Algorithm for any $N = 2^p 3^q 5^r $ (Q3992213):
Displaying 7 items.
- Gpfaft (Q41460) (← links)
- Comparing coarray Fortran (CAF) with MPI for several structured mesh PDE applications (Q350153) (← links)
- A self-sorting in-place prime factor real/half-complex FFT algorithm (Q1097677) (← links)
- In-place self-sorting fast Fourier transform algorithm with local memory references (Q1299629) (← links)
- Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\) (Q2575622) (← links)
- \textit{Semtex}: a spectral element-Fourier solver for the incompressible Navier-Stokes equations in cylindrical or Cartesian coordinates (Q2696558) (← links)
- The techniques of the generalized fast Fourier transform algorithm (Q3985190) (← links)