AbstractIn this paper, we propose a new preconditioner for solving linear systems by the preconditioned conjugate gradient (PCG) method. The preconditioner can be thought of as a generalization of the well-known T. Chan’s preconditioner. For Hermitian positive definite matrix, we observe that our preconditioner is also Hermitian positive definite. The operation cost and convergence of the PCG method are discussed. Numerical experiments have been performed on structured problems to show the competitiveness of this preconditioner
AbstractIn this paper we present some comparison theorems between two different modified Gauss–Seide...
AbstractA matrix is said to be stable if the real parts of all the eigenvalues are negative. In this...
AbstractThe preconditioned conjugate gradient method is used to solve n-by-n Hermitian Toeplitz syst...
AbstractIn this paper, we propose a new preconditioner for solving linear systems by the preconditio...
AbstractWe present a modified T. Chan’s preconditioner for solving Toeplitz linear systems by the pr...
AbstractFor any given n-by-n matrix An, T. Chan’s circulant preconditioner cF(An) proposed by T. Cha...
AbstractThe preconditioned conjugate gradient method is used to solve n-by-n Hermitian Toeplitz syst...
AbstractWe present a modified T. Chan’s preconditioner for solving Toeplitz linear systems by the pr...
138 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1988.The solution of a linear syst...
Iterative methods for solving large-scale linear systems have been gaining popularity in many areas ...
AbstractLinear systems with M-matrices often occur in a wide variety of areas including scientific c...
This paper is concerned with the solution of systems of linear equations ANχ
This paper is concerned with the solution of systems of linear equations ANχ
This paper is concerned with the solution of systems of linear equations ANχ
AbstractThe theory and the practice of optimal preconditioning in solving a linear system by iterati...
AbstractIn this paper we present some comparison theorems between two different modified Gauss–Seide...
AbstractA matrix is said to be stable if the real parts of all the eigenvalues are negative. In this...
AbstractThe preconditioned conjugate gradient method is used to solve n-by-n Hermitian Toeplitz syst...
AbstractIn this paper, we propose a new preconditioner for solving linear systems by the preconditio...
AbstractWe present a modified T. Chan’s preconditioner for solving Toeplitz linear systems by the pr...
AbstractFor any given n-by-n matrix An, T. Chan’s circulant preconditioner cF(An) proposed by T. Cha...
AbstractThe preconditioned conjugate gradient method is used to solve n-by-n Hermitian Toeplitz syst...
AbstractWe present a modified T. Chan’s preconditioner for solving Toeplitz linear systems by the pr...
138 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1988.The solution of a linear syst...
Iterative methods for solving large-scale linear systems have been gaining popularity in many areas ...
AbstractLinear systems with M-matrices often occur in a wide variety of areas including scientific c...
This paper is concerned with the solution of systems of linear equations ANχ
This paper is concerned with the solution of systems of linear equations ANχ
This paper is concerned with the solution of systems of linear equations ANχ
AbstractThe theory and the practice of optimal preconditioning in solving a linear system by iterati...
AbstractIn this paper we present some comparison theorems between two different modified Gauss–Seide...
AbstractA matrix is said to be stable if the real parts of all the eigenvalues are negative. In this...
AbstractThe preconditioned conjugate gradient method is used to solve n-by-n Hermitian Toeplitz syst...