A hypergraph partitioning model for profile minimization, SIAM Journal on Scientific Computing, vol.41, issue.1, pp.83-108, 2019. ,
An approximate minimum degree ordering algorithm, SIAM Journal on Matrix Analysis and Applications, vol.17, issue.4, pp.886-905, 1996. ,
A fully asynchronous multifrontal solver using distributed dynamic scheduling, SIAM Journal on Matrix Analysis and Applications, vol.23, issue.1, pp.15-41, 2001. ,
URL : https://hal.archives-ouvertes.fr/hal-00808293
Analysis and comparison of two general sparse solvers for distributed memory computers, ACM Transactions on Mathematical Software, vol.27, issue.4, pp.388-421, 2001. ,
URL : https://hal.archives-ouvertes.fr/hal-00856654
Hybrid scheduling for the parallel solution of linear systems, Parallel Computing, vol.32, issue.2, pp.136-156, 2006. ,
URL : https://hal.archives-ouvertes.fr/inria-00070599
Solving sparse linear systems with sparse backward error, SIAM Journal on Matrix Analysis and Applications, vol.10, issue.2, pp.165-190, 1989. ,
Neighborhood hypergraphs of bipartite graphs, Journal of Graph Theory, vol.58, issue.1, pp.69-95, 2008. ,
Assignment Problems, 2009. ,
A correction to Colbourn's paper on the complexity of matrix symmetrizability, Information Processing Letters, vol.11, pp.96-97, 1980. ,
Introduction to Algorithms, 2009. ,
The University of Florida sparse matrix collection, ACM Trans. Math. Softw, vol.38, issue.1, 2011. ,
The design and use of algorithms for permuting large entries to the diagonal of sparse matrices, SIAM Journal on Matrix Analysis and Applications, vol.20, issue.4, pp.889-901, 1999. ,
On algorithms for permuting large entries to the diagonal of a sparse matrix, SIAM Journal on Matrix Analysis and Applications, vol.22, pp.973-996, 2001. ,
, Direct Methods for Sparse Matrices, 2017.
An efficient cost scaling algorithm for the assignment problem, Mathematical Programming, vol.71, issue.2, pp.153-177, 1995. ,
A collection of Fortran codes for large-scale scientific computation, 2016. ,
MeTiS: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices, 1998. ,
Combinatorial Optimization: Networks and Matroids, (unabridged reprint of Combinatorial Optimization: Networks and Matroids, originally published by, 1976. ,
Making sparse Gaussian elimination scalable by static pivoting, Proceedings of the 1998 ACM/IEEE Conference on Supercomputing, pp.1-17, 1998. ,
A new pivoting strategy for Gaussian elimination, Linear Algebra and Its Applications, vol.240, pp.131-151, 1996. ,
SCOTCH 5.1 User's Guide. Laboratoire Bordelais de Recherche en Informatique (LaBRI), 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-00410327
Heuristics for a matrix symmetrization problem, Proceedings of Parallel Processing and Applied Mathematics (PPAM'07), vol.4967, pp.718-727, 2008. ,