Residual iterative schemes for large-scale nonsymmetric positive definite linear systems (Q1001128)

A new iterative scheme for the solution of large-scale nonsymmetric linear systems, whose matrix has a positive (or negative) definite symmetric part is presented and analyzed. The proposed scheme uses the residual vector as search direction. The stepsize and up to date literature features for residual methods for nonlinear systems used, are differentiating the proposed scheme from the method of Richardson. Numerical experiments are included to show that without preconditioning, the proposed scheme outperforms some recently proposed variations of Richardson's method, and completes with well known and well established Krylov subspace methods: GMRES and BiCGSTAB. The computational experiments show that in the presence of suitable preconditioning strategies, residual iterative methods can be competitive and some times advantageous when compared with Krylov subspace methods.