摘要
借助快速傅立叶变换(FFT),给出一种求n阶置换因子循环矩阵的逆阵、自反g-逆、群逆、Moore-Penrose逆的快速算法,该算法的计算复杂性为O(nlog2n),最后给出的两个数值算例表明了该算法的有效性.
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（nlog2n）, Fanally, numerical examples show the effectiveness of this algorithm.
出处
《浙江工商大学学报》
2006年第3期24-29,共6页
Journal of Zhejiang Gongshang University
基金
国家自然科学基金资助项目(69972036)
