Parallel implementation of the semi-conjugate residual method for systems of linear algebraic equations
Sergey Pudov
Abstract
Sergey Pudov
Abstract
A preconditioned semi-conjugate residual algorithm for solving systems of algebraic equations with a nonsymmetric square matrix is presented. Most of the calculations in the algorithm is accounted for vector operations whose number grows quadratically with the number of stored directing vectors. A parallel implementation of the algorithm is studied experimentally, the Eisenstat modification being chosen as the preconditioning. An algorithm for parallelizing matrix operations is presented for special problems.
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.
A preconditioned semi-conjugate residual algorithm for solving systems of algebraic equations with a nonsymmetric square matrix is presented. Most of the calculations in the algorithm is accounted for vector operations whose number grows quadratically with the number of stored directing vectors. A parallel implementation of the algorithm is studied experimentally, the Eisenstat modification being chosen as the preconditioning. An algorithm for parallelizing matrix operations is presented for special problems.
Key concepts: Conjugate gradient method, Residual, Matrix (chemical analysis), Conjugate residual method, Conjugate, Algebraic equation, Algebraic number, System of linear equations