The Chebyshev semi-iterative method, CHSIM, is probably the most often used to solve iteratively linear systems x=Mx+g, where the only requirement on the matrix M is that it be Hermitian. However, a knowledge of bounds a and b for the largest and smallest eigenvalues of the matrix is required. This thesis presents a procedure for using the CHSIM without knowledge of a or b. The procedure uses variations in the convergence factor, produced by the use of the CHSIM with approximated values of the bounds a and b, to find better approximations for these bounds. Different cases are studied and numerical results are reported
AbstractThe (2,2)-step iterative methods related to an optimal Chebyshev method for solving a real a...
An optimal Chebyshev method for solving Ax = b, where all the eigenvalues of the real and non-symmet...
AbstractMany problems in science require the computation of only one singular vector or, more genera...
AbstractIn this paper we prove a sufficient condition for convergence of Chebyshev semi-iterative (S...
AbstractThe Chebyshev semiiterative method (chsim) is probably the best known and most often used me...
It is widely believed that Krylov subspace iterative methods are better than Chebyshev semi-iterativ...
The Chebyshev semiiterative method (chsim) is probably the best known and most often used method for...
It is widely believed that Krylov subspace iterative methods are better than Chebyshev semi-iterativ...
Abstract: For numerical solution of symmetric systems of linear equations with a positive-...
The (2, 2)-step iterative methods related to an optimal Chebyshev method for solving a real and nons...
The Chebyshev semiiterative method (CHSIM) is a powerful method for finding the iterative solution o...
this paper is as follows. In Section 2, we present some background material on general Krylov subspa...
"(This is being submitted in partial fulfillment of the requirements for the degree of Doctor of Phi...
AbstractThe approximate solutions in standard iteration methods for linear systems Ax=b, with A an n...
152 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1982.In 1975, T. A. Manteuffel dev...
AbstractThe (2,2)-step iterative methods related to an optimal Chebyshev method for solving a real a...
An optimal Chebyshev method for solving Ax = b, where all the eigenvalues of the real and non-symmet...
AbstractMany problems in science require the computation of only one singular vector or, more genera...
AbstractIn this paper we prove a sufficient condition for convergence of Chebyshev semi-iterative (S...
AbstractThe Chebyshev semiiterative method (chsim) is probably the best known and most often used me...
It is widely believed that Krylov subspace iterative methods are better than Chebyshev semi-iterativ...
The Chebyshev semiiterative method (chsim) is probably the best known and most often used method for...
It is widely believed that Krylov subspace iterative methods are better than Chebyshev semi-iterativ...
Abstract: For numerical solution of symmetric systems of linear equations with a positive-...
The (2, 2)-step iterative methods related to an optimal Chebyshev method for solving a real and nons...
The Chebyshev semiiterative method (CHSIM) is a powerful method for finding the iterative solution o...
this paper is as follows. In Section 2, we present some background material on general Krylov subspa...
"(This is being submitted in partial fulfillment of the requirements for the degree of Doctor of Phi...
AbstractThe approximate solutions in standard iteration methods for linear systems Ax=b, with A an n...
152 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1982.In 1975, T. A. Manteuffel dev...
AbstractThe (2,2)-step iterative methods related to an optimal Chebyshev method for solving a real a...
An optimal Chebyshev method for solving Ax = b, where all the eigenvalues of the real and non-symmet...
AbstractMany problems in science require the computation of only one singular vector or, more genera...