Direct Methods for Linear System on Distributed Memory Parallel Computers

  • Nishimura, S. (Department of Information and Computer Sciences, Saitama University) ;
  • Shigehara, T. (Department of Information and Computer Sciences, Saitama University) ;
  • Mizoguchi, H. (Department of Information and Computer Sciences, Saitama University) ;
  • Mishima, T. (Department of Information and Computer Sciences, Saitama University) ;
  • Kobayashi, H. (Department of Mathematics, College of Science and Technology, Nihon University)
  • Published : 2000.07.01

Abstract

We discuss the direct methods (Gauss-Jordan and Gaussian eliminations) to solve linear systems on distributed memory parallel computers. It will be shown that the so-called row-cyclic storage gives rise to the best performance among the standard three (row-cyclic, column-cyclic and cyclic-cyclic) data storages. We also show that Gauss-Jordan elimination, rather than Gaussian elimination, is highly efficient for the direct solution of linear systems in parallel processing, though Gauss-Jordan elimination requires a larger number of arithmetic operations than Gaussian elimination. Numerical experiment is performed on HITACHI SR12201 with the standard libraries MPI and BLAS.

Keywords