Adaptive-blocking hierarchical storage format for sparse matrices
Hierarchical storage formats (HSFs) can significantly reduce the space complexity of sparse matrices. They vary in storage schemes that they use for blocks and for block matrices. However, the current HSFs prescribe a fixed storage scheme for all blocks, which is not always space-optimal. We show that, generally, different storage schemes are space-optimal for different blocks. We further propose a new HSF that is based on this approach and compare its space complexity with current HSFs for benchmark matrices arising from different application areas. © 2012 Polish Info Processing Socit.
Publication Source (Journal or Book title)
2012 Federated Conference on Computer Science and Information Systems, FedCSIS 2012
Langr, D., Simecek, I., Tvrdik, P., Dytrych, T., & Draayer, J. (2012). Adaptive-blocking hierarchical storage format for sparse matrices. 2012 Federated Conference on Computer Science and Information Systems, FedCSIS 2012, 545-551. Retrieved from https://digitalcommons.lsu.edu/physics_astronomy_pubs/1737