Comments on "Method of flow graph simplification for the 16-point discrete Fourier Transform"
From MaRDI portal
Publication:4587772
Recommendations
- Method of flow graph simplification for the 16-point discrete Fourier transform
- Fast discrete Fourier transform computations using the reduced adder graph technique
- Algorithms for defining mixed radix FFT flow graphs
- scientific article; zbMATH DE number 4011887
- Comments on "A Fast Computational Algorithm for the Discrete Sine Transform"
- Publication:3490922
- scientific article; zbMATH DE number 4130975
- On the computational complexity of the general discrete Fourier transform
- scientific article; zbMATH DE number 4131613
- scientific article; zbMATH DE number 4009771
Cited in
(9)- A fast symmetric SVD algorithm for square Hankel matrices
- A comparison of high-order time integrators for thermal convection in rotating spherical shells
- Predictor-corrector pseudospectral methods for stochastic partial differential equations with additive white noise
- The twenty-fourth Fermat number is composite
- Rational Chebyshev spectral transform for the dynamics of broad-area laser diodes
- Spectral solvers to non-conservative transport for non-linear interactive systems of Boltzmann type
- Spectral-Lagrangian methods for collisional models of non-equilibrium statistical states
- Algorithms for particle-field simulations with collisions
- Performance and numerical accuracy evaluation of heterogeneous multicore systems for Krylov orthogonal basis computation
This page was built for publication: Comments on "Method of flow graph simplification for the 16-point discrete Fourier Transform"
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4587772)
