Banyan models for the parallel implementation of the fast Fourier transform algorithm

DOI10.1016/0898-1221(88)90217-9zbMATH Open0652.68031OpenAlexW1966659061MaRDI QIDQ1107307FDOQ1107307

Authors: William H. Julian 

Publication date: 1988

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(88)90217-9

Recommendations

• scientific article; zbMATH DE number 3997125
• scientific article; zbMATH DE number 1131691
• scientific article; zbMATH DE number 991433
• Two and three dimensional FFTs on highly parallel computers
• A PARALLEL FAST FOURIER TRANSFORM

zbMATH Keywords

fast Fourier transformsparallel implementationsbanyan path model

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Numerical methods for trigonometric approximation and interpolation (65T40) Numerical methods for integral transforms (65R10) Algorithms in computer science (68W99)

Cites Work

• An Algorithm for the Machine Calculation of Complex Fourier Series
• Title not available (Why is that?)
• Some improvements in practical Fourier analysis and their application to X-ray scattering from liquids

Cited In (2)

• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Banyan models for the parallel implementation of the fast Fourier transform algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107307)