A Scalable Sparse Direct Solver Using Static Pivoting
暂无分享,去创建一个
[1] Anoop Gupta,et al. An efficient block-oriented approach to parallel sparse Cholesky factorization , 1993, Supercomputing '93. Proceedings.
[2] Vipin Kumar,et al. Optimally Scalable Parallel Sparse Cholesky Factorization , 1995, PPSC.
[3] Iain S. Duff,et al. The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices , 1999, SIAM J. Matrix Anal. Appl..
[4] I. Duff,et al. The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices , 1999, SIAM J. Matrix Anal. Appl..
[5] Xiaoye Sherry Li,et al. Sparse Gaussian Elimination on High Performance Computers , 1996 .
[6] James Demmel,et al. An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination , 1997, SIAM J. Matrix Anal. Appl..
[7] Joseph W. H. Liu,et al. Elimination Structures for Unsymmetric Sparse $LU$ Factors , 1993, SIAM J. Matrix Anal. Appl..
[8] Kevin Barraclough,et al. I and i , 2001, BMJ : British Medical Journal.
[9] James Demmel,et al. A Supernodal Approach to Sparse Partial Pivoting , 1999, SIAM J. Matrix Anal. Appl..