| 求鳞状因子循环矩阵的逆阵及广义逆阵的快速付氏变换法 |
| |
| 引用本文： | 袁中扬.求鳞状因子循环矩阵的逆阵及广义逆阵的快速付氏变换法[J].纯粹数学与应用数学,2007,23(2):283-288. |
| |
| 作者姓名： | 袁中扬 |
| |
| 作者单位： | 浙江工商大学统计与计算科学学院,浙江,杭州,310012 |
| |
| 摘 要： | 借助快速付立叶变换(FFT),本文给出一种求n阶鳞状因子循环矩阵的逆阵、自反g-逆、群逆、Moore-Penrose逆的快速算法,该算法的计算复杂性为O(nlog2n),最后给出的两个数值算例表明了该算法的有效性.
|
| 关 键 词： | 鳞状因子循环矩阵 逆 自反g-逆 群逆 Moore-Penrose逆 快速付立叶变换(FFT) 计算复杂性 |
| 文章编号： | 1008-5513（2007）02-0283-06 |
| 修稿时间： | 2005-06-13 |
The fast Fourier transform algorithm for the inverse and generalized inverse of the scaled factor circulant matrices |
| |
| YUAN Zhongyang.The fast Fourier transform algorithm for the inverse and generalized inverse of the scaled factor circulant matrices[J].Pure and Applied Mathematics,2007,23(2):283-288. |
| |
| Authors: | YUAN Zhongyang |
| |
| Institution: | College of Statistics and Computing Science, Zhejiang Gongshang Universtity,Hangzhou 310012,China |
| |
| Abstract: | A fast algorithm for calculating the inverst and self-reflective g-inverse and group inverse and Moore-Penrose inverse of the scaled factor circulant matrices of order n is presented by the fast Fourier transform (FFT). its complexity is O(nlog2n),Fanally, numerical examples show the effectiveness of this algorithm. |
| |
| Keywords: | scaled factor circulant matrices inverse self-reflective g-inverse group inverse Moore-Penrose inverse fast Fourier transform (FFT) complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
