Content deleted Content added
→The Bruun factorization: more details on the essence of the algorithm |
m →Recursive factorizations and FFTs: more correct wikilink |
||
Line 35:
''F''<sub>''k'',''j''</sub>(''z''), and so on, recursively creating more and more remainder polynomials of smaller and smaller degree until one arrives at the final degree-0 results.
Moreover, as long as the polynomial factors at each stage are [[relatively prime polynomials|relatively prime]] (which for polynomials means that they have no common roots), one can construct a dual algorithm by reversing the process with the [[Chinese Remainder Theorem]].
===Cooley–Tukey as polynomial factorization===
| |||