A Fast Algorithm for Finding Inverse of Partitioned Resultant Matrix

In this paper, a fast algorithm for calculating the inverse of partitioned matrix with resultant matrix blocks is presented by the polynomial fast algorithm for finding the inverse of resultant matrix. There is only error of approximation when the fast algorithm is realized by computers, and only the elements in the first row of partitioned matrix with resultant matrix blocks is used by the fast algorithm, so the result of the computation is accurate in theory. Finally, numerical examples are given.