Treatment of Block-Based Sparse Matrices in Domain Decomposition Method

  • Abul Mukid Mohammad Mukaddes
  • Masao Ogino
  • Ryuji Shioya
  • Hiroshi Kanayama

Abstract

Abstract— The domain decomposition method involves the finite element solution of problems in the parallel computer. The finite element discretization leads to the solution of large systems of linear equation whose matrix is naturally sparse. The use of proper storing techniques for sparse matrix is fundamental especially when dealing with large scale problems typical of industrial applications. The aim of this research is to review the sparsity pattern of the matrices originating from the discretization of the elasto-plastic and thermal-convection problems. Some practical strategies dealing with sparsity pattern in the finite element code of adventure system are recalled. Several efficient storage schemes to store the matrix originating from elasto-plastic and thermal-convection problems have been proposed. In the proposed technique, inherent block pattern of the matrix is exploited to locate the matrix element. The computation in the high performance computer shows better performance compared to the conventional skyline storage method used by the most of the researchers.

Published
Mar 30, 2017
How to Cite
MUKADDES, Abul Mukid Mohammad et al. Treatment of Block-Based Sparse Matrices in Domain Decomposition Method. International Journal of System Modeling and Simulation (ISSN Online: 2518-0959), [S.l.], v. 2, n. 1, p. 1-6, mar. 2017. ISSN 2518-0959. Available at: <http://researchplusjournals.com/index.php/IJSMS/article/view/261>. Date accessed: 22 aug. 2017. doi: http://dx.doi.org/10.24178/ijsms.2017.2.1.01.