Sparse Matrix Computations with Quadtrees
Author: Ivan Šimeček

sparse matrix computation,quad-tree


Computations with sparse matrices are used in the wide range of science projects. But suitable formats for storing sparse matrices are still under development, because the computation using widely-used formats (like XY or CSR) are slow and specialized and efficient formats (like 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.


final version (in .PDF format)

BibTex entry:
author = {{\v S}ime{\v c}ek, I.},
title = {Sparse Matrix Computations using the Quadtree Storage Format},
booktitle = {4th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science},
year = {2008},
pages = {232--239},
address = {Brno},
publisher = {Ing. Zdenek Novotny, CSc.},
isbn = {978-80-7355-082-0},
language = {English}