Skip to main content

Advertisement

Log in

On the verification of polynomial system solvers

  • Research Article
  • Published:
Frontiers of Computer Science in China Aims and scope Submit manuscript

Abstract

We discuss the verification of mathematical software solving polynomial systems symbolically by way of triangular decomposition. Standard verification techniques are highly resource consuming and apply only to polynomial systems which are easy to solve. We exhibit a new approach which manipulates constructible sets represented by regular systems. We provide comparative benchmarks of different verification procedures applied to four solvers on a large set of well-known polynomial systems. Our experimental results illustrate the high efficiency of our new approach. In particular, we are able to verify triangular decompositions of polynomial systems which are not easy to solve.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

References

  1. Grabmeier J, Kaltofen E, Weispfenning V. Computer Algebra Handbook. Berlin: Springer, 2003

    MATH  Google Scholar 

  2. Aubry P, Lazard D, Moreno Maza M. On the theories of triangular sets. Journal of Symbolic Computation, 1999, 28(1–2): 105–124

    Article  MATH  MathSciNet  Google Scholar 

  3. Wang D. Computing triangular systems and regular systems. Journal of Symbolic Computation, 2000, 30(2): 221–236

    Article  MATH  MathSciNet  Google Scholar 

  4. Donati L, Traverso C. Experimenting the Gröbner basis algorithm with the ALPI system. In: Proceedings of ISSAC. New York: ACM Press, 1989, 192–198

    Google Scholar 

  5. Aubry P, Moreno Maza M. Triangular sets for solving polynomial systems: a comparative implementation of four methods. Journal of Symbolic Computation, 1999, 28(1–2): 125–154

    Article  MATH  MathSciNet  Google Scholar 

  6. Backelin J, Fröberg R. How we proved that there are exactly 924 cyclic 7-roots. In: Watt S M, Proceedings of ISSAC. New York: ACM Press, 1991, 103–111

    Google Scholar 

  7. Sit W. Computations on quasi-algebraic sets. In: Proceedings of IMACS ACA, 1998

  8. Lemaire F, Moreno Maza M, Xie Y. The regularChains library. In: Kotsireas I S, ed. Proceedings of Maple Conference 2005. 2005, 355–368

  9. The Computational Mathematics Group. The BasicMath library NAG Ltd, Oxford, UK, 1998. http://www.nag.co.uk/projects/FRISCO.html

  10. Wang D. Epsilon 0.618. http://www-calfor.lip6.fr/wang/epsilon

  11. Manubens M, Montes A. Improving DISPGB Algorithm Using the Discriminant Ideal, 2006. http://www.citebase.org/abstract?id5oai:arXiv.org:math/0601763

  12. The SymbolicData Project, 2000–2006. http://www.SymbolicData.org

  13. Wang D. Elimination Methods. Berlin: Springer, 2001

    MATH  Google Scholar 

  14. Boulier F, Lemaire F, Moreno Maza M. Well known theorems on triangular systems. In: Proceedings of Transgressive Computing 2006. Spain: University of Granada, 2006

    Google Scholar 

  15. Moreno Maza M. On triangular decompositions of algebraic varieties. Technical Report TR 4/99, NAG Ltd, Oxford, UK, 1999. http://www.csd.uwo.ca/:_moreno

    Google Scholar 

  16. Eisenbud D. Commutative Algebra. GTM 150. Berlin: Springer, 1994

    Google Scholar 

  17. Hartshorne R. Algebraic Geometry. Berlin: Springer-Verlag, 1997

    Google Scholar 

  18. O’Halloran J, Schilmoeller M. Gröbner bases for constructible sets. Journal of Communications in Algebra, 2002, 30(11):5479–5483

    Article  MATH  MathSciNet  Google Scholar 

  19. Chen C, Golubitsky O, Lemaire F, et al. Comprehensive triangular decomposition. In: Proceedings of Computer Algebra in Scientific Computing. Berlin: Springer, LNCS, 2007, 4770:73–101

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marc Moreno Maza.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, C., Moreno Maza, M., Pan, W. et al. On the verification of polynomial system solvers. Front. Comput. Sci. China 2, 55–66 (2008). https://doi.org/10.1007/s11704-008-0006-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-008-0006-y

Keywords