scientific article; zbMATH DE number 147703

zbMATH Open0791.65110MaRDI QIDQ4030615FDOQ4030615

Authors: Ya-Ping Lin 

Publication date: 1 April 1993

Title of this publication is not available (Why is that?)

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

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)

Cited In (3)

• Redistribution strategies for portable parallel FFT: a case study
• Fault-tolerant algorithm for Fast Fourier Transform on hypercubes
• 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)