The superiority of a new type (2,2)-step iterative method over the related Chebyshev method
type: Item
instance of: scholarly article
title: The superiority of a new type (2,2)-step iterative method over the related Chebyshev method
zbMATH Open document ID: 1067.65030
author: Meiqin Chen
author: Xiezhang Li
published in: Applied Mathematics and Computation
publication date: 2005-02-23T00:00:00Z
review text: \((k,l)\)-step iterative methods for solving linear systems of equations have been proposed in the eighties but they can be found only rarely in the literature since then, in particular not in papers related to applications. Since the access to the original literature is difficult, it would have been very helpful for the reader if the authors would have explained what are these methods and what are the basic ideas behind them. Let \(\Omega\) be an ellipse which contains the eigenvalues of the iteration matrix. The paper studies the question if there is a \((2,2)\)-step method which converges faster than the Chebyshev method which is optimal for \(\Omega\). The question is answered positively by constructing an appropriate class of methods which depends on two parameters. Numerical tests on two model problems confirm the analytical results. For a banded Toeplitz matrix, the (2,2)-step method needs even less iterations than popular iterative schemes like GMRES, QMR and BICGSTAB.
reviewed by: Volker John
Mathematics Subject Classification ID: 65F10
zbMATH DE Number: 2137708
zbMATH Keywords: (2,2)-step methods
zbMATH Keywords: Chebyshev method
zbMATH Keywords: convergence
zbMATH Keywords: numerical examples
zbMATH Keywords: comparison of methods
zbMATH Keywords: banded Toeplitz matrix
zbMATH Keywords: GMRES
zbMATH Keywords: QMR
zbMATH Keywords: BICGSTAB
MaRDI profile type: MaRDI publication profile
full work available at URL: j.amc.2003.12.112
OpenAlex ID: W2093939603
cites work: An adaptive Chebyshev iterative method for nonsymmetric linear systems based on modified moments
cites work: A study of semiiterative methods for nonsymmetric systems of linear equations
cites work: A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations
cites work: QMR: A quasi-minimal residual method for non-Hermitian linear systems
cites work: Estimates of Eigenvalues for Iterative Methods
cites work: Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. I, II
cites work: Q4814479
cites work: Is a Chebyshev method optimal for an elliptic region also optimal for a nearly elliptic region?
cites work: A condition for the superiority of the (2, 2)-step methods over the related Chebyshev method
cites work: The Tchebychev iteration for nonsymmetric linear systems
cites work: A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
cites work: The analysis of k-step iterative methods for linear systems from summability theory
cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
cites work: Q5342712
cites work: Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
DOI: 10.1016/J.AMC.2003.12.112
Recommended article: A condition for the superiority of the (2, 2)-step methods over the related Chebyshev method
Recommended article: The solution of linear algebraic systems by polynomial iterative methods
Recommended article: Q4814479
Recommended article: Two-step variants of Richardson's iterative method
Recommended article: Is a Chebyshev method optimal for an elliptic region also optimal for a nearly elliptic region?
description: scientific article; zbMATH DE number 2137708