| 引用本文: | 成礼智.点数任意时的快速插值算法.[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[点击复制] |
|
| |
|
|
| 本文已被：浏览 5968次 下载 6199次 |
| 点数任意时的快速插值算法 |
| 成礼智 |
|
(系统工程与数学系)
|
| 摘要: |
| 本文建立了运算量级为O (n log2m)的多项式快速除法(其中，m,n 分别为除式与被除式的多项式次数),把点数 n+1 为 2 的幂次的多项式快速插值推广到n+1为任意数情形，提出了运算量级为O (n log22n)的快速插值算法。 |
| 关键词: 快速算法，FFT，多项式插值，快速多项式除法 |
| DOI： |
| 投稿日期：1992-04-06 |
| 基金项目: |
|
| Fast Interpolation for a Polynomial Through some Points |
| Cheng Lizhi |
|
(Department of System Engineering and Mathematics)
|
| Abstract: |
| 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). |
| Keywords: fast algorithm,fast Fourier transform,polynomial interpolation,fast polynomial division |
|
|
