“…One way of reducing memory footprints of sparse matrices is their partitioning into blocks. Much has been written about block processing of sparse matrices, frequently in the context of memory-bounded character of sparse matrix-vector multiplication (SpMV) [3,4,5,6,7,8,9,10,13,16,17,18,19,24,25,27,28,30,29,31,32,33,34,35]. In this article, we address the problem of minimizing memory footprints of sparse matrices by their partitioning into uniformly-sized blocks.…”