Fast Radix 2, 3, 4, and 5 Kernels for Fast Fourier Transformations on Computers with Overlapping Multiply--Add Instructions

DOI10.1137/S1064827595281940zbMath0899.65082DBLPjournals/siamsc/Goedecker97OpenAlexW2041456897WikidataQ29012305 ScholiaQ29012305MaRDI QIDQ4376254

Stefan Goedecker

Publication date: 10 February 1998

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1064827595281940

zbMATH Keywords

performancefast Fourier transformationcomputers with overlapping multiply-add instructionsFFT kernels

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)

Related Items (4)

MULTIPLY-ADD OPTIMIZED FFT KERNELS ⋮ Linear response approach to collective electronic excitations of solids and surfaces ⋮ THEORETICAL STUDY OF THE BAND GAP OF SrSe AND SrTe IN GW APPROXIMATION ⋮ Applications of conformal computing techniques to problems in computational physics: the fast Fourier transform

This page was built for publication: Fast Radix 2, 3, 4, and 5 Kernels for Fast Fourier Transformations on Computers with Overlapping Multiply--Add Instructions