A unified set of resequencing algorithms
暂无分享,去创建一个
[1] E. Cuthill,et al. Reducing the bandwidth of sparse symmetric matrices , 1969, ACM '69.
[2] Ian P. King,et al. An automatic reordering scheme for simultaneous equations derived from network systems , 1970 .
[3] William F. Smyth,et al. An Improved Method for Reducing the Bandwidth of Sparse Symmetric Matrices , 1971, IFIP Congress.
[4] Norman E. Gibbs,et al. Algorithm 508: Matrix Bandwidth and Profile Reduction [F1] , 1976, TOMS.
[5] Norman E. Gibbs,et al. A Comparison of Several Bandwidth and Profile Reduction Algorithms , 1976, TOMS.
[6] William G. Poole,et al. An algorithm for reducing the bandwidth and profile of a sparse matrix , 1976 .
[7] Norman E. Gibbs,et al. Algorithm 509: A Hybrid Profile Reduction Algorithm [F1] , 1976, TOMS.
[8] Gordon C. Everstine,et al. A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront , 1979 .
[9] Alan George,et al. An Implementation of a Pseudoperipheral Node Finder , 1979, TOMS.
[10] John G. Lewis. Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms , 1982, TOMS.
[11] J. Pasciak,et al. Computer solution of large sparse positive definite systems , 1982 .
[12] John G. Lewis. Algorithm 582: The Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms for Reordering Sparse Matrices , 1982, TOMS.
[13] B. Armstrong,et al. A hybrid algorithm for reducing matrix bandwidth , 1984 .
[14] B. Armstrong. Near-minimal matrix profiles and wavefronts for testing nodal resequencing algorithms , 1985 .
[15] S. Sloan. An algorithm for profile and wavefront reduction of sparse matrices , 1986 .
[16] S. Sloan,et al. A DIRECT COMPARISON OF THREE ALGORITHMS FOR REDUCING PROFILE AND WAVEFRONT , 1989 .
[17] Scott W. Sloan,et al. A FORTRAN program for profile and wavefront reduction , 1989 .
[18] David Murray,et al. An alternative pseudoperipheral node finder for resequencing schemes , 1993 .