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 metadata

Cited literature [22 references]  Display  Hide  Download
Contributor : Equipe Roma Connect in order to contact the contributor
Submitted on : Thursday, August 1, 2019 - 10:33:17 AM
Last modification on : Friday, September 30, 2022 - 4:12:22 AM
Long-term archiving on: : Wednesday, January 8, 2020 - 3:26:02 PM


Files produced by the author(s)


  • HAL Id : hal-01398951, version 4



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



Record views


Files downloads