Skip to main content
SpringerLink
Log in

Nonstandard decision methods for the solvability of real polynomial equations

  • Published:
Science in China Series A: Mathematics Aims and scope Submit manuscript

Abstract

For a multivariate polynomial equation with coefficients in a computable ordered field, two criteria of this equation having real solutions are given. Based on the criteria, decision methods for the existence of real zeros and the semidefiniteness of binaly polynomials are provided. With the aid of computers, these methods are used to solve several examples. The technique is to extend the original field involved in the question to a computable non-Archimedean ordered field containing infinitesimal elements.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Wu Wen-jun,Basic Principle of Machanical Theorem-Prouing in Elementary Geomeiry, Beijing: Science Press. 1984, 208–228.

    Google Scholar 

  2. Tarski, K.,A Decision Method for Elementary Algebra and Geometry, Berkeley: Rand Corporation, 1951.

    MATH  Google Scholar 

  3. Seidenberg, A., A new decision method for elementary algebra,Ann. Math., 1954, 60(2): 365.

    Article  MathSciNet  Google Scholar 

  4. Yang, L., Hou, X. R., Zeng, Z. B. A complete discrimination system for polynomials,Science in China. Series E, 1996, 39(6): 628.

    MATH  MathSciNet  Google Scholar 

  5. Yang, L., Zhang, J. Z., Hou, X. R.,Nonlinear Algebraic Equation System and Automated Theorem Proving, Shanghai: Shanghai Scientific and Technological Education Publishing House, 1996.

    Google Scholar 

  6. Heck, A.,Introduction to Maple, New York-Berlin-Heidelberg: Springer-Verlag, 1993.

    MATH  Google Scholar 

  7. Becker, T., Weispfenning, V., Kredel, H., Gröbner Bases: A Computational Approach to Commuative Algebra, New York-Berlin-Heidelberg: Springer-Verlag, 1993.

    Google Scholar 

  8. Prestel, A.,Lectures on Formally Real Fields, Lecture Notes in Math, 1903, Berlin-Heidelberg-New York: Springer-Verlag, 1984.

    Google Scholar 

  9. Bocknack, J., Coste, M., Roy, M. F.,Géométrie Algébrique Réelle, New York-Berlin-Heidelberg: Springer-Verlag, 1987.

    Google Scholar 

  10. Knebusch, M., On the extension of real places,Comment. Math. Helv., 1973, 48(3): 354.

    Article  MATH  MathSciNet  Google Scholar 

  11. Lam, T. Y.,The Theory of Ordered Fields, Lecture Notes in Pure and Appl. Math., 55, New York: Marcel Dekker, 1980, 1–152.

    Google Scholar 

  12. Liang, S. X., Li, C. Z., Determination on positive semi-definite of binary polynomials over rationals,Computer Appllications, 1998, 18(3): 28.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Nanchang University, 330047, Nanchang, China

    Guangxing Zeng

Authors
  1. Guangxing Zeng
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Project supported by the National Natural Science Foundation of China (Grant No. 19661002) and the Climbing Project.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zeng, G. Nonstandard decision methods for the solvability of real polynomial equations. Sci. China Ser. A-Math. 42, 1251–1261 (1999). https://doi.org/10.1007/BF02876025

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02876025

Keywords

Search

Navigation