Advertisement

Bulletin géodésique

, Volume 50, Issue 4, pp 341–352 | Cite as

Reducing the profile of sparse symmetric matrices

  • Richard A. Snay
Article

Abstract

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.

Keywords

Geodetic Network Starting Vertex National Geodetic Survey Total Waiting Time Matrix Bandwidth 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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
  2. G.G. ALWAY and D.W. MARTIN, An algorithm for reducing the bandwidth of a matrix of symmetric configuration.The Computer Journal, 8, 264–272, 1965.CrossRefGoogle Scholar
  3. 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
  4. K.Y. CHENG, Minimizing the bandwidth of sparse symmetric matrices.Computing, 11, 103–110, 1973.CrossRefGoogle Scholar
  5. R.J. COLLINS, Bandwidth reduction by automatic renumbering.International Journal for Numerical Methods in Engineering, 6, No. 3, 345–356, 1973.CrossRefGoogle Scholar
  6. 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
  7. 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
  8. 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
  9. N.E. GIBBS, W.G. POOLE Jr. and P.K. STOCKMEYER, An algorithm for reducing the bandwidth and profile of a sparse matrix.SIAM Journal of Numerical Analysis, 13, No. 2, 236–250, 1976.CrossRefGoogle Scholar
  10. H.R. GROOMS, Algorithm for matrix bandwidth reduction.American Society of Civil Engineers, Structural Division Journal, 98, 203–214 1972.Google Scholar
  11. 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
  12. J.G. JEWELL, Ordering Systems of Equations.Journal of the Soc. for Industrial and Applied Mathematics, 9, p. 55 ff., 1961.CrossRefGoogle Scholar
  13. I.P. KING, An automatic reordering scheme for simultaneous equations derived from network systems.International Journal for Numerical Methods in Engineering, 2, No. 4, 523–533, 1970.CrossRefGoogle Scholar
  14. W. LIU and A.H. SHERMAN, Comparative analysis of the CUTHILL-MsKEE and the reverse CUTHILL-McKEE ordering algorithms for sparse matrices.SIAM Journal of Numerical Analysis, 13, No. 2, 198–213, 1976.CrossRefGoogle Scholar
  15. R. ROSEN, Matrix bandwidth minimization.Proceedings of Association for Computing Machinery, 23 rd National Conference, August 27–29, 535–595, 1968.Google Scholar

Copyright information

© Bureau Central de L’Association Internationale de Géodésie 1976

Authors and Affiliations

  • Richard A. Snay
    • 1
  1. 1.National Geodetic Survey National Ocean SurveyNOAARockville

Personalised recommendations