Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Davis, T.A.: Sparse matrix collection, University of Florida, Department of Computer and Information Science and Engineering, Gainesville, FL, USA, pp. 32611–36120 (2005),
http://www.cise.ufl.edu
2. Davis, T.A., Davidson, E.S.: Pairwise reduction for the direct parallel solution of sparse unsymmetric sets of linear equations. IEEE Trans. Comput. 37, 1648–1654 (1988)
3. Davis, T.A., Yew, P.-C.: A nondeterministic parallel algorithm for general unsymmetric sparse LU factorization. SIAM J. Matrix Anal. Appl. 3, 383–402 (1990)
4. Demmel, J.W., Eisenstat, S.C., Gilbert, J.R., Li, X.S., Liu, J.W.H.: A supernodal approach to sparse partial pivoting. SIAM Journal of Matrix Analysis and Applications 20, 720–755 (1999)
5. Demmel, J.W., Gilbert, J.R., Li, X.S.: An asynchronous parallel supernodal algorithm for sparse Gaussian elimination. SIAM Journal of Matrix Analysis and Applications 20, 915–952 (1999)