树网结构上一种新的矩阵迭代求逆并行算法

A New Parallel Algorithm for Matrix Inversion on Mesh

运用树网结构可以完成矩阵的并行快速求逆，其中迭代法是一种非常重要的方法。本文给出了一种新的迭代格式，对任意非奇异矩阵Ａ，运用新的迭代格式对Ａ求逆相对于经典牛顿迭代法，在同样精度要求下，时间可减少一半。

Many parallel algorithms can be used to invert a non-singular matrix rapidly on mesh. Among them, the iterative method is very important.This paper presents a new parallel iterative algorithm for arbitrary non-singular matrix inverision on mesh. Meeting the requirement of the same precision, new algorithm can reduce the running time for inversion by half in contrast to the typical Newton iterative algorithm on mesh.