An algorithm for improving the profile of a sparse symmetric matrix is introduced. Tests on normal equation matrices encountered in adjustments of geodetic networks by least squares demonstrate that the algorithm produces significantly lower profiles than the widely used reverse Cuthill-McKee algorithm.
KeywordsGeodetic Network Starting Vertex National Geodetic Survey Total Waiting Time Matrix Bandwidth
Unable to display preview. Download preview PDF.
- F.A. AKYUZ and S. UTKU, An automatic relabeling scheme for bandwidth minimization of stiffness matrices.Journal of the American Institute of Aeronautics and Astronautics, 6, 728–730. 1968.Google Scholar
- I. ARANY, W.F. SMYTH, and L. SZODA, An improved method for reducing the bandwidth of sparse symmetric matrices.Proceedings of International Federation for Information Proceessing, 1246–1250, 1971.Google Scholar
- E. CUTHILL and J. McKEE, Reducing the bandwidth of sparse symmetric matrices.Proceedings of Association for Computing Machinery, 24th National Conference, August 26–28, 157–172, 1969.Google Scholar
- E. CUTHILL, Several Stranegies for Reducing the Bandwidth of Matrices. Naval Ship Research and Development Center, Bethesda, Maryland.Technical Note CMD-42-71, 19 pp. 1971.Google Scholar
- A. GEORGE, Computer Implementation of the Finite Element Method. Computer Science Department, Stanford University, Stanford, California.Report No. STAN-CS-71-208, 1971.Google Scholar
- H.R. GROOMS, Algorithm for matrix bandwidth reduction.American Society of Civil Engineers, Structural Division Journal, 98, 203–214 1972.Google Scholar
- A. JENNINGS, A compact storage scheme for the solution of symmetric linear simultaneous equations.The Computer Journal, 9, No. 3, 281–285, 1967.Google Scholar
- R. ROSEN, Matrix bandwidth minimization.Proceedings of Association for Computing Machinery, 23 rd National Conference, August 27–29, 535–595, 1968.Google Scholar