P(論文)It is well known that if the coefficient matrix is a generalized diagonally dominant matrix, then the Jacobi and the Gauss-Seidel methods converge. We know in our experiments that the number of iteration of these iterative methods is inveresely proportional to the degree of diagonal dominance of the coefficient matrix. In this paper, our is to present the definition of the diagonally dominant ratio as the degree of the convergence rate, and we define the diagonal dominator to improve the diagonally dominant ratio.departmental bulletin pape
AbstractThe MAOR method as a generalization of the well-known MSOR method was introduced by Hadjidim...
AbstractIn 1991 A. D. Gunawardena et al. reported that the convergence rate of the Gauss-Seidel meth...
AbstractIn 1997, Kohno et al. [Toshiyuki Kohno, Hisashi Kotakemori, Hiroshi Niki, Improving the modi...
It is well known that if the coefficient matrix is a generalized diagonally dominant matrix, then th...
Abstract. We present a new unified proof for the convergence of both the Jacobi and the Gauss–Seidel...
Analysis of real life problems often results in linear systems of equations for which solutions are ...
Cover title.Includes bibliographical references.Partially supported by the U.S. Army Research Office...
It is well known that as a famous type of iterative methods in numerical linear algebra, Gauss-Seide...
AbstractWe introduce two diagonal preconditioners, one of them is a scaling of the matrix. They are ...
AbstractIn this paper, we obtain a practical sufficient condition for convergence of the Gauss-Seide...
A quadratically convergent parallel Jacobi-process for diagonal dominant matrices with nondistinct e...
AbstractIn this paper, we give sufficient conditions for the convergence of the (AOR) method, when t...
Recently, some convergent results of the generalized AOR iterative (GAOR) method for solving linear ...
AbstractIn this paper, some improvements on Darvishi and Hessari [On convergence of the generalized ...
AbstractWhen convergent Jacobi or Gauss-Seidel iterations can be applied to solve systems of linear ...
AbstractThe MAOR method as a generalization of the well-known MSOR method was introduced by Hadjidim...
AbstractIn 1991 A. D. Gunawardena et al. reported that the convergence rate of the Gauss-Seidel meth...
AbstractIn 1997, Kohno et al. [Toshiyuki Kohno, Hisashi Kotakemori, Hiroshi Niki, Improving the modi...
It is well known that if the coefficient matrix is a generalized diagonally dominant matrix, then th...
Abstract. We present a new unified proof for the convergence of both the Jacobi and the Gauss–Seidel...
Analysis of real life problems often results in linear systems of equations for which solutions are ...
Cover title.Includes bibliographical references.Partially supported by the U.S. Army Research Office...
It is well known that as a famous type of iterative methods in numerical linear algebra, Gauss-Seide...
AbstractWe introduce two diagonal preconditioners, one of them is a scaling of the matrix. They are ...
AbstractIn this paper, we obtain a practical sufficient condition for convergence of the Gauss-Seide...
A quadratically convergent parallel Jacobi-process for diagonal dominant matrices with nondistinct e...
AbstractIn this paper, we give sufficient conditions for the convergence of the (AOR) method, when t...
Recently, some convergent results of the generalized AOR iterative (GAOR) method for solving linear ...
AbstractIn this paper, some improvements on Darvishi and Hessari [On convergence of the generalized ...
AbstractWhen convergent Jacobi or Gauss-Seidel iterations can be applied to solve systems of linear ...
AbstractThe MAOR method as a generalization of the well-known MSOR method was introduced by Hadjidim...
AbstractIn 1991 A. D. Gunawardena et al. reported that the convergence rate of the Gauss-Seidel meth...
AbstractIn 1997, Kohno et al. [Toshiyuki Kohno, Hisashi Kotakemori, Hiroshi Niki, Improving the modi...