| 点数任意时的快速插值算法 |
| |
| 引用本文： | 成礼智.点数任意时的快速插值算法[J].国防科技大学学报,1993,15(4):91-95. |
| |
| 作者姓名： | 成礼智 |
| |
| 作者单位： | 国防科技大学系统工程与数学系 |
| |
| 摘 要： | 本文建立了运算量级为O(nlog_2m) 的多项式快速除法(其中,m,n分别为除式与被除式的多项式次数),把点数n+1为2的幂次的多项式快速插值推广到n+1为任意数情形,提出了运算量级为O (n log_2~2n) 的快速插值算法。
|
| 关 键 词： | 快速算法 FFT 多项式插值 快速多项式除法 |
| 收稿时间： | 4/6/1992 12:00:00 AM |
Fast Interpolation for a Polynomial Through some Points |
| |
| Cheng Lizhi.Fast Interpolation for a Polynomial Through some Points[J].Journal of National University of Defense Technology,1993,15(4):91-95. |
| |
| Authors: | Cheng Lizhi |
| |
| Institution: | Department of System Engineering and Mathematics |
| |
| Abstract: | At first, a fast polynomial division algorithm is developed in this paper at O (nlog_2m) times, where, n, mare degrees of dividend and divisior polynomial, respectively,We then discuss a fast interpolation algorithm through n+1 points that extends n+1with power of two to any number, the running times is O(n log_2~2n). |
| |
| Keywords: | fast algorithm fast Fourier transform polynomial interpolation fast polynomial division |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《国防科技大学学报》浏览原始摘要信息 |
| 点击此处可从《国防科技大学学报》下载免费的PDF全文 |
|
