Multifrontal QR Factorization for Multicore Architectures over Runtime Systems, Euro-Par 2013 Parallel Processing, ser. LNCS, pp.521-532 ,
DOI : 10.1007/978-3-642-40047-6_53
URL : https://hal.archives-ouvertes.fr/hal-01220611
Diagonal Markowitz Scheme with Local Symmetrization, SIAM Journal on Matrix Analysis and Applications, vol.29, issue.1, pp.228-244, 2007. ,
DOI : 10.1137/050637315
Multifrontal parallel distributed symmetric and unsymmetric solvers Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication, Comput. Method. Appl. M. IEEE T. Parall. Distr, vol.184, issue.10 7, pp.4-501, 1999. ,
A fixed-parameter algorithm for the directed feedback vertex set problem, J. ACM, vol.55, issue.21, pp.1-2119, 2008. ,
A column approximate minimum degree ordering algorithm, ACM Transactions on Mathematical Software, vol.30, issue.3, pp.353-376, 2004. ,
DOI : 10.1145/1024074.1024079
The university of Florida sparse matrix collection, ACM Transactions on Mathematical Software, vol.38, issue.1, pp.1-125, 2011. ,
DOI : 10.1145/2049662.2049663
A Supernodal Approach to Sparse Partial Pivoting, SIAM Journal on Matrix Analysis and Applications, vol.20, issue.3, pp.720-755, 1999. ,
DOI : 10.1137/S0895479895291765
An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination, SIAM Journal on Matrix Analysis and Applications, vol.20, issue.4, pp.915-952, 1999. ,
DOI : 10.1137/S0895479897317685
Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine, SIAM Review, vol.26, issue.1, pp.91-112, 1984. ,
DOI : 10.1137/1026003
On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix, SIAM Journal on Matrix Analysis and Applications, vol.22, issue.4, pp.973-996, 1958. ,
DOI : 10.1137/S0895479899358443
Transition graphs and the star-height of regular events., The Michigan Mathematical Journal, vol.10, issue.4, pp.385-397, 1963. ,
DOI : 10.1307/mmj/1028998975
The Theory of Elimination Trees for Sparse Unsymmetric Matrices, SIAM Journal on Matrix Analysis and Applications, vol.26, issue.3, pp.686-705, 2005. ,
DOI : 10.1137/S089547980240563X
A tree-based dataflow model for the unsymmetric multifrontal method, Electronic Transactions on Numerical Analysis, vol.21, pp.1-19, 2005. ,
Nested Dissection of a Regular Finite Element Mesh, SIAM Journal on Numerical Analysis, vol.10, issue.2, pp.345-363, 1973. ,
DOI : 10.1137/0710032
Digraph complexity measures and applications in formal language theory, Discrete Mathematics & Theoretical Computer Science, vol.14, issue.2, pp.189-204, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00990597
Impact of reordering on the memory of a multifrontal solver, Parallel Computing, vol.29, issue.9, pp.1191-1218, 2003. ,
DOI : 10.1016/S0167-8191(03)00099-1
URL : https://hal.archives-ouvertes.fr/hal-00807378
Improved Symbolic and Numerical Factorization Algorithms for Unsymmetric Sparse Matrices, SIAM Journal on Matrix Analysis and Applications, vol.24, issue.2, pp.529-552, 2002. ,
DOI : 10.1137/S089547980139604X
Design of a Multicore Sparse Cholesky Factorization Using DAGs, SIAM Journal on Scientific Computing, vol.32, issue.6, pp.3627-3649, 2010. ,
DOI : 10.1137/090757216
A Data Structure for Parallel L/U Decomposition, IEEE Transactions on Computers, vol.31, issue.3, pp.231-239, 1982. ,
DOI : 10.1109/TC.1982.1675979
Reducibility among combinatorial problems, " in Complexity of Computer Computations, ser. The IBM Research Symposiax, pp.85-103, 1972. ,
A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices, 1998. ,
Constructing Elimination Trees for Sparse Unsymmetric Matrices, SIAM Journal on Matrix Analysis and Applications, vol.34, issue.2, pp.345-354, 2013. ,
DOI : 10.1137/110825443
URL : https://hal.archives-ouvertes.fr/inria-00567970
Approximation algorithms for directed width parameters, 1107. ,
A contraction algorithm for finding small cycle cutsets, Journal of Algorithms, vol.9, issue.4, pp.470-493, 1988. ,
DOI : 10.1016/0196-6774(88)90013-2
Making sparse gaussian elimination scalable by static pivoting, Proc. of the 1998 ACM/IEEE Conference on Supercomputing, ser. SC '98, pp.1-17, 1998. ,
A graph partitioning algorithm by node separators, ACM Transactions on Mathematical Software, vol.15, issue.3, pp.198-219, 1989. ,
DOI : 10.1145/66888.66890
Computational models and task scheduling for parallel sparse Cholesky factorization, Parallel Computing, vol.3, issue.4, pp.327-342, 1986. ,
DOI : 10.1016/0167-8191(86)90014-1
Tree-depth, subgraph coloring and homomorphism bounds, European Journal of Combinatorics, vol.27, issue.6, pp.1022-1041, 2006. ,
DOI : 10.1016/j.ejc.2005.01.010
A greedy randomized adaptive search procedure for the feedback vertex set problem, Journal of Combinatorial Optimization, vol.2, issue.4, pp.399-412, 1998. ,
DOI : 10.1023/A:1009736921890
The complexity of optimal elimination trees, " Pennsylvania State Univ, 1988. ,
Algorithmic Aspects of Vertex Elimination on Directed Graphs, SIAM Journal on Applied Mathematics, vol.34, issue.1, pp.176-197, 1978. ,
DOI : 10.1137/0134014
A New Implementation of Sparse Gaussian Elimination, ACM Transactions on Mathematical Software, vol.8, issue.3, pp.256-276, 1982. ,
DOI : 10.1145/356004.356006
A Computation Model of Parallel Solution of Linear Equations, IEEE Transactions on Computers, vol.29, issue.7, pp.632-638, 1980. ,
DOI : 10.1109/TC.1980.1675634
DSC: scheduling parallel tasks on an unbounded number of processors, IEEE Transactions on Parallel and Distributed Systems, vol.5, issue.9, pp.951-967, 1994. ,
DOI : 10.1109/71.308533