Many of the elements of sparse matrices have zero value. Known examples of these types of matrices are lower and upper triangular, which arise frequently in the solution of linear equation systems. Because many of the elements of these matrices are zero, it is advisable to store them - whether on disk or in memory- in a way that saves space. In this paper sparse matrices called central triangular are analyzed and mechanisms for their efficient storage by means of 1D arrays are proposed.