Skip to main content
SpringerLink
Log in

Solution of Algebraic Polynomial Systems

  • Chapter
  • First Online:
Mathematical Geosciences

Abstract

Let us consider the following polynomial

$$ p = 2x + x^{3} y^{2} + y^{2} . $$

The monomials are \( x^{3} y^{2} \) with coefficient 1, and \( x^{1} y^{0} \) with coefficient 2 and \( x^{0} y^{2} \) with coefficient 1.

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  • Awange JL, Paláncz B (2016) Geospatial algebraic computations, theory and applications. Springer, Berlin

    Book  Google Scholar 

  • Buchberger B, Winkler F (1998) Groebner bases and applications. London mathematical society lecture note series 251. Cambridge University Press, Cambridge

    Google Scholar 

  • Dickenstein A, Emiris IZ (eds) (2005) Solving polynomial equations, foundations, algorithms and applications (Algorithms and computation in mathematics), vol 14. Springer, Berlin

    Google Scholar 

  • Kapur D, Saxena T, Yang L (1994) Algebraic and geometric reasoning using Dixon resultants. In: Proceeding of the International Symposium on Symbolic and Algebraic Computation. ACM Press, New York

    Google Scholar 

  • Lewis RH (2008) Heuristics to accelerate the Dixon resultant. Math Comput Simul 77(4):400–407

    Article  Google Scholar 

  • Lichtblau D (2013) Approximate Gröbner bases, overdetermined polynomial systems and approximate GCDs. Hindawi Publishing Corporation, ISRN Computational Mathematics, vol 2013, Article ID 352806, pp 1–12, http://dx.doi.org/10.11155/2013/352806

  • Paláncz B, Zaletnyik P, Awange JL, Grafarend EW (2008) Dixon resultant’s solution of systems of geodetic polynomial equations. J Geodesy 82(8):505–511

    Article  Google Scholar 

  • Sasaki T (2014) A practical method for floating-point Gröbner basis computation. In: Feng R, Lee W, Sato Y (eds) Computer mathematics. Springer, Berlin, pp 109–124

    Google Scholar 

  • Szanto A (2011) Hybrid symbolic-numeric methods for the solution of polynomial systems: tutorial overview. In: Proceeding ISSAC ‘11 Proceedings of the 36th international symposium on symbolic and algebraic computation, San Jose, California, USA, June 08–11, 2011 ACM New York, NY, USA ©2011, pp 9–10

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Spatial Sciences, Curtin University, Perth, WA, Australia

    Joseph L. Awange

  2. Budapest University of Technology and Economics, Budapest, Hungary

    Béla Paláncz

  3. Fordham University, New York, NY, USA

    Robert H. Lewis

  4. Budapest University of Technology and Economics, Budapest, Hungary

    Lajos Völgyesi

Authors
  1. Joseph L. Awange
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Béla Paláncz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Robert H. Lewis
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lajos Völgyesi
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Awange, J.L., Paláncz, B., Lewis, R.H., Völgyesi, L. (2018). Solution of Algebraic Polynomial Systems. In: Mathematical Geosciences. Springer, Cham. https://doi.org/10.1007/978-3-319-67371-4_1

Download citation

Publish with us

Policies and ethics

Search

Navigation