Cooley–Tukey FFT algorithm

Summary

Cooley–Tukey FFT algorithm is an algorithm^[1]. It ranks in the top 8% of algorithm entities by monthly Wikipedia readership (295 views/month).^[2]

Key Facts

• Cooley–Tukey FFT algorithm's image is recorded as Cooley-tukey-general.svg^[3].
• Cooley–Tukey FFT algorithm's instance of is recorded as algorithm^[4].
• James Cooley is named after Cooley–Tukey FFT algorithm^[5].
• John Tukey is named after Cooley–Tukey FFT algorithm^[6].
• Cooley–Tukey FFT algorithm's subclass of is recorded as fast Fourier transform^[7].
• Cooley–Tukey FFT algorithm's Freebase ID is recorded as /m/01zh37^[8].
• Cooley–Tukey FFT algorithm's Encyclopædia Universalis ID is recorded as algorithme-de-transformee-de-fourier-rapide^[9].
• Cooley–Tukey FFT algorithm's maintained by WikiProject is recorded as WikiProject Mathematics^[10].
• Cooley–Tukey FFT algorithm's Microsoft Academic ID is recorded as 1370844^[11].
• Cooley–Tukey FFT algorithm's OpenAlex ID is recorded as C1370844^[12].

Body

Designation and Status

Cooley–Tukey FFT algorithm's instance of is recorded as algorithm^[4].

History and Context

Things named after include James Cooley^[5], a mathematician^[13], 1926–2016^[14], of United States^[15], awarded the IEEE Fellow^[16] and John Tukey^[6], a politician^[17], 1915–2000^[18], of United States^[19], awarded the Guggenheim Fellowship^[20], specialised in physical chemistry^[21].

Why It Matters

Cooley–Tukey FFT algorithm ranks in the top 8% of algorithm entities by monthly Wikipedia readership (295 views/month).^[2] It has Wikipedia articles in 7 language editions, a strong signal of global cultural recognition.^[22] It is known by 6 alternative names across languages and contexts.^[23]