[1] G. G. Alway D. W. Martin: An algorithm for reducing the bandwidth of the matrix of symmetric configuration. Computer J. 8 (1965-66), 264-272.
[4] E. Cuthill J. McKee: Reducing the bandwidth of sparse symmetric matrices. 1969 Summer National ACM Meeting Proceedings.
[5] F. G. Gustavson W. M. Liniger R. A. Willoughby: Symbolic generation of an optimal Crout algorithm for sparse systems of linear equations. Proc. of the Symposium on Sparse Matr. and Their Appl., IBM Watson Res. Center, 1968.
[8] D. J. Rose: Symmetric elimination on sparse positive definite systems and the potential flow network problem. PhD thesis, Harvard University, Cambridge, Mass., 1970.
[9] R. Rosen: Matrix bandwidth minimization. ACM National Conference Proc., Las Vegas, Nevada, 1968.
[10] J. Segethová: Elimination for sparse symmetric systems of a special structure. Tech. Rep. 70-121, Соmр. Sci. Center, University of Maryland, 1970.
[11] W. R. Spillers N. Hickerson:
Optimal elimination for sparse symmetric systems as a graph problem. Quart. Appl. Math. 26 (1968), 425-432.
DOI 10.1090/qam/233497 |
MR 0233497
[12] R. P. Tewarson: The Gaussian elimination and sparse systems. Proc. of the Symposium on Sparse Matr. and Their Appl., IBM Watson Res. Center, 1968.