| 某些环中卷积的快速计算 |
| |
| 引用本文： | 曾泳泓.某些环中卷积的快速计算[J].国防科技大学学报,1990,12(3):63-69. |
| |
| 作者姓名： | 曾泳泓 |
| |
| 作者单位： | 国防科技大学系统工程与应用数学系 |
| |
| 摘 要： | 本文研究了环中卷积的快速计算问题,讨论了计算域中卷积通常使用的Wino-grad 短卷积算法、快速富里叶变换算法以及多项式变换算法对一般环中卷积计算的可适用性。特别地,对应用广泛的矩阵多项式乘积、矩阵卷积及多项式卷积计算提出了比直接计算快得多的算法。
|
| 关 键 词： | 近世代数 环 卷积 快速算法 |
| 收稿时间： | 1987/3/12 0:00:00 |
Fast Computation for Convolutions in Some Rings |
| |
| Zeng Yonghong.Fast Computation for Convolutions in Some Rings[J].Journal of National University of Defense Technology,1990,12(3):63-69. |
| |
| Authors: | Zeng Yonghong |
| |
| Institution: | Department of Applied Mathematics and System Engineering |
| |
| Abstract: | This paper discusses the problem of fast computation of convolutions inrings.The adaptability of the well-known Winograd algorithm,FPT algorithmand FFT algorithm which are proposed for computing convolutions in complexfields is studied in the case of rings.Especially,fast algorithms for compu-ting multiplication of matrix polynomial,matrix convolution and polynomialconvolution are proposed.They are of wide practical usage. |
| |
| Keywords: | modern algebra ring convolution fast algorithm |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《国防科技大学学报》浏览原始摘要信息 |
| 点击此处可从《国防科技大学学报》下载免费的PDF全文 |
