Skip to main content
SpringerLink
Log in

A fill-in storage technique for geodetic normal equations

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

Abstract

A minimum fill-in scheme, published by Yale University and not previously discussed in the geodetic literature, has been tested on four typical triangulation networks. Its computer storage requirement has been compared with that of the profile method using Snay's station reordering algorithm. Tests have been carried out for terrestrial and mixed terrestrial/satellite networks.

The conclusion is that the fill-in scheme is a viable method for geodetic networks and, in some cases, it needs less computer storage than the profile method.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • V. ASHKENAZI (1967): “The Solution and Error Analysis of Large Geodetic Networks—Direct Methods”, Survey Reviews Nos. 146 and 147.

  • V. ASHKENAZI (1974): “An Assessment of the Proposed Readjustment of the North American Horizontal Geodetic Control Network”, The Canadian Surveyor, Vol. 28, No. 5.

  • P.A. CROSS (1978): “Computational Methods for the Adjustment and Analysis of National Geodetic Networks”, Thesis, Royal Institution of Chartered Surveyors, London.

    Google Scholar 

  • M.J.K. DAVIES, D.W. PROCTOR, V. ASHKENAZI and P.A. CROSS (1971): “The Readjustment of the Retriangulation of Great Britain and its Relationship to the European Terrestrial and Satellite Networks”, Ordnance Survey Professional Paper No. 23.

  • H.M. DUFOUR (1977): “Report of I.A.G. SSG 4.35” I.A.G. Symposium on the Optimisation of the Design and Computation of Geodetic Networks, Sopron, Hungary.

  • S.C. EISENSTAT, M.C. GURSKY, M.H. SCHULTZ and A.H. SHERMAN (undated: “Yale University Sparse Matrix Package”, Research Report No. 112, Yale University, Department of Computer Science.

  • A. JENNINGS (1966): “A Compact Storage Scheme for the Solution of Symmetrical Linear Equations”, The Computer Journal, Vol. 9, pp. 281–285.

    Google Scholar 

  • J.J. KOK (1977): “An Algorithm for the Reduction of Sparse Symmetric Matrices for the use in Least Squares Adjustment Programs”. I.A.G. Symposium on Optimization of Design and Computation of Geodetic Networks, Sopron, Hungary.

  • P. MEISSL (1977): “Computer Techniques in Geodesy—Report of I.A.G. SSG 4.38”. I.A.G. Symposium on the Optimisation of the Design and Computation of Geodetic Networks, Sopron, Hungary.

  • J.K. REID (1976): “Sparse Matrices”, Institute of Mathematics and its Applications Conference on the State of the Art in Numerical Analysis, York.

  • A.H. SHERMAN (1975): “On the Efficient Solution of Sparse Systems of Linear and Non-Linear Equations”, Yale University, Department of Computer Science, Research Report No. 46.

  • R.A. SNAY (1976): “Reducing the Profile of Sparse Symmetrical Matrices,”, NOAA Technical Memorandum, NOS-NGS-4.

  • R.P. TEWARSON (1971): “Sorting and Ordering Sparse Linear Systems”, in “Large Sparse Matrices” (ed. J.K. Reid), Academic Press.

Download references

Author information

Authors and Affiliations

  1. Department of Land Surveying, North East London Polytechnic, Forest Road, E17 4JB, London, (England)

    P. A. Cross

Authors
  1. P. A. Cross
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cross, P.A. A fill-in storage technique for geodetic normal equations. Bull. Geodesique 54, 503–509 (1980). https://doi.org/10.1007/BF02530707

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Keywords

Search

Navigation