← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

30 第30章 多项式与快速傅里叶变换

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.756Z

h sizes that are not exact powers of 2 are known, they are beyond the scope of this book.

The FFT method employs a divide-and-conquer strategy, using the even-indexed and odd-indexed coefficients of A(x) separately to define the two new polynomials Aeven(x) and Aodd(x) of degree-bound n/2: Aeven(x) = a0 + a2x + a4x2 + ⋯ + an−2xn/2−1, Aodd(x) = a1 + a3x + a5x2 + ⋯ + an−1xn/2−1. Note that Aeven contains all the even-indexed coefficients of A (the binary

representation of the index ends in 0) and Aodd contains all the odd-indexed coefficients

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter030.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea