A vectorizable variant of pgcr methods for unsymmetric linear systems

This work was supported in part by the National Natural Science Foundation of China.

Abstract

In this paper the vectorizable algorithms of some preconditioned generalized conjugate residue method for unsymmetric linear systems are proposed, when A is five, seven or nine-diagonal matrices. The convergence of these iterative methods is analysed. We show that for this variant the number of iterations is about the same as for the standard PGCR algorithms. The resulting preconditioning GCR method has been tested on a YH-1 computer. Numerical examples indicates that the new variants is very efficient, since the vectorial computation can be applied.

Keywords:

• PGCR method
• Unsymmetric linear system
• Vectorizable
• Modified Incomplete choleski Decomposition

C.R. CATEGORIES::

• G.1.3.
• F.1.2.
• C.1.2.

This work was supported in part by the National Natural Science Foundation of China.

This work was supported in part by the National Natural Science Foundation of China.

Notes

This work was supported in part by the National Natural Science Foundation of China.