Skip to main content

Solving systems of algebraic equations

  • Gröbner Bases
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 358))

Abstract

This paper shows an algorithm for computing all the solutions with their multiplicities of a system of algebraic equations. The algorithm previously proposed by the authors for the case where the ideal is zero-dimensional and radical seems to have practical efficiency. We present a new method for solving systems which are not necessarily radical. The set of all solutions is partitioned into subsets each of which consists of mutually conjugate solutions having the same multiplicity.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Böge, W., Gebauer, R., Kredel, H. (1986). Some Examples for Solving Systems of Algebraic Equations by Calculating Gröbner Bases. J. Symbolic Computation. 2/1, 83–98.

    Google Scholar 

  2. Buchberger, B. (1970). Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems. Aequationes Mathematicae. 4/3, 374–383.

    Google Scholar 

  3. Buchberger,B. (1985). Gröbner bases: An algorithmic method in polynomial ideal theory. N.K.Bose. (ed.) Multidimensional Systems Theory: Progress, Directions and Open problems in Multidimensional Systems Theory. D.Reidel Publ.Comp. Chapter 6.

    Google Scholar 

  4. Gianni,P., Trager,B., Zacharias,C. (1986). Gröbner bases and primary decomposition of polynomial ideals. Preprint.

    Google Scholar 

  5. Gröbner,W. (1949). Moderne Algebraische Geometrie. Springer.

    Google Scholar 

  6. Hearn,A.C. (1983). REDUCE USER'S MANUAL Version 3.0. The Rand Corporation.

    Google Scholar 

  7. Kobayashi,H., Fujise,T., Furkawa,A. (1987). Solving systems of algebraic equations by a general elimination method. to be appeared in J. Symbolic Computation.

    Google Scholar 

  8. Kobayashi,H., Moritsugu,S., Hogan,R.W. (1987). On Solving Systems of Algebraic Equations, submitted to J. Symbolic Computation.

    Google Scholar 

  9. Lazard, D. (1981). Resolution des systemes d'equations algebriques, Theor. Comp. Sci. 15, 77–110.

    Google Scholar 

  10. Trinks, W.L. (1978). Über Buchbergers Verfahren, Systeme algebraischer Gleichungen zu lösen. J. Number Theory. 10/4, 475–488.

    Google Scholar 

  11. van der Waerden,B.L. (1931). Moderne Algebra. Springer.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

P. Gianni

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kobayashi, H., Moritsugu, S., Hogan, R.W. (1989). Solving systems of algebraic equations. In: Gianni, P. (eds) Symbolic and Algebraic Computation. ISSAC 1988. Lecture Notes in Computer Science, vol 358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51084-2_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-51084-2_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51084-0

  • Online ISBN: 978-3-540-46153-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics