A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations
From MaRDI portal
Publication:4720670
DOI10.1137/0907057zbMath0613.65031OpenAlexW2067712793MaRDI 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
conjugate gradient methodlarge sparse nonsymmetric linear systemsNumerical examplesadaptive Chebyshev methodChebyshev Krylov subspace algorithm
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)
Related Items (24)
A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations ⋮ A generalized ADI iterative method ⋮ An optimum iterative method for solving any linear system with a square matrix ⋮ A polynomial preconditioner for the GMRES algorithm ⋮ A block incomplete orthogonalization method for large nonsymmetric eigenproblems ⋮ Locally optimal and heavy ball GMRES methods ⋮ A hybrid iterative method for symmetric positive definite linear systems ⋮ On semiiterative methods generated by Faber polynomials ⋮ On the generation of Krylov subspace bases ⋮ The use of the CADNA library for validating the numerical results of the hybrid GMRES algorithm ⋮ Krylov-subspace methods for the Sylvester equation ⋮ Improving the arithmetic intensity of multigrid with the help of polynomial smoothers ⋮ An adaptive method for solving nonsymmetric linear systems involving applications of SCPACK ⋮ 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 ⋮ Comparison of several iterative techniques in the solution of symmetric banded equations on a two-pipe Cyber 205 ⋮ Is a Chebyshev method optimal for an elliptic region also optimal for a nearly elliptic region? ⋮ Tchebychev acceleration technique for large scale nonsymmetric matrices ⋮ Polynomial preconditioning in Krylov-ROW-methods ⋮ A hybrid iterative method for symmetric indefinite linear systems ⋮ Proxy-GMRES: Preconditioning via GMRES in Polynomial Space ⋮ Iterative solution of linear systems in the 20th century ⋮ A polynomial method based on Fejér points for the computation of functions of unsymmetric matrices ⋮ Implementation of an adaptive algorithm for Richardson's method
Uses Software
This page was built for publication: A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations
