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.