求分块鳞状因子循环矩阵逆矩阵的一种快速算法

摘要

A fast algorithm to compute the inversion of matrices with scaled factor circulant blocks is presented.The method is based on the discrete Fourier transform and the application of a recursive algorithm for the inversion of the block diagonal matrices.It is showed that the algorithm is far more efficient than the LU decoposition method.%给出了一种计算分块鳞状因子循环矩阵逆矩阵的快速算法,该算法主要利用了离散傅立叶变换和对角块矩阵求逆的递归算法,与标准的利用LU分解法求逆的算法相比,在计算复杂性上有很大的优势.