Adaptive Richardson iteration based on Leja points
An adaptive Richardson method is presented for the solution of sparse linear systems. The relaxation parameters are chosen as reciprocal values of Leja points for an interval \([a,b]\). The endpoints \(a\) and \(b\) are determined adaptively by computing some modified moments during the iterations. The authors compare the new method to the conjugate gradient method and find it to be competitive.
scientific article; zbMATH DE number 910316
scientific article