| 求置换因子循环矩阵的逆阵及广义逆阵的快速傅氏变换法 |
| |
| 引用本文： | 袁中扬. 求置换因子循环矩阵的逆阵及广义逆阵的快速傅氏变换法[J]. 浙江省政法管理干部学院学报, 2006, 0(3): 24-29 |
| |
| 作者姓名： | 袁中扬 |
| |
| 作者单位： | 浙江工商大学,统计与数学学院,浙江杭州310035 |
| |
| 基金项目： | 国家高技术研究发展计划(863计划) |
| |
| 摘 要： | 借助快速傅立叶变换（FFT）,给出一种求n阶置换因子循环矩阵的逆阵、自反g-逆、群逆、Moore-Penrose 逆的快速算法,该算法的计算复杂性为O（nlog2n）,最后给出的两个数值算例表明了该算法的有效性。
|
| 关 键 词： | 置换因子循环矩阵 逆 自反g-逆 群逆 Noore-Penrose逆 快速傅立叶变换FFT 计算复杂性 |
| 文章编号： | 1009-1505（2006）03-0024-06 |
| 收稿时间： | 2005-09-29 |
| 修稿时间： | 2005-09-29 |
The Fast Fourier Transform Algorithm for the Inverse and Generalized Inverse of the Permutation Factor Circulant Matrices |
| |
| YUAN Zhong-yang. The Fast Fourier Transform Algorithm for the Inverse and Generalized Inverse of the Permutation Factor Circulant Matrices[J]. Journal of Zhejiang Gongshang University, 2006, 0(3): 24-29 |
| |
| Authors: | YUAN Zhong-yang |
| |
| Affiliation: | College of Statistics and Mathematics, Zhejiang Gongshang University, Hangzhou 310035, China |
| |
| Abstract: | A fast algorithm for calculating the inverse and self-reflective g-inverse and group inverse and Moore-Penrose inverse of the permutation factor circulant matrices of ordern is presented by the fast Fourier transform(FFT).its complexity is O(nlog_2n),Fanally,numerical examples show the effectiveness of this algorithm. |
| |
| Keywords: | permutation factor circulant matrices inverse self-reflective g-inverse group inverse moore-penrose inverse fast fourier transform(FFT) complexity. |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
