Corpus ID: 15785207

Deciding Nonnegativity of Polynomials by MAPLE

@article{Yang2013DecidingNO,
  title={Deciding Nonnegativity of Polynomials by MAPLE},
  author={L. Yang and Bican Xia},
  journal={ArXiv},
  year={2013},
  volume={abs/1306.4059}
}
  • L. Yang, Bican Xia
  • Published 2013
  • Mathematics, Computer Science
  • ArXiv
  • There have been some effective tools for solving (constant/parametric) semi-algebraic systems in Maple's library RegularChains since Maple 13. By using the functions of the library, e.g., RealRootClassfication, one can prove and discover polynomial inequalities. This paper is more or less a user guide on using RealRootClassfication to prove the nonnegativity of polynomials. We show by examples how to use this powerful tool to prove a polynomial is nonnegative under some polynomial inequality… CONTINUE READING
    2 Citations

    Topics from this paper

    References

    SHOWING 1-10 OF 13 REFERENCES
    Triangular decomposition of semi-algebraic systems
    • 64
    • PDF
    Real Solution Classification for Parametric Semi-Algebraic Systems
    • L. Yang, Bican Xia
    • Computer Science, Mathematics
    • Algorithmic Algebra and Logic
    • 2005
    • 33
    • PDF
    DISCOVERER: a tool for solving semi-algebraic systems
    • 51
    A complete discrimination system for polynomials
    • 150
    Computing with semi-algebraic sets: Relaxation techniques and effective boundaries
    • 9
    • PDF
    A complete algorithm for automated discovering of a class of inequality-type theorems
    • 100
    Quantifier elimination for real closed fields by cylindrical algebraic decomposition
    • 1,355
    Basic principles of mechanical theorem proving in elementary geometries
    • Wenjun Wu
    • Mathematics, Computer Science
    • Journal of Automated Reasoning
    • 2006
    • 213
    Mechanical Geometry Theorem Proving
    • 423