原书出处
Introduction to Algorithms, Fourth Edition
30 第30章 多项式与快速傅里叶变换
≤ k′ − k ≤ n − 1. ▪ With the inverse matrix defined, is given by for j = 0, 1, … , n − 1.
By comparing equations (30.8) and (30.11), you can see that if you modify the FFT algorithm to switch the roles of a and y, replace ωn by , and divide each element of the result by n, you get the inverse DFT (see Exercise 30.2-4). Thus, is computable in Θ(n lg n) time as well. Thus, the FFT and the inverse FFT provide a way to
transform a polynomial of degree-bound n back and forth between its coefficient represent
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter030.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea