Article

Numerical Algorithms

, Volume 12, Issue 1, pp 125-149

An adaptive Richardson iteration method for indefinite linear systems

  • D. CalvettiAffiliated withDepartment of Pure and Applied Mathematics, Stevens Institute of Technology
  • , L. ReichelAffiliated withDepartment of Mathematics and Computer Science, Kent State University

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

An adaptive Richardson iteration method is presented for the solution of large linear systems of equations with a sparse, symmetric, nonsingular, indefinite matrix. The relaxation parameters for Richardson iteration are chosen to be reciprocal values of Leja points for a compact setK:=[a,b]∪[c,d], where [a,b] is an interval on the negative real axis and [c, d] is an interval on the positive real axis. Endpoints of these intervals are determined adaptively by computing certain modified moments during the iterations. Computed examples show that this adaptive Richardson method can be competitive with the SYMMLQ and the conjugate residual methods, which are based on the Lanczos process.