Description: C++实现的牛顿插值算法:对于n个点的插值,产生多项式的时间复杂度是O(n*n),最终进行一个点的计算的时间复杂度是O(n)。-C++ realization of the Newton interpolation algorithm: For n of interpolation points, resulting in polynomial time complexity is O (n* n), the final calculation of a point of time complexity is O (n). Platform: |
Size: 2048 |
Author:yxp |
Hits:
Description: 用牛顿差值法求多项式的均差,所用C++语言开发环境-Difference method with Newton polynomials are poor, the use of C++ language development environment Platform: |
Size: 1024 |
Author:Allen |
Hits:
Description: 利用MATLAB用最简单的语法进行牛顿插值法的编程(Programming of Newton interpolation method by using MATLAB) Platform: |
Size: 1024 |
Author:444164651651
|
Hits: