原书出处
Introduction to Algorithms, Fourth Edition
30 第30章 多项式与快速傅里叶变换
30.4) of linear equations. Section 28.1 shows how to solve these equations in O(n3) time.
A faster algorithm for n-point interpolation is based on Lagrange’s formula: You might want to verify that the right-hand side of equation (30.5) is a polynomial of degree-bound n that satisfies A(xk) = yk for all k.
Exercise 30.1-5 asks you how to compute the coefficients of A using Lagrange’s formula in
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter030.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea