Abstract
A fundamental task in geodesy is the solving of systems of equations. Many geodetic problems are represented as systems of multivariate polynomials. A common problem in solving such systems is improper initial starting values for iterative methods, leading to the convergence to solutions with no physical meaning, or convergence that requires global method . Although symbolic methods such as Groebner bases or resultants have been shown to be very efficient, i.e., providing solutions for determined systems such as 3-point problem of 3D affine transformation, the symbolic algebra can be very time consuming, even with special Computer Algebra Systems (CAS). This Chapter proposes the Homotopy method that can be implemented easily in high level computer languages like C++ and Fortran, which are faster than the interpreter type CAS by at least two orders of magnitude. Using Mathematica, the power of Homotopy is demonstrated by solving three nonlinear geodetic problems: resection, GPS positioning and affine transformation. The method enlarging the domain of convergence is found to be efficient, less sensitive to rounding errors, and has a lower complexity compared to other local methods like Newton-Raphson.
Keywords
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
Remark: However, there are certain theorems that place smoothness restrictions on the input functions, under which all solutions of the target system are found. See [10].
References
Allgower EL, Georg K (1990) Numerical continuation methods. An introduction. SCM, vol 13. Springer, Berlin Heidelberg
Awange JL, Grafarend EW (2005) Solving algebraic computational problems in geodesy and geoinformatics. Springer, Berlin
Awange JL, Grafarend EW, Palancz B, Zaletnyik P (2010) Algebraic Geodesy and Geoinformatics. Springer, Berlin-Heidelberg
Bates D, Hauenstein J, Sommese A, Wampler C (2008) Software for numerical algebraic geometry: a paradigm and progress towards its implementation. Software for algebraic geometry. IMA volumes in mathematics and its applications, vol 148. Springer, New York, pp 1–14
Bernstein DN (1975) The number of roots of a system of equations. Funct Anal Appl 9:183–185
Bernstein DN, Kushnirenko AG, Khovanskii AG (1976) Newton polyhedra. Usp Mat Nauk 31:201–202
Binous H (2007) Homotopy continuation method to solve a system of nonlinear algebraic equations. Wolfram Library Archive, MathSource. http://library.wolfram.com/infocenter/MathSource/6710/. Accessed 1 Dec 2008
Binous H (2007) Homotopy continuation method to find all roots of a polynomial equation I – II. Wolfram Library Archive, MathSource. http://library.wolfram.com/infocenter/MathSource/6717/. Accessed 1 Dec 2008
Chapra SC, Canale RP (1998) Numerical methods for engineers, with programming and software applications, 3rd edn. McGraw-Hill, Boston/New York/London
Choi SH, Book NL (1991) Unreachable roots for global homotopy continuation methods. AIChE J 37(7):1093–1095
Decarolis F, Mayer R, Santamaria M (2002) Homotopy continuation methods. http://home.uchicago.edu/~fdc/H-topy.pdf. Accessed 1 Dec 2008
Drexler FJ (1977) Eine Methode zur Berechnung sämtlicher Lösungen von Polynomgleichungssystemen. Numer Math 29:45–58
Garcia CB, Zangwill WI (1979) Determining all solutions to certain systems of nonlinear equations. Math Oper Res 4:1–14
Garcia CB, Zangwill WI (1981) Pathways to solutions, fixed points and equilibria. Prentice Hall, Englewood Cliffs
Gritton KS, Seader JD, Lin WJ (2001) Global homotopy continuation procedures for seeking all roots of a nonlinear equation. Comput Chem Eng 25:1003–1019
Gunji T, Kim S, Kojima M, Takeda A, Fujisawa K, Mizutani T (2004) “PHoM” – a polyhedral homotopy continuation method for polynomial systems. Computing 73(1):57–77
Haneberg WC (2004) Computational geosciences with Mathematica. Springer, Berlin/Heidelberg/New York
Hazaveh K, Jeffrey DJ, Reid GJ, Watt SM, Wittkopf AD (2003) An exploration of homotopy solving in Maple. http://www.apmaths.uwo.ca/~djeffrey/Offprints/ascm2003.pdf. Accessed 27 Aug 2008
Kotsireas IS (2001) Homotopies and polynomial systems solving I: basic principles. ACM SIGSAM Bull 35(1):19–32
Lee TL, Li TY, Tsai CH (2008) HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method. Computing 83(2–3):109–133
Leykin A, Verschelde J (2004) PHCmaple: a Maple interface to the numerical homotopy algorithms in PHCpack. http://www.ima.umn.edu/~leykin/papers/PHCmaple.pdf. Accessed 1 Dec 2008
Nor HM, Ismail AM, Majid AA (2013) Quadratic bezier homotopy function for solving system of polynomial equations. Matematika, 29(2):159–171
Paláncz B (2008) Introduction to linear homotopy, Wolfram Library Archive, MathSource. http://library.wolfram.com/infocenter/MathSource/7119/. Accessed 27 Aug 2008
Paláncz B, Awange JL, Zaletnyik P, Lewis RH (2009) Linear homotopy solution of nonlinear systems of equations in geodesy, J Geod 84(1):79–95
Sommese AJ, Verschelde J, Wampler CW (2003) Introduction to numerical algebraic geometry. In: Dickenstein A, Emiris IZ (eds) Solving polynomial equations. Foundations, algorithms and applications. Volume 14 of algorithms and computation in mathematics. Springer, Berlin Heidelberg, pp 301–337
Sommese AJ, Wampler CW (2005) The numerical solution of systems of polynomials arising in engineering and science. World Scientific, Hackensack
Verschelde J (1999) Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation. ACM Trans Math Softw 25(2):251–276
Verschelde J (2007) Homotopy Methods for Solving Polynomial Systems Tutorial at ISSAC’ 05, Beijing. http://www.math.uic.edu/~jan/tutorial.pdf. Accessed 1 Dec 2008
Watson LT, Sosonkina M, Melville RC, Morgan AP, Walker HF (1997) Algorithm 777: HOMPACK90: a suite of Fortran 90 codes for globally convergent homotopy algorithms. ACM Trans Math Softw 23(4):514–549
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Awange, J.L., Paláncz, B. (2016). Linear and Nonlinear Homotopy. In: Geospatial Algebraic Computations. Springer, Cham. https://doi.org/10.1007/978-3-319-25465-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-25465-4_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25463-0
Online ISBN: 978-3-319-25465-4
eBook Packages: Earth and Environmental ScienceEarth and Environmental Science (R0)