Users' guide for the Harwell-Boeing sparse matrix collection (Release 1)
暂无分享,去创建一个
[1] J. Reid. Large Sparse Sets of Linear Equations , 1973 .
[2] I. Duff,et al. A Comparison of Sparsity Orderings for Obtaining a Pivotal Sequence in Gaussian Elimination , 1974 .
[3] J. G. Lewis. Algorithms for sparse matrix eigenvalue problems , 1977 .
[4] P. Saylor. Richardson's Iteration With Dynamic Parameters and the SIP Incomplete Factorization for the Solution of Linear Systems of Equations , 1981 .
[5] P. Dixon. ORANI, a multisectoral model of the Australian economy , 1982 .
[6] John G. Lewis. Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms , 1982, TOMS.
[7] John G. Lewis,et al. Sparse matrix test problems , 1982, SGNM.
[8] H. Simon. The Lanczos algorithm with partial reorthogonalization , 1984 .
[9] B. Armstrong. Near-minimal matrix profiles and wavefronts for testing nodal resequencing algorithms , 1985 .
[10] Joseph W. H. Liu,et al. Modification of the minimum-degree algorithm by multiple elimination , 1985, TOMS.
[11] L Marro. A linear time implementation of profile reduction algorithms for sparse matrices , 1986 .
[12] Joseph W. H. Liu,et al. On the storage requirement in the out-of-core multifrontal method for sparse factorization , 1986, TOMS.
[13] I. Duff,et al. Direct Methods for Sparse Matrices , 1987 .
[14] William G. Poole,et al. Evaluation of orderings for unsymmetric sparse matrics , 1987 .