The superiority of a new type (2,2)-step iterative method over the related Chebyshev method
From MaRDI portal
Publication:1765806
DOI10.1016/j.amc.2003.12.112zbMath1067.65030OpenAlexW2093939603MaRDI QIDQ1765806
Publication date: 23 February 2005
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2003.12.112
convergencecomparison of methodsnumerical examplesChebyshev methodGMRESBICGSTABQMRbanded Toeplitz matrix(2,2)-step methods
Cites Work
- Unnamed Item
- Unnamed Item
- Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. I, II
- A study of semiiterative methods for nonsymmetric systems of linear equations
- The analysis of k-step iterative methods for linear systems from summability theory
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- The Tchebychev iteration for nonsymmetric linear systems
- An adaptive Chebyshev iterative method for nonsymmetric linear systems based on modified moments
- A condition for the superiority of the (2, 2)-step methods over the related Chebyshev method
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Estimates of Eigenvalues for Iterative Methods
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
- A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations
- Is a Chebyshev method optimal for an elliptic region also optimal for a nearly elliptic region?