A class of linear solvers built on the Biconjugate A-Orthonormalization Procedure for solving unsymmetric linear systems
Numerical Analysis
2010-04-12 v1
Abstract
We present economical iterative algorithms built on the Biconjugate -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.
Keywords
Cite
@article{arxiv.1004.1622,
title = {A class of linear solvers built on the Biconjugate A-Orthonormalization Procedure for solving unsymmetric linear systems},
author = {B. Carpentieri and Y. -F. Jing and T. -Z. Huang and Y. Duan},
journal= {arXiv preprint arXiv:1004.1622},
year = {2010}
}