scientific article; zbMATH DE number 833642

MaRDI QIDQ4860111zbMATH OpenFDO

Authors Avijit Purkayastha, Jaime Seguel

Publication date 3 June 1996

zbMATH Keywords

image processingparallel computationPoisson equationfast Fourier transformsfast methodsprime lengthsymmetric discrete Fourier transforms

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• scientific article; zbMATH DE number 4100582
• A parallel FFT on an MIMD machine
• Two and three dimensional FFTs on highly parallel computers
• scientific article; zbMATH DE number 991433
• Publication:4860112

Cited in

(7)

• Computational Science and Its Applications – ICCSA 2004
• Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures
• High-performance radix-2, 3 and 5 parallel 1-D complex FFT algorithms for distributed-memory parallel computers
• FFT algorithms and their adaptation to parallel processing
• Efficient massively parallel implementation of some combinatorial algorithms
• Scalable parallel FFT for spectral simulations on a Beowulf cluster
• Big Prime Field FFT on Multi-core Processors

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 Q4860111)