Skip to main content

Speeding Up Cylindrical Algebraic Decomposition by Gröbner Bases

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7362))

Abstract

Gröbner Bases [Buc70] and Cylindrical Algebraic Decomposition [Col75,CMMXY09] are generally thought of as two, rather different, methods of looking at systems of equations and, in the case of Cylindrical Algebraic Decomposition, inequalities. However, even for a mixed system of equalities and inequalities, it is possible to apply Gröbner bases to the (conjoined) equalities before invoking CAD. We see that this is, quite often but not always, a beneficial preconditioning of the CAD problem.

It is also possible to precondition the (conjoined) inequalities with respect to the equalities, and this can also be useful in many cases.

The examples used in this paper are available in [Wil12]. This work was partially supported by the U.K.’s EPSRC under grant number EP/J003247/1.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aubry, P., Lazard, D., Moreno Maza, M.: On the Theories of Triangular Sets. J. Symbolic Comp. 28, 105–124 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  2. Böge, W., Gebauer, R., Kredel, H.: Gröbner Bases Using SAC2. In: Caviness, B.F. (ed.) ISSAC 1985 and EUROCAL 1985. LNCS, vol. 204, pp. 272–274. Springer, Heidelberg (1985)

    Google Scholar 

  3. Buchberger, B., Hong, H.: Speeding-up Quantifier Elimination by Gröbner Bases. Technical Report 91-06 (1991)

    Google Scholar 

  4. Brown, C.W.: QEPCAD B: a program for computing with semi-algebraic sets using CADs. ACM SIGSAM Bulletin 37(4), 97–108 (2003)

    Article  MATH  Google Scholar 

  5. Brown, C.W.: Tutorial handout (2004), http://www.cs.usna.edu/~wcbrown/research/ISSAC04/handout.pdf

  6. Brown, C.W.: SLFQ — simplifying large formulas with QEPCAD B (2005), http://www.cs.usna.edu/~qepcad/SLFQ/Home.html

  7. Buchberger, B.: Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystem (English translation in [Buc98]). Aequationes Mathematicae 4, 374–383 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  8. Buchberger, B.: An Algorithmic Criterion for the Solvability of a System of Algebraic Equations. In: Gröbner Bases and Applications, pp. 535–545 (1998)

    Google Scholar 

  9. Collins, G.E., Hong, H.: Partial Cylindrical Algebraic Decomposition for Quantifier Elimination. J. Symbolic Comp. 12, 299–328 (1991)

    Article  MathSciNet  Google Scholar 

  10. Chen, C., Moreno Maza, M., Xia, B., Yang, L.: Computing Cylindrical Algebraic Decomposition via Triangular Decomposition. In: May, J. (ed.) Proceedings ISSAC 2009, pp. 95–102 (2009)

    Google Scholar 

  11. Collins, G.E.: Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition. In: Proceedings 2nd GI Conference Automata Theory & Formal Languages, pp. 134–183 (1975)

    Google Scholar 

  12. Dolzmann, A., Seidl, A., Sturm, T.: Efficient Projection Orders for CAD. In: Gutierrez, J. (ed.) Proceedings ISSAC 2004, pp. 111–118 (2004)

    Google Scholar 

  13. Gianni, P.: Properties of Gröbner Bases Under Specializations. In: Davenport, J.H. (ed.) ISSAC 1987 and EUROCAL 1987. LNCS, vol. 378, pp. 293–297. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  14. Kalkbrener, M.: Solving Systems of Algebraic Equations by Using Gröbner Bases. In: Davenport, J.H. (ed.) ISSAC 1987 and EUROCAL 1987. LNCS, vol. 378, pp. 282–292. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  15. Moreno Maza, M.: On Triangular Decompositions of Algebraic Varieties (2005), http://www.csd.uwo.ca/~moreno/Publications/M3-MEGA-2005.pdf

  16. Phisanbut, N.: Practical Simplification of Elementary Functions using Cylindrical Algebraic Decomposition. PhD thesis, University of Bath (2011)

    Google Scholar 

  17. Platzer, A., Quesel, J.-D., Rümmer, P.: Real World Verification. In: Schmidt, R.A. (ed.) CADE-22. LNCS, vol. 5663, pp. 485–501. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  18. Tarski, A.: A Decision Method for Elementary Algebra and Geometry, 2nd edn. Univ. Cal. Press (1951)

    Google Scholar 

  19. Wilson, D.J.: Real Geometry and Connectness via Triangular Description: CAD Example Bank (2012), http://opus.bath.ac.uk/29503

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wilson, D.J., Bradford, R.J., Davenport, J.H. (2012). Speeding Up Cylindrical Algebraic Decomposition by Gröbner Bases. In: Jeuring, J., et al. Intelligent Computer Mathematics. CICM 2012. Lecture Notes in Computer Science(), vol 7362. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31374-5_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31374-5_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31373-8

  • Online ISBN: 978-3-642-31374-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics