Dividing-Conquering Strategy with Row Action Method for Systems of Linear Algebraic Equations
Ben Yang
Abstract
Ben Yang
Abstract
By using the row action method and the dividingconquering strategy, this paper puts forward an iterative dividingconquering algorithm to solve arbitrary systems of linear algebraic equations AX=b(A∈Rn×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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
By using the row action method and the dividingconquering strategy, this paper puts forward an iterative dividingconquering algorithm to solve arbitrary systems of linear algebraic equations AX=b(A∈Rn×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.
Key concepts: Algebraic equation, System of linear equations, Linear equation, Linear system, MIMD, Action (physics), Algebraic number, Iterative method