Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Implementation of a prime factor FFT algorithm on CRAY-1

From MaRDI portal
Publication:1100875
Jump to:navigation, search

DOI10.1016/0167-8191(88)90008-7zbMath0641.65098OpenAlexW2006537647MaRDI QIDQ1100875

Clive Temperton

Publication date: 1988

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(88)90008-7

zbMATH Keywords

fast Fourier transformvector computerCRAY-1Hockney's parameterprime factor FFT algorithmvectorizing a single transform


Mathematics Subject Classification ID

Trigonometric interpolation (42A15) Numerical methods for trigonometric approximation and interpolation (65T40)


Related Items

A new set of minimum-add small-n rotated DFT modules, Congruent Number Theta Coefficients to 1012, A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures, Nesting strategies for prime factor FFT algorithms, Parallel integration of ODEs based on convolution algorithms



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1100875&oldid=13137449"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 02:41.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki