I. S. Duff, A. M. Erisman, and J. K. Reid, Direct methods for sparse matrices, 1986.

A. George, M. T. Heath, J. W. Liu, and E. G. Ng, Sparse Cholesky Factorization on a Local-Memory Multiprocessor, SIAM Journal on Scientific and Statistical Computing, vol.9, issue.2, pp.327-340, 1988.
DOI : 10.1137/0909021

A. George and J. W. Liu, Computer solution of large sparse positive definite systems, 1981.

P. Hénon, P. Ramet, and J. Roman, PaStiX: A Parallel Sparse Direct Solver Based on a Static Scheduling for Mixed 1D/2D Block Distributions, Irregular'2000, ser. LNCS, pp.519-525, 2000.
DOI : 10.1007/3-540-45591-4_70

M. Faverge and P. Ramet, Dynamic scheduling for sparse direct solver on NUMA architectures, Proceedings of PARA'2008, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00344026

C. D. Yu, W. Wang, and D. Pierce, A CPU???GPU hybrid approach for the unsymmetric multifrontal method, Parallel Computing, vol.37, issue.12, pp.759-770, 2011.
DOI : 10.1016/j.parco.2011.09.002

T. Davis, Multifrontal sparse qr factorization : Multicore, and gpu work in progress, 15th SIAM Conference on Parallel Processing for Scientific Computing, 2012.

G. Bosilca, A. Bouteiller, A. Danalis, T. Hérault, P. Lemarinier et al., DAGuE: A generic distributed DAG engine for High Performance Computing, Parallel Computing, vol.38, issue.1-2, pp.37-51, 2012.
DOI : 10.1016/j.parco.2011.10.003

G. Bosilca, A. Bouteiller, A. Danalis, M. Faverge, A. Haidar et al., Flexible Development of Dense Linear Algebra Algorithms on Massively Parallel Architectures with DPLASMA, 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum, 2011.
DOI : 10.1109/IPDPS.2011.299

C. Augonnet, S. Thibault, R. Namyst, and P. Wacrenier, StarPU: a unified platform for task scheduling on heterogeneous multicore architectures, Concurrency and Computation: Practice and Experience, vol.23, issue.4, 2010.
DOI : 10.1002/cpe.1631
URL : https://hal.archives-ouvertes.fr/inria-00384363

P. Hénon, P. Ramet, and J. Roman, On Using an Hybrid MPI-Thread Programming for the Implementation of a Parallel Sparse Direct Solver on a Network of SMP Nodes, PPAM'05, ser. LNCS, pp.1050-1057, 2005.
DOI : 10.1007/11752578_127

V. Volkov and J. W. , Benchmarking GPUs to tune dense linear algebra, 2008 SC, International Conference for High Performance Computing, Networking, Storage and Analysis, 2008.
DOI : 10.1109/SC.2008.5214359
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.3436

P. Hénon, P. Ramet, and J. Roman, On finding approximate supernodes for an efficient block-ILU(k) factorization, Parallel Computing, vol.34, issue.6-8, pp.345-362, 2008.
DOI : 10.1016/j.parco.2007.12.003

J. Kurzak, S. Tomov, and J. Dongarra, Autotuning GEMM Kernels for the Fermi GPU, IEEE Transactions on Parallel and Distributed Systems, vol.23, issue.11, 2011.
DOI : 10.1109/TPDS.2011.311

A. Pothen and C. Sun, A Mapping Algorithm for Parallel Sparse Cholesky Factorization, SIAM Journal on Scientific Computing, vol.14, issue.5, pp.1253-1257, 1993.
DOI : 10.1137/0914074