Dynamic Allocation of Ragged Arrays Using C++: Potentiality for Finite-Element Method Software

Abstract

is an irregularly shaped data structure that is an extremely convenient and natural means of implementing storage schemes that exploit the symmetry and sparsity of the different stiffness matrices involved in the finite-element method. Ragged arrays have the potential for improving the programmer’s productivity as well as enhancing code maintainability. Additionally, no performance degradation was detected when ragged arrays were used; the performance of the Gauss elimination procedure, implemented in C++ using ragged arrays, was comparable to the performance of the same procedure implemented in FORTRAN using traditional data structures.