置换因子循环矩阵求逆和广义逆的Euclid算法

Euclid algorithm for finding the inverse and generalized inverseof the permutation factor circulant matrix

利用多项式的Euclid算法给出了非奇异的置换因子循环矩阵求逆矩阵的一个新算法,并将该算法推广用于求奇异置换因子循环矩阵的Moore Penrose逆.最后给出的数值例子证明了该算法的有效性.

A new algorithm for finding the inverse of a nonsingular permutation factor circulant matrix is presented by the Euclid algorithm of polynomial. Extension is made to compute the Moore-Penrose inverse of a singular permutation factor circulant matrix. Finally, numerical examples show the effectiveness of the algorithm.