An extended GS method for dense linear systems

  • Authors:

  • Hiroshi Niki;Toshiyuki Kohno;Kuniyoshi Abe

  • Affiliations:

  • Faculty of Informatics, Okayama University of Science, Japan;Faculty of Informatics, Okayama University of Science, Japan;Faculty of Economics and Information, Gifu Shotoku University, Japan

  • Venue:
  • Journal of Computational and Applied Mathematics
  • Year:
  • 2009

Quantified Score

Hi-index 7.29

Visualization

Abstract

Davey and Rosindale [K. Davey, I. Rosindale, An iterative solution scheme for systems of boundary element equations, Internat. J. Numer. Methods Engrg. 37 (1994) 1399-1411] derived the GSOR method, which uses an upper triangular matrix @W in order to solve dense linear systems. By applying functional analysis, the authors presented an expression for the optimum @W. Moreover, Davey and Bounds [K. Davey, S. Bounds, A generalized SOR method for dense linear systems of boundary element equations, SIAM J. Comput. 19 (1998) 953-967] also introduced further interesting results. In this note, we employ a matrix analysis approach to investigate these schemes, and derive theorems that compare these schemes with existing preconditioners for dense linear systems. We show that the convergence rate of the Gauss-Seidel method with preconditioner P"G is superior to that of the GSOR method. Moreover, we define some splittings associated with the iterative schemes. Some numerical examples are reported to confirm the theoretical analysis. We show that the EGS method with preconditioner P"G(@c"o"p"t) produces an extremely small spectral radius in comparison with the other schemes considered.