Answers are grounded in this paper and cite their sources.
A lower bound for the number of additions necessary to compute a family of linear functions by a linear algorithm is given when an upper bound c can be assigned to the modulus of the complex numbers involved in the computation. In the case of the fast Fourier transform, the lower bound is ( n /2) log 2 n when c = 1.
No takes yet. Share an insight, caveat, or question.
Jacques Morgenstern (1973) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: