A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations

DOI10.1137/0907057zbMath0613.65031MaRDI QIDQ4720670

Paul E. Saylor, Yousef Saad, Howard C. Elman

Publication date: 1986

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0907057

zbMATH Keywords

conjugate gradient method; large sparse nonsymmetric linear systems; Numerical examples; adaptive Chebyshev method; Chebyshev Krylov subspace algorithm

Mathematics Subject Classification ID

65F50: Computational methods for sparse matrices

65F10: Iterative numerical methods for linear systems

Related Items

Is a Chebyshev method optimal for an elliptic region also optimal for a nearly elliptic region?, The use of the CADNA library for validating the numerical results of the hybrid GMRES algorithm, Krylov-subspace methods for the Sylvester equation, An adaptive method for solving nonsymmetric linear systems involving applications of SCPACK, Polynomial preconditioning in Krylov-ROW-methods, A hybrid iterative method for symmetric indefinite linear systems, A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations, A generalized ADI iterative method, Iterative solution of linear systems in the 20th century, The superiority of a new type (2,2)-step iterative method over the related Chebyshev method, A polynomial method based on Fejér points for the computation of functions of unsymmetric matrices, A polynomial preconditioner for the GMRES algorithm, A block incomplete orthogonalization method for large nonsymmetric eigenproblems, A hybrid iterative method for symmetric positive definite linear systems, A condition for the superiority of the (2, 2)-step methods over the related Chebyshev method

Uses Software

• EISPACK