,
ČVUT
WORKSHOP'2008
Sparse Matrix Computations with Quadtrees
Author: Ivan Šimeček
Keywords
sparse matrix computation, quad-tree.
Abstract
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, see [2]) are slow and specialized formats have a large transformation overhead (for
example see [1]).
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.
Download:
final version (in .PDF
format)
BibTex entry:
@inproceedings{JA_WOR_08_QUAD,
author = {{\v S}ime{\v c}ek, I.},
title = {{Sparse Matrix Computations with Quadtrees}},
booktitle = {{Proceedings of Workshop 2008}},
publisher = {CTU},
address = {Prague},
year = {2008},
volume = {1},
pages = {--},
ISBN = {978-80-01-04016-4},
language = {English}
}
