Reordering sparse matrices packs nonzeros into fewer diagonals, achieving average 5.5x reduction in diagonal count and up to 45.6x for some matrices in homomorphic encryption settings.
International Journal for Numerical Methods in Engineering 36(19):3351–3379
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Packing Entries to Diagonals for Homomorphic Sparse-Matrix Vector Multiplication
Reordering sparse matrices packs nonzeros into fewer diagonals, achieving average 5.5x reduction in diagonal count and up to 45.6x for some matrices in homomorphic encryption settings.