row by row system
1.By using the row action method and the dividing?conquering strategy, this paper puts forward an iterative dividing?conquering algorithm to solve arbitrary systems of linear algebraic equations ?AX=b(A∈R??n×m?)?. It is proved that the algorithm is convergent for arbitrary consistent systems of linear algebraic equation. The acceleration techniques of the algorithm and its prospective application to MIMD parallel iterative algorithm for the system of linear algebraic equations are discussed.
