A class of linear solvers built on the Biconjugate A-Orthonormalization Procedure for solving unsymmetric linear systems

We present economical iterative algorithms built on the Biconjugate $A$-Orthonormalization Procedure for real unsymmetric and complex non-Hermitian systems. The principal characteristics of the developed solvers is that they are fast convergent and cheap in memory. We report on a large combination of numerical experiments to demonstrate that the proposed family of methods is highly competitive and often superior to other popular algorithms built upon the Arnoldi method and the biconjugate Lanczos procedures for unsymmetric linear sytems.

No reviews yet.

No comments yet.