QEPCAD B: a program for computing with semi-algebraic sets using CADs

ABSTRACT

This report introduces QEPCAD, B, a program for computing with real algebraic sets using cylindrical algebraic decomposition (CAD). QEPCAD B both extends and improves upon the QEPCAD system for quantifier elimination by partial cylindrical algebraic decomposition written by Hoon Hong in the early 1990s. This paper briefly discusses some of the improvements in the implementation of CAD and quantifier elimination via CAD, and provides somewhat more detail on extensions to the system that go beyond quantifier elimination. The author is responsible for most of the extended features of QEPCAD B, but improvements to the basic CAD implementation and to the SACLIB library on which QEPCAD is based are the results of many people's work, including: George E. Collins, Mark J. Encarnación, Hoon Hong, Jeremy Johnson, Werner Krandick, Richard Liska, Scott McCallum, Nicolas Robidoux, and Stanly Steinberg. Source code, documentation and installation instructions for QEPCAD B are all available at www.cs.usna.edu/~qepcad.

REFERENCES

• 1: Dennis S. Arnon, Topologically reliable display of algebraic curves, Proceedings of the 10th annual conference on Computer graphics and interactive techniques, p.219-227, July 25-29, 1983, Detroit, Michigan, United States
• 2: Dennis S. Arnon , George E. Collins , Scott McCallum, Cylindrical algebraic decomposition II: an adjacency algorithm for the plane, SIAM Journal on Computing, v.13 n.4, p.878-889, Nov. 1984 [doi>10.1137/0213055]
• 3: Christopher W. Brown, Simplification of truth-invariant cylindrical algebraic decompositions, Proceedings of the 1998 international symposium on Symbolic and algebraic computation, p.295-301, August 13-15, 1998, Rostock, Germany [doi>10.1145/281508.281652]
• 4: Christopher W. Brown, Guaranteed solution formula construction, Proceedings of the 1999 international symposium on Symbolic and algebraic computation, p.137-144, July 28-31, 1999, Vancouver, British Columbia, Canada [doi>10.1145/309831.309890]
• 5: Christopher W. Brown , George E. Collins, Solution formula construction for truth invariant cad's, 1999
• 6: Christopher W. Brown, Improved projection for cylindrical algebraic decomposition, Journal of Symbolic Computation, v.32 n.5, p.447-465, November 2001 [doi>10.1006/jsco.2001.0463]
• 7: BROWN, C. W. The McCallum projection, lifting, and order-invariance. See www.cs.usna.edu/~wcbrown/research/techreports.html, September 2001.
• 8: Christopher W. Brown, Simple CAD construction and its applications, Journal of Symbolic Computation, v.31 n.5, p.521-547, May 2001 [doi>10.1006/jsco.2000.0394]
• 9: CAVINESS, B., AND JOHNSON, J. R., Eds. Quantifier Elimination and Cylindrical Algebraic Decomposition. Texts and Monographs in Symbolic Computation. Springer-Verlag, 1998.
• 10: George E. Collins, Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition, Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages, p.134-183, May 20-23, 1975
• 11: George E. Collins , Hoon Hong, Partial cylindrical algebraic decomposition for quantifier elimination, Journal of Symbolic Computation, v.12 n.3, p.299-328, Sept. 1991 [doi>10.1016/S0747-7171(08)80152-6]
• 12: George E. Collins , Jeremy R. Johnson , Werner Krandick, Interval arithmetic in cylindrical algebraic decomposition, Journal of Symbolic Computation, v.34 n.2, p.145-157, August 2002 [doi>10.1006/jsco.2002.0547]
• 13: Andreas Dolzmann , Thomas Sturn, REDLOG: computer algebra meets computer logic, ACM SIGSAM Bulletin, v.31 n.2, p.2-9, June 1997 [doi>10.1145/261320.261324]
• 14: GONZALEZ-VEGA, L. A. combinatorial algorithm solving some quantifier elimination problems. In Quantifier Elimination and Cylindrical Algebraic Decomposition, B. Caviness and J. Johnson, Eds., Texts and Monographs in Symbolic Computation. Springer-Verlag, Vienna, 1998.
• 15: Hoon Hong, Simple solution formula construction in cylindrical algebraic decomposition based quantifier elimination, Papers from the international symposium on Symbolic and algebraic computation, p.177-188, July 27-29, 1992, Berkeley, California, United States [doi>10.1145/143242.143306]
• 16: McCALLUM, S. Solving polynomial strict inequalities using cylindrical algebraic decomposition. The Computer Journal 36, 5 (1993), 432--438.
• 17: McCALLUM, S. An improved projection operator for cylindrical algebraic decomposition. In Quantifier Elimination and Cylindrical Algebraic Decomposition (1998), B. Caviness and J. Johnson, Eds., Texts and Monographs in Symbolic Computation, Springer-Verlag, Vienna.
• 18: Bhubaneswar Mishra, Algorithmic algebra, Springer-Verlag New York, Inc., New York, NY, 1993
• 19: James Renegar, On the computational complexity and geometry of the first-order theory of the reals. Part III: quantifier elimination, Journal of Symbolic Computation, v.13 n.3, p.329-352, March 1992
• 20: Adam Strzeboński, Solving systems of strict polynomial inequalities, Journal of Symbolic Computation, v.29 n.3, p.471-480, March 2000 [doi>10.1006/jsco.1999.0327]
• 21: TARSKI, A. A Decision Method for Elementary Algebra and Geometry. University of California Press, Berkeley, 1951. second ed., rev. Reprinted in {9}.
• 22: Volker Weispfenning, The complexity of linear problems in fields, Journal of Symbolic Computation, v.5 n.1-2, p.3-27, February/April 1988 [doi>10.1016/S0747-7171(88)80003-8]
• 23: Volker Weispfenning, Quantifier elimination for real algebra—the cubic case, Proceedings of the international symposium on Symbolic and algebraic computation, p.258-263, July 20-22, 1994, Oxford, United Kingdom [doi>10.1145/190347.190425]
• 24: WEISPFENNING, V. Quantifier elimination for real algebra -- the quadratic case and beyond. AAECC 8 (1997), 85--101.