Algorithm for Dynamic Formation of Condition Equations in N-Dimensional Network

C. P. E. Agbachi

doi:https://doi.org/10.14445/22315373/IJMTT-V52P581

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 52 | Number 9 | Year 2017 | Article Id. IJMTT-V52P581 | DOI : https://doi.org/10.14445/22315373/IJMTT-V52P581

Algorithm for Dynamic Formation of Condition Equations in N-Dimensional Network

C. P. E. Agbachi

Citation :

C. P. E. Agbachi, "Algorithm for Dynamic Formation of Condition Equations in N-Dimensional Network," International Journal of Mathematics Trends and Technology (IJMTT), vol. 52, no. 9, pp. 574-581, 2017. Crossref, https://doi.org/10.14445/22315373/IJMTT-V52P581

Abstract

Condition equations, once used to be the only viable and memorable option in the model of computation by least squares estimation. That was in the early days of computing when RAM size of machines was in the region of 128K and search for models with efficient use of memory was imperative. Even today the merits of condition equations remain patent. The drawback has always been the ability to form the prerequisites in the first place. This paper discusses versatile algorithms for automatic generation of condition equations, and in the process restoring the model as a utility in resolving networks in Geomatics Engineering.

Keywords

Levels, Traverse, GPS, Cycles, Graph, BFS, DFS, Span Tree.

References

[1] M. A. R. Cooper,“Fundamentals of Survey Measurement and Analysis”, Granada, 1982.
[2] Donald E. Knuth, “The Art of Computer Programming, Vol. 1 (3rd Edition): Fundamental Algorithms”, Addison Wesley Longman Publishing Co.
[3] Paul Van Dooren, “Graph Theory and Applications”, Université Catholique de Louvain, Belgium. Dublin, August 2009.
[4] Jean-Paul Tremblay, Paul G. Sorenson, “An Introduction to Data Structures With Applications”, McGraw Hill Computer Science Series 2nd Edition.
[5] R. C. Chakraborty, “Problem Solving, Search and Control Strategies: AI Course Lecture 7-14”,RC Chakraborty,2010, www.myreaders.info.
[6] Yuji Murayama Surantha Dassanayake, “Fundamentals of Surveying Theory”,Division of Spatial Information Science, University of Tsukuba.
[7] M. A. R. Cooper, “Control Surveys in Civil Engineering”, Collins 1987.
[8] C. P. E. Agbachi, “Optimisation of Least Squares Algorithm: A Study of Frame Based Programming Techniques in Horizontal Networks”, IJMTT, Volume 37 Number 3 - September 2016.
[9] C. P. E. Agbachi, “Design and Application of Concurrent Double Key Survey Data Structures”, IJCTT, Volume 36 Number 3 - June 2016.
[10] J.E. Akin, “Object Oriented Programming Concepts”, ©2001 J.E Akin, https://www.clear.rice.edu/../oop3.pdf.
[11] Marco Cantu, “Object Pascal Handbook”, © Marco Cantu 1995-2016. http://www.marcocantu.com/objectpascal.
[12] C. P. E. Agbachi, “Surveying Software”, Chartered Institution of Civil Engineering Surveyors ICES, October 2011, http://mag.digitalpc.co.uk/fvx/ces/1110/?pn=44.