鳞状因子循环矩阵求逆的快速算法

The Fast Algorithms for Computing the Inverses and of Scaled Factor circulant Matrices

本文主要利用快速傅立叶变换(FFT)算法,给出鳞状因子循环矩阵的逆阵、自反g-逆、群逆、Moore-Penrose逆的一种快速算法,该算法无需预先知道矩阵的奇异性,其计算复杂性为O(nlog2n)

A fast algorithm for caculating the inverse and self-reflective g-inverse and group inverse and Moore-Penrose inverse of a scaled factor circulant matrix is by the fast Fourier transform(FFT).Its arithmetic compliexity is O(nlog_2~n).