结式矩阵的逆阵及广义逆阵的快速算法

The fast algorithms for finding the inverses and generalized inverses of resultant matrices

提出了求结式矩阵的逆阵、群逆及Moore Penrose逆的多项式快速算法.由于该算法仅用到结式矩阵的第一行元素,只有舍入误差,因此在理论上是精确的.

A fast algorithm for calculating the inverse and group inverse and MoorePenrose inverse of a resultant matrix is presented by using the fast algorithm for finding polynomials. Only the rounding error exists when the fast algorithm is realized by computers, and only the entries in the first row of the resultant matrix is used in this algorithm, so the computing results are accurate in theory.