Adaptive Richardson iteration based on Leja points
type: Item
instance of: scholarly article
title: Adaptive Richardson iteration based on Leja points
zbMATH Open document ID: 0863.65012
DOI: 10.1016/0377-0427(96)87162-7
published in: Journal of Computational and Applied Mathematics
publication date: 1997-06-08T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65F50
zbMATH DE Number: 910316
zbMATH Keywords: modified moments
zbMATH Keywords: adaptive Richardson method
zbMATH Keywords: sparse linear systems
zbMATH Keywords: Leja points
zbMATH Keywords: conjugate gradient method
author: Daniela Calvetti
author: Lothar Reichel
reviewed by: W. Gander
MaRDI profile type: Publication
full work available at URL: 0377-0427(96)87162-7
OpenAlex ID: W2010113997
cites work: Q4309406
cites work: A study of semiiterative methods for nonsymmetric systems of linear equations
cites work: On Generating Orthogonal Polynomials
cites work: Some Modified Matrix Eigenvalue Problems
cites work: Estimates of Eigenvalues for Iterative Methods
cites work: Q4917542
cites work: Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. I, II
cites work: Calculation of Gauss Quadrature Rules
cites work: Q3909906
cites work: On the effectiveness of adaptive Chebyshev acceleration for solving systems of linear equations
cites work: Sur certaines suites liées aux ensembles plans et leur application à la représentation conforme
cites work: The application of Leja points to Richardson iteration and polynomial preconditioning
cites work: Leapfrog variants of iterative methods for linear algebraic equations
cites work: Q4061445
cites work: Q5342712
description: scientific article; zbMATH DE number 910316