How Generous is the ELLPACK Sparse Matrix Storage Scheme for Finite Element Computations


9th International Conference on Electronics Computer and Computation (ICECCO 2012), Ankara, Turkey, 1 - 03 November 2012, pp.146-149 identifier

  • Publication Type: Conference Paper / Full Text
  • City: Ankara
  • Country: Turkey
  • Page Numbers: pp.146-149


Sparse matrices are occasionally encountered during solutions of various problems by means of numerical methods, such as the finite element method. ELLPACK sparse matrix storage scheme, one of the most widely used methods due to its implementation ease, is investigated in this study. The scheme uses excessive memory due to its definition. For the conventional finite element method, where the node elements are used, the excessive memory caused by redundant entries in the ELLPACK sparse matrix storage scheme becomes negligible for large scale problems. On the other hand, our analyses show that the redundancy is still considerable for the occasions where facet or edge elements have to be used.