Pages that link to "Item:Q1100875"
From MaRDI portal
The following pages link to Implementation of a prime factor FFT algorithm on CRAY-1 (Q1100875):
Displaying 10 items.
- A high-performance fast Fourier transform algorithm for the Cray-2 (Q547499) (← links)
- A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures (Q753467) (← links)
- Ultrahigh-performance FFTs for the CRAY-2 and CRAY Y-MP supercomputers (Q973414) (← links)
- Implementation of a self-sorting in-place prime factor FFT algorithm (Q1087005) (← links)
- A segmented FFT algorithm for vector computers (Q1097674) (← links)
- A new set of minimum-add small-n rotated DFT modules (Q1098609) (← links)
- Parallel integration of ODEs based on convolution algorithms (Q1313246) (← links)
- Further measurements of \((r_{\infty},n_{1/2})\) on the CRAY-1 and CRAY X-MP (Q1823646) (← links)
- Nesting strategies for prime factor FFT algorithms (Q1825020) (← links)
- Congruent Number Theta Coefficients to 1012 (Q4931649) (← links)
