New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

拉格朗日插值法 | K-D Space #40

Open

EndSaH opened this issue Jun 6, 2020 · 0 comments

Labels

dd8490c6c8fbbcfd8a544043ca98f436 Gitalk

Owner

EndSaH commented Jun 6, 2020

https://endsah.tk/blog/%E6%8B%89%E6%A0%BC%E6%9C%97%E6%97%A5%E6%8F%92%E5%80%BC%E6%B3%95/

拉格朗日插值法用来在 $O(n ^2)$ 的时间内解决已知多项式点值表达求系数表达的问题。给定 $n$ 个点 $(x _1, y _1), \dots, (x _n, y _n)$，求出这 $n$ 个点确定的一个 $n - 1$ 次的多项式。

EndSaH added Gitalk dd8490c6c8fbbcfd8a544043ca98f436 labels

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment