At first,a fast polynomial division algorithm is developed in this paper at O(n log2m) times, where,n, m are degrees of dividend and divisior polynomial,respectively,We then discuss a fast interpolation algorithm through n+1 points that extends n+1 with power of two to any number,the running times is O(n log22n).
参考文献
相似文献
引证文献
引用本文
成礼智.点数任意时的快速插值算法[J].国防科技大学学报,1993,15(4):91-95. Cheng Lizhi. Fast Interpolation for a Polynomial Through some Points[J]. Journal of National University of Defense Technology,1993,15(4):91-95.