← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

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

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

ximate the FFT on “nonequispaced” data. The article by Ware [449] provides an overview. 1

Interpolation is a notoriously tricky problem from the point of view of numerical stability. Although the approaches described here are mathematically correct, small differences in the inputs or round-off errors during computation can cause large differences in the result. 2 Many other authors

define ωn differently: ωn = e−2πi/n. This alternative definition tends to be used for sig

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea