<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05169773</id>
  <dt>j</dt>
  <an>05169773</an>
  <augroup>
    <au>Tavakoli, Rohallah</au>
    <au>Davami, Parviz</au>
  </augroup>
  <ti>A new parallel Gauss-Seidel method based on alternating group explicit method and domain decomposition method.</ti>
  <so>Appl. Math. Comput. 188, No. 1, 713-719 (2007).</so>
  <py>2007</py>
  <pu>Elsevier Science Publishing Co. (North-Holland), New York</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>alternating group explicit</ut>
    <ut>convergence</ut>
    <ut>domain decomposition</ut>
    <ut>finite difference</ut>
    <ut>Gauss-Seidel method</ut>
    <ut>iterative method</ut>
    <ut>parallel algorithm</ut>
    <ut>successive over-relaxation</ut>
    <ut>numerical results</ut>
    <ut>one-dimensional Poisson equation</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1016/j.amc.2006.10.023</li>
  </ligroup>
  <abgroup>
    <ab>Summary: A new parallel Gauss-Seidel method is presented for solution of system of linear equations related to finite difference discretization of partial differential equations. This method is based on domain decomposition method and local coupling between interfaces of neighbor sub-domains, same as alternating group explicit method. This method is convergent and number of iterations for achieving convergence criteria is near the original Gauss-Seidel method (sometimes better and sometimes worse but difference is very small). The convergence theory is discussed in details. Numerical results are given to justify the convergence and performance of the proposed iterative method.</ab>
    <rv></rv>
  </abgroup>
</item>