scientific article; zbMATH DE number 147703

MaRDI QIDQ4030615zbMATH OpenFDO

Authors Ya-Ping Lin

Publication date 1 April 1993

zbMATH Keywords

fast Fourier transformcommunication complexityhypercube architectureparallel FFT algorithm

Mathematics Subject Classification ID

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

Recommendations

• Fault-tolerant algorithm for Fast Fourier Transform on hypercubes
• Two-dimensional FFT algorithms on hypercube and mesh machines
• Efficiency of some parallel numerical algorithms on distributed systems
• scientific article; zbMATH DE number 800360
• Communication-efficient matrix multiplication on hypercubes

Cited in

(3)

• Fault-tolerant algorithm for Fast Fourier Transform on hypercubes
• Redistribution strategies for portable parallel FFT: a case study
• A Parallel Prime Edge-Length Crystallographic FFT

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