An Iterative Dividing and Conquering Algorithm for Inverse Matrix

In this paper, an iterative dividing and conquering algorithm finding the inverse matrix A -1 of an invertible matrix A∈R n×n is given based on the row action method. The convergence and the correctness of the algorithm are proved. The intrinsic parallel characterization is discussed. It is proved that the algorithm can be easily translated into Q convergent iterative parallel algorithm which can be realized on vector multitreating machine systems. Moreover, from the algorithm, an iterative dividing and conquering algorithm finding generalized inverse matrices A + is also designed.