Communication results for parallel sparse Cholesky factorization on a hypercube
暂无分享,去创建一个
[1] Michael T. Heath,et al. Sparse Cholesky factorization on a local-memory multiprocessor , 1988 .
[2] Joseph W. H. Liu,et al. Computational models and task scheduling for parallel sparse Cholesky factorization , 1986, Parallel Comput..
[3] John K. Reid,et al. The Multifrontal Solution of Indefinite Sparse Symmetric Linear , 1983, TOMS.
[4] A. H. Sherman,et al. Applications of an Element Model for Gaussian Elimination , 1976 .
[5] A. George. An automatic one-way dissection algorithm for irregular finite element problems , 1978 .
[6] Joseph W. H. Liu,et al. A Linear Reordering Algorithm for Parallel Pivoting of Chordal Graphs , 1989, SIAM J. Discret. Math..
[7] Joseph W. H. Liu,et al. Reordering sparse matrices for parallel elimination , 1989, Parallel Comput..
[8] Y. Saad,et al. Communication complexity of the Gaussian elimination algorithm on multiprocessors , 1986 .
[9] Joseph W. Liu,et al. A compact row storage scheme for Cholesky factors using elimination trees , 1986, TOMS.
[10] J. Pasciak,et al. Computer solution of large sparse positive definite systems , 1982 .
[11] Joseph W. H. Liu,et al. Modification of the minimum-degree algorithm by multiple elimination , 1985, TOMS.
[12] Robert Schreiber,et al. A New Implementation of Sparse Gaussian Elimination , 1982, TOMS.