Reorderings of Sparse Matrices for Parallel Cholesky Factorization
博士 === 國立臺灣大學 === 資訊工程研究所 === 82 === Reordering of sparse matrices is essential for good performance on Cholesky factorizations. A good reordering algorithm not only is crucial on a sequential computer, but also can lead to a much better load balance on...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1994
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/77885572674042400930 |