An adaptive Chebyshev iterative method for nonsymmetric linear systems based on modified moments
From MaRDI portal
Publication:1326468
DOI10.1007/s002110050016zbMath0796.65033OpenAlexW1971436650MaRDI QIDQ1326468
Gene H. Golub, Daniela Calvetti, Lothar Reichel
Publication date: 10 October 1994
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002110050016
Krylov spacethree term recurrence relationsadaptive Chebyshev iterative methodnonsymmetric conjugate gradientsnonsymmetric Lanczos method
Related Items
A generalized ADI iterative method ⋮ New block quadrature rules for the approximation of matrix functions ⋮ Hybrid methods based on LCG and GMRES ⋮ Fast solution of a class of periodic pseudodifferential equations ⋮ Generalized averaged Gauss quadrature rules for the approximation of matrix functionals ⋮ On computing of block ILU preconditioner for block tridiagonal systems ⋮ Restarted GMRES preconditioned by deflation ⋮ Block GPBi-CG method for solving nonsymmetric linear systems with multiple right-hand sides and its convergence analysis ⋮ Low‐rank linear fluid‐structure interaction discretizations ⋮ On the generation of Krylov subspace bases ⋮ Simplified anti-Gauss quadrature rules with applications in linear algebra ⋮ A condition for the superiority of the (2, 2)-step methods over the related Chebyshev method ⋮ The superiority of a new type (2,2)-step iterative method over the related Chebyshev method ⋮ Is a Chebyshev method optimal for an elliptic region also optimal for a nearly elliptic region? ⋮ An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating. ⋮ Leja, Fejér-Leja and \(\mathfrak{R}\)-Leja sequences for Richardson iteration
