It is frequently necessary to manipulate large sparse matrices by means of a computer. In such cases a lot of CPU time and memory space can be saved if only the non-zero elements are stored. This paper surveys seven different “compact” representations of sparse matrices. The selected implementations will be compared with regard to the running time and the storage requirement.
Data structures for compact sparse matrices representation
DI FELICE P;CLEMENTINI, ELISEO
1989-01-01
Abstract
It is frequently necessary to manipulate large sparse matrices by means of a computer. In such cases a lot of CPU time and memory space can be saved if only the non-zero elements are stored. This paper surveys seven different “compact” representations of sparse matrices. The selected implementations will be compared with regard to the running time and the storage requirement.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
