Sparse Matrix Computations Using the Quadtree Storage Format

  • Authors:

  • Ivan Simecek

  • Affiliations:

  • -

  • Venue:
  • SYNASC '09 Proceedings of the 2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.