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

sparse matrix computation,quad-tree


Sparse computations are used in the wide range of science projects. But suitable formats for storing sparse matrices are still under development, because widely-used formats (like XY or CSR) are slow and specialized formats have a large transformation overhead. In this paper, we compare performance during the execution of some basic routines from LA using widely-used formats and the quad-tree data structure.


final version (in .PDF format)

BibTex entry:
author = {{\v S}ime{\v c}ek, I.},
title = {{Sparse Matrix Computations with Quadtrees}},
booktitle = {{Seminar on Numerical Analysis}},
publisher = {Technical University},
address = {Liberec},
year = {2008},
pages = {122--124},
ISBN = {978-80-7372-298-2},
language = {English}