An extension of the conjugate residual method to nonsymmetric linear systems (Q1008670): Difference between revisions

This paper adapts the conjugate residual method (CR) that solves large sparse symmetric systems to general sparse matrix systems. Special attention is paid to keep the computational effort constantly low per iteration, such as done with a two-sided Lanczos process in the bi-conjugate gradient method (Bi-CG) with short term recurrences. The paper describes and analyses the bi-conjugate gradient method in this light and extends conjugate residual to the new bi-conjugate residual algorithm (Bi-CR) for non-symmetric systems. The properties and convergence behavior of Bi-CR is studied and compared to Bi-CG. In experiments, Bi-CR appears to offer smoother and often faster convergence than Bi-CG.