Sparse Matrix Computations Using the Quadtree Storage Format
Author: Ivan Šimeček

Sparse matrix; quadtree; numerical linear algebra.


Computations with sparse matrices are widespread in scientific projects. Used data format affects strongly the performance. Efficient formats for storing sparse matrices are still under development, since the computation using widely-used formats (like XY or CSR) is slow and specialized formats (like SPARSITY or CARB) have a large transformation overhead. In this paper, we represent some improvements to the quadtree storage format. We also compare the performance during the execution of some basic routines from the linear algebra using widely-used formats and the quadtree storage format.


BibTex entry:
author ="{{\v S}ime{\v c}ek, I.",
title ="Sparse Matrix Computations Using the Quadtree Storage Format",
booktitle = {Proceedings of 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2009)},
publisher = {IEEE Computer Society},
address = {Los Alamitos},
year = {2010},
pages = {168--173},
ISBN = {978-0-7695-3964-5},
doi = {10.1109/SYNASC.2009.55},
url = {http://dx.doi.org/10.1109/SYNASC.2009.55},
language = {English}