Skip to main content
Log in

Reducing the profile of sparse symmetric matrices

  • Published:
Bulletin géodésique Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • 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 

  • 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.

    Article  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.

  • K.Y. CHENG, Minimizing the bandwidth of sparse symmetric matrices.Computing, 11, 103–110, 1973.

    Article  Google Scholar 

  • R.J. COLLINS, Bandwidth reduction by automatic renumbering.International Journal for Numerical Methods in Engineering, 6, No. 3, 345–356, 1973.

    Article  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.

  • 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.

  • A. GEORGE, Computer Implementation of the Finite Element Method. Computer Science Department, Stanford University, Stanford, California.Report No. STAN-CS-71-208, 1971.

  • 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.

    Article  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 

  • J.G. JEWELL, Ordering Systems of Equations.Journal of the Soc. for Industrial and Applied Mathematics, 9, p. 55 ff., 1961.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • R. ROSEN, Matrix bandwidth minimization.Proceedings of Association for Computing Machinery, 23 rd National Conference, August 27–29, 535–595, 1968.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Snay, R.A. Reducing the profile of sparse symmetric matrices. Bull. Geodesique 50, 341–352 (1976). https://doi.org/10.1007/BF02521587

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02521587

Keywords

Navigation