The (2,2)-step iterative method related to the optimal Chebyshev method for solving a large linear system Ax=bAx=b for a nonsymmetric matrix AA is studied closely. A condition guaranteeing the superiority of this (2,2)-step method over the Chebyshev method is derived. Interestingly, this condition involves the golden ratio. A numerical example is given to illustrate the theoretic results
AbstractThe problem of determining fast iterative solutions of certain large, sparse, and nonsymmetr...
AbstractThe approximate solutions in standard iteration methods for linear systems Ax=b, with A an n...
Abstract, Conjugate Gradient-like methods such as Orthomin(k) have been developed to obtain a good n...
The (2,2)-step iterative method related to the optimal Chebyshev method for solving a large linear s...
AbstractThe (2,2)-step iterative methods related to an optimal Chebyshev method for solving a real a...
The (2, 2)-step iterative methods related to an optimal Chebyshev method for solving a real and nons...
A new type (2,2)-step iterative method related to an optimal Chebyshev method is developed for solvi...
An optimal Chebyshev method for solving Ax = b, where all the eigenvalues of the real and non-symmet...
AbstractThe asymptotic rate of convergence of an optimal Chebyshev semiiterative method for solving ...
The asymptotic rate of convergence of an optimal Chebyshev semiiterative method for solving a real a...
Abstract. This study is concerned with k-step methods for the iterative solution of nonsymmet-ric sy...
two-stage iterative method as an alternative to the direct solution of linear system
The Chebyshev semi-iterative method, CHSIM, is probably the most often used to solve iteratively lin...
It is widely believed that Krylov subspace iterative methods are better than Chebyshev semi-iterativ...
It is widely believed that Krylov subspace iterative methods are better than Chebyshev semi-iterativ...
AbstractThe problem of determining fast iterative solutions of certain large, sparse, and nonsymmetr...
AbstractThe approximate solutions in standard iteration methods for linear systems Ax=b, with A an n...
Abstract, Conjugate Gradient-like methods such as Orthomin(k) have been developed to obtain a good n...
The (2,2)-step iterative method related to the optimal Chebyshev method for solving a large linear s...
AbstractThe (2,2)-step iterative methods related to an optimal Chebyshev method for solving a real a...
The (2, 2)-step iterative methods related to an optimal Chebyshev method for solving a real and nons...
A new type (2,2)-step iterative method related to an optimal Chebyshev method is developed for solvi...
An optimal Chebyshev method for solving Ax = b, where all the eigenvalues of the real and non-symmet...
AbstractThe asymptotic rate of convergence of an optimal Chebyshev semiiterative method for solving ...
The asymptotic rate of convergence of an optimal Chebyshev semiiterative method for solving a real a...
Abstract. This study is concerned with k-step methods for the iterative solution of nonsymmet-ric sy...
two-stage iterative method as an alternative to the direct solution of linear system
The Chebyshev semi-iterative method, CHSIM, is probably the most often used to solve iteratively lin...
It is widely believed that Krylov subspace iterative methods are better than Chebyshev semi-iterativ...
It is widely believed that Krylov subspace iterative methods are better than Chebyshev semi-iterativ...
AbstractThe problem of determining fast iterative solutions of certain large, sparse, and nonsymmetr...
AbstractThe approximate solutions in standard iteration methods for linear systems Ax=b, with A an n...
Abstract, Conjugate Gradient-like methods such as Orthomin(k) have been developed to obtain a good n...