scientific article; zbMATH DE number 3997125
From MaRDI portal
Publication:4723256
zbMATH Open0615.65146MaRDI QIDQ4723256FDOQ4723256
Authors: Shaowen Mai, D. J. Evans 
Publication date: 1986
Title of this publication is not available (Why is that?)
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
Parallel numerical computation (65Y05) Numerical methods for trigonometric approximation and interpolation (65T40) Trigonometric interpolation (42A15)
Cited In (36)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A self-sorting in-place fast Fourier transform algorithm suitable for vector and parallel processing
- Fault-tolerant algorithm for Fast Fourier Transform on hypercubes
- An algorithm for distributed computation of FFTs
- Title not available (Why is that?)
- A CUDA-MPI algorithm for the fast Fourier transform on the hexagon and its implementation
- Title not available (Why is that?)
- A high-performance fast Fourier transform algorithm for the Cray-2
- A segmented FFT algorithm for vector computers
- Banyan models for the parallel implementation of the fast Fourier transform algorithm
- Parallelization and Performance Analysis of the Cooley–Tukey FFT Algorithm for Shared-Memory Architectures
- A Fast Parallel Horner Algorithm
- FFT algorithms and their adaptation to parallel processing
- Parallel algorithm for SWFFT using 3D data structure
- A parallel 1-D FFT algorithm for the Hitachi SR8000
- A simple and efficient parallel FFT algorithm using the BSP model
- Parallel FFT algorithms for mimd computers
- Fast Fourier transform algorithms for parallel computers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modelling Hadamard Haar transform algorithm for Omega connected multiprocessors
- A parallel scheme of discrete and fast Fourier transforms based on a polynomial representation of the basis.
- A PARALLEL FAST FOURIER TRANSFORM
- A parallel FFT algorithm for transputer networks
- Unified approach to the development of fast algorithms and parallel implementation of discrete Fourier transform
- Title not available (Why is that?)
- Parallel fast Fourier transforms for electronic structure calculations
- Title not available (Why is that?)
- Parallel 3-dim fast Fourier transforms with load balancing of the plane waves
- Real and complex fast Fourier transforms on the Fujitsu VPP 500
- Two and three dimensional FFTs on highly parallel computers
- Tridiagonal factorizations of Fourier matrices and applications to parallel computations of discrete Fourier transforms
- Title not available (Why is that?)
- 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)
