Skip to Main content Skip to Navigation

On matrix symmetrization and sparse direct solvers

Abstract : We investigate algorithms for finding column permutations of sparse matrices in order to have large diagonal entries and to have many entries symmetrically positioned around the diagonal. The aim is to improve the memory and running time requirements of a certain class of sparse direct solvers. We propose efficient algorithms for this purpose by combining two existing approaches and demonstrate the effect of our findings in practice using a direct solver. In particular, we show improvements in a number of components of the running time of a sparse direct solver with respect to the state of the art on a diverse set of matrices.
Complete list of metadatas
Contributor : Equipe Roma <>
Submitted on : Friday, November 18, 2016 - 9:31:44 AM
Last modification on : Sunday, September 29, 2019 - 9:58:17 PM
Long-term archiving on: : Tuesday, March 21, 2017 - 7:36:27 AM


Files produced by the author(s)


  • HAL Id : hal-01398951, version 1


Raluca Portase, Bora Uçar. On matrix symmetrization and sparse direct solvers. [Research Report] RR-8977, Inria - Research Centre Grenoble – Rhône-Alpes. 2016. ⟨hal-01398951v1⟩



Record views


Files downloads