Skip to main content

Groebner basis

  • Chapter
  • First Online:
Algebraic Geodesy and Geoinformatics

Abstract

This chapter presents you the reader with one of the most powerful computer algebra tools, besides the polynomial resultants (discussed in the next chapter), for solving nonlinear systems of equations which you may encounter. The basic tools that you will require to develop your own algorithms for solving problems requiring closed form (exact) solutions are presented. This powerful tool is the “Gröbner basis” written in English as Groebner basis. It was first suggested by B. Buchberger in 1965, a PhD student of Wolfgang Groebner (1899 - 1980). Groebner, already in 1949, had suggested a method for finding a linearly independent basis of the vector space of the residue class ring of the polynomial ring modulo a polynomial ideal. In studying termination of this method, Buchberger came up both with the notion of Groebner bases (certain generating sets for polynomial ideals) and with an always terminating algorithm for computing them. In 1964, H. Hironaka (1931-) had independently introduced an analogous notion for the domain of power series in connection with his work on resolution of singularities in algebraic geometry and named it standard basis [262, p. 187]. However, he did not give any method for computing these bases.

“There are no good, general methods for solving systems of more than one nonlinear equation. Furthermore, it is not hard to see why (very likely) there never will be any good, general methods:...” W. H. Press et al.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

  1. Awange JL (2002a) Groebner bases, multipolynomial resultants and the Gauss-Jacobi combinatorial algorithms-adjustment of nonlinear GPS/LPS observations. Ph.D. thesis, Department of Geodesy and GeoInformatics, Stuttgart University, Germany. Technical Reports, Report Nr. 2002 (1)

    Google Scholar 

  2. Awange JL (2002b) Groebner basis solution of planar resection. Survey Review 36: 528–543

    Google Scholar 

  3. Awange JL (2003b) Buchberger algorithm applied to planar lateration and intersection problems. Survey Review 37: 319–329

    Google Scholar 

  4. Awange JL, Grafarend EW (2002c) Algebraic solution of GPS pseudo-ranging equations. Journal of GPS Solutions 4: 20–32

    Article  Google Scholar 

  5. Awange JL, Grafarend EW (2003b) Groebner basis solution of the three-dimensional resection problem (P4P). Journal of Geodesy, 77: 327–337

    Article  Google Scholar 

  6. Awange JL, Fukuda Y, Takemoto S, Grafarend EW (2003a) Direct Polynomial approach to nonlinear distance (ranging) problems. Earth, Planets and Space 55: 231–241

    Google Scholar 

  7. Awange JL, Grafarend EW, Fukuda Y (2003c) Closed form solution of the triple three-dimensional intersection problem. Zeitschrift für Geodaesie, Geoinfornation und Landmanagement 128: 395–402

    Google Scholar 

  8. Becker T, Weispfenning V (1993) Gröbner bases. A computational approach to commutative algebra. Graduate Text in Mathematics 141, Springer, New York

    Google Scholar 

  9. Becker T, Weispfenning V (1998) Gröbner bases. A computational approach to commutative algebra. Graduate Text in Mathematics 141, 2nd Edition, Springer, New York

    Google Scholar 

  10. Buchberger B (1965) An algorithm for finding a basis for the residue class ring of a zero dimensional polynomial ideal (German). Ph.D. thesis, Institute of Mathematics, University of Innsbruck (English Translation: J. of Symbolic Computation, Special Issue on Logic, Mathematics, and Computer Science: Interactions. Volume 41, Number 3-4, Pages 475-511, 2006).

    Google Scholar 

  11. Buchberger B (1970) Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungsystems (An Algorithmic Criterion for the Solvability of Algebraic Systems of Equations).. Aequationes Mathematicae 4/ 3: 374–383 (English translation in: B. Buchberger, F. Winkler (eds.), Groebner Bases and Applications, Proceedings of the International Conference “33 Years of Groebner Bases”, 1998, RISC, Austria, London Mathematical Society Lecture Note Series, Vol. 251, Cambridge University Press, 1998, pp. 535 -545.)

    Google Scholar 

  12. Buchberger B (1979) A criterion for detecting unnecessary reductions in the construction of Groebner bases. Proceedings of the 1979 European Symposium on Symbolic and Algebraic computation, Springer lecture notes in Computer Science 72, pp. 3-21, Springer, Berlin-Heidelberg-New York

    Google Scholar 

  13. Buchberger B, Winkler F (1998) Groebner bases and applications. London mathematical society lecture note series 251, Cambridge university press

    Google Scholar 

  14. Cox D, Little J, O’Shea D (1998) Using algebraic geometry. Graduate Text in Mathematics 185. Springer, New York

    Google Scholar 

  15. Cox D, Little J, O’Shea D (1997) Ideals, Varieties, and Algorithms. An introduction to computational algebraic geometry and commutative algebra, Springer, New York

    Google Scholar 

  16. Davenport JH, Siret Y, Tournier E (1988) Computer algebra. Systems and algorithms for algebraic computation. Academic Press Ltd., St. Edmundsbury, London

    Google Scholar 

  17. Grewal MS, Weill LR, Andrews AP (2001) Global Positioning Systems, Inertial Navigation and Integration, John Wiley & Sons, New York

    Google Scholar 

  18. Ireland K, Rosen M (1990) A classical introduction to modern number theory. Springer, New York

    Google Scholar 

  19. Lauritzen N (2003) Concrete abstract algebra. From numbers to Gröbner bases. Cambridge University Press, UK

    Google Scholar 

  20. Lidl R, Pilz G (1998) Applied abstract algebra. 2nd edition, Springer, New York

    Google Scholar 

  21. Macaulay F (1916) The algebraic theory of modular systems. Cambridge Tracts in Mathematics 19, Cambridge University Press, Cambridge

    Google Scholar 

  22. Nicholson WK (1999) Introduction to abstract algebra. Second Edition, John Wiley &, New York-Chichester-weinheim-Brisbane-Singapore

    Google Scholar 

  23. Pistone G, Wynn HP (1996) Generalized confounding with Gröbner bases. Biometrika 83: 112–119

    Article  Google Scholar 

  24. Sturmfels B (1996) Gröbner bases and convex polytopes. American Mathematical Society, Providence

    Google Scholar 

  25. Vasconcelos WV (1998) Computational methods in commutative algebra and algebraic geometry, Springer, Berlin-Heidelberg

    Google Scholar 

  26. Winkler F (1996) A polynomial algorithm in computer algebra. Springer, Wien

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Joseph L. Awange .

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Awange, J.L., Grafarend, E.W., Paláncz, B., Zaletnyik, P. (2010). Groebner basis. In: Algebraic Geodesy and Geoinformatics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12124-1_4

Download citation

Publish with us

Policies and ethics