scientific article; zbMATH DE number 3997125
From MaRDI portal
Publication:4723256
Recommendations
- scientific article; zbMATH DE number 1267276
- A PARALLEL FAST FOURIER TRANSFORM
- Fast Fourier transform algorithms for parallel computers
- Parallelization of fast Fourier transforms
- scientific article; zbMATH DE number 1131691
- FFT algorithms and their adaptation to parallel processing
- Unified approach to the development of fast algorithms and parallel implementation of discrete Fourier transform
- A parallel FFT algorithm for transputer networks
- scientific article; zbMATH DE number 991433
- Parallel Algorithms for the Spectral Transform Method
Cited in
(48)- A segmented FFT algorithm for vector computers
- An algorithm for distributed computation of FFTs
- Tridiagonal factorizations of Fourier matrices and applications to parallel computations of discrete Fourier transforms
- Banyan models for the parallel implementation of the fast Fourier transform algorithm
- FFT algorithms and their adaptation to parallel processing
- A parallel FFT algorithm for transputer networks
- In-place self-sorting fast Fourier transform algorithm with local memory references
- A self-sorting in-place fast Fourier transform algorithm suitable for vector and parallel processing
- A general purpose subroutine for Fast Fourier Transform on a distributed memory parallel machine
- Real and complex fast Fourier transforms on the Fujitsu VPP 500
- Fast parallel algorithms for forecasting
- Modelling Hadamard Haar transform algorithm for Omega connected multiprocessors
- Parallel fast Fourier transforms for electronic structure calculations
- Fault-tolerant algorithm for Fast Fourier Transform on hypercubes
- Parallel 3-dim fast Fourier transforms with load balancing of the plane waves
- Two and three dimensional FFTs on highly parallel computers
- Analysis of an ADA based version of Glassman's general \(N\) point fast Fourier transform
- Unified approach to the development of fast algorithms and parallel implementation of discrete Fourier transform
- scientific article; zbMATH DE number 991433 (Why is no real title available?)
- Parallel FFT algorithms for mimd computers
- scientific article; zbMATH DE number 7234326 (Why is no real title available?)
- A parallel scheme of discrete and fast Fourier transforms based on a polynomial representation of the basis.
- A Fast Parallel Horner Algorithm
- scientific article; zbMATH DE number 3976283 (Why is no real title available?)
- scientific article; zbMATH DE number 4100582 (Why is no real title available?)
- scientific article; zbMATH DE number 4126681 (Why is no real title available?)
- Portable parallel FFT for MIMD multiprocessors
- The Future Fast Fourier Transform?
- Parallel algorithm for SWFFT using 3D data structure
- A parallel 1-D FFT algorithm for the Hitachi SR8000
- scientific article; zbMATH DE number 1131691 (Why is no real title available?)
- scientific article; zbMATH DE number 2067903 (Why is no real title available?)
- A PARALLEL FAST FOURIER TRANSFORM
- scientific article; zbMATH DE number 1756129 (Why is no real title available?)
- scientific article; zbMATH DE number 1760159 (Why is no real title available?)
- Parallelization and Performance Analysis of the Cooley–Tukey FFT Algorithm for Shared-Memory Architectures
- scientific article; zbMATH DE number 2090611 (Why is no real title available?)
- scientific article; zbMATH DE number 2090654 (Why is no real title available?)
- scientific article; zbMATH DE number 820533 (Why is no real title available?)
- A CUDA-MPI algorithm for the fast Fourier transform on the hexagon and its implementation
- Fast Fourier transform algorithms for parallel computers
- Superparallel FFTs
- scientific article; zbMATH DE number 278846 (Why is no real title available?)
- scientific article; zbMATH DE number 279546 (Why is no real title available?)
- A high-performance fast Fourier transform algorithm for the Cray-2
- A simple and efficient parallel FFT algorithm using the BSP model
- Parallel FFT algorithms using radix 4 butterfly computation on an eight-neighbor processor array
- A parallel FFT on an MIMD machine
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4723256)
