线性方程组正交化行处理法并行算法

Parallel Algorithm by Row Action Method with Orthogonalization for Systems of Linear Equations

利用正交化行处理法和分治策略给出一个求解任意线性代数方程组的基于分布式存储MIMD二叉树树机模型的并行迭代算法,证明该算法对任意的相容性线性代数方程组收敛并分析算法的计算复杂度、数值稳定性和应用前景.

Making use of the row action method with orthogonalization and the dividing-conquering strategy, this paper puts forward a parallel iterative algorithm based on the binary tree machine model with MIMD computer of distributed memory, to solve arbitrary systems of linear algebraic equations. It is proved that the algorithm is convergenced for arbitrary consistent systems of linear algebraic equations. The complexity of computation of the algorithm, the numerical stability and the applicable prospects are discussed.