Abstract
Cylindrical algebraic decompositions (CADs) are a key tool in real algebraic geometry, used primarily for eliminating quantifiers over the reals and studying semi-algebraic sets. In this paper we introduce cylindrical algebraic sub-decompositions (sub-CADs), which are subsets of CADs containing all the information needed to specify a solution for a given problem. We define two new types of sub-CAD: variety sub-CADs which are those cells in a CAD lying on a designated variety; and layered sub-CADs which have only those cells of dimension higher than a specified value. We present algorithms to produce these and describe how the two approaches may be combined with each other and the recent theory of truth-table invariant CAD. We give a complexity analysis showing that these techniques can offer substantial theoretical savings, which is supported by experimentation using an implementation in Maple.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Arnon D., Collins G.E., McCallum S.: Cylindrical algebraic decomposition I: the basic algorithm. SIAM J. Comput. 13, 865–877 (1984)
Backelin, J.: Square multiples n give infinitely many cyclic n-roots. Matematiska Institutionen Reports Series. Stockholms Universitet (1989)
Bradford, R., Davenport, J.H.: Towards better simplification of elementary functions. In: Proceedings of the ISSAC’02, pp. 16–22. ACM (2002)
Bradford, R., Davenport, J.H., England, M. McCallum, S., Wilson, D.: Cylindrical algebraic decompositions for boolean combinations. In: Proceedings of the ISSAC’13, pp. 125–132. ACM (2013)
Bradford, R., Davenport, J.H., England, M., McCallum, S., Wilson, D.: Truth table invariant cylindrical algebraic decomposition. http://opus.bath.ac.uk/38146/ (2014 submitted, preprint)
Bradford, R., Davenport, J.H., England, M., Wilson, D.: Optimising problem formulations for cylindrical algebraic decomposition. In: Carette, J., Aspinall, D., Lange, C., Sojka, P., Windsteiger, W. Intelligent Computer Mathematics. LNCS, vol. 7961, pp. 19–34. Springer, Berlin (2013)
Brown C.W.: Improved projection for cylindrical algebraic decomposition. J. Symb. Comput. 32(5), 447–465 (2001)
Brown C.W.: An overview of QEPCAD B: a program for computing with semi-algebraic sets using CADs. ACM SIGSAM Bull. 37(4), 97–108 (2003)
Brown, C.W.: The McCallum projection, lifting, and order-invariance. Technical report, US Naval Academy, Computer Science Department (2005)
Brown, C.W.: Constructing a single open cell in a cylindrical algebraic decomposition. In: Proceedings of the ISSAC’13, pp. 133–140. ACM (2013)
Brown, C.W., Davenport, J.H.: The complexity of quantifier elimination and cylindrical algebraic decomposition. In: Proceedings of the ISSAC’07, pp. 54–60. ACM (2007)
Brown C.W., El Kahoui M., Novotni D., Weber A.: Algorithmic methods for investigating equilibria in epidemic modelling. J. Symb. Comput. 41, 1157–1173 (2006)
Brown, C.W., McCallum, S.: On using bi-equational constraints in CAD construction. In: Proceedings of the ISSAC’05, pp. 76–83. ACM (2005)
Burr, M.A.: Applications of continuous amortization to bisection-based root isolation. http://arxiv.org/abs/1309.5991 (2013, preprint)
Chen, C., Moreno Maza, M.: An incremental algorithm for computing cylindrical algebraic decompositions. In: Proceedings of the ASCM’12. Springer, Berlin (2012, preprint). arXiv:1210.5543
Chen, C., Moreno Maza, M., Xia, B., Yang, L.: Computing cylindrical algebraic decomposition via triangular decomposition. In: Proceedings of the ISSAC’09, pp. 95–102. ACM (2009)
Collins, G.E.: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In: Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages, pp. 134–183. Springer. Berlin (1975)
Collins G.E., Hong H.: Partial cylindrical algebraic decomposition for quantifier elimination. J. Symb. Comput. 12, 299–328 (1991)
Davenport, J.H.: Computer algebra for cylindrical algebraic decomposition. Technical Report TRITA-NA-8511, NADA KTH Stockholm. Reissued as Bath Computer Science Technical report 88-10. http://staff.bath.ac.uk/masjhd/TRITA.pdf (1985)
Davenport J.H.: A “Piano-Movers” problem. SIGSAM Bull. 20(1–2), 15–17 (1986)
Davenport, J.H., Bradford, R., England, M., Wilson, D.: Program verification in the presence of complex numbers, functions with branch cuts etc. In: Proceedings of the SYNASC’12, pp. 83–88. IEEE (2012)
Davenport J.H., Heintz J.: Real quantifier elimination is doubly exponential. J. Symb. Comput. 5(1–2), 29–35 (1988)
Dolzmann, A., Seidl, A., Sturm, T.: Efficient projection orders for CAD. In: Proceedings of the ISSAC’04, pp. 111–118. ACM (2004)
England, M.: An implementation of CAD in Maple utilising McCallum projection. Department of Computer Science Technical Report series 2013-02, University of Bath. http://opus.bath.ac.uk/33180/ (2013)
England, M.: An implementation of CAD in Maple utilising problem formulation, equational constraints and truth-table invariance. Department of Computer Science Technical Report series 2013-04, University of Bath. http://opus.bath.ac.uk/35636/(2013)
England M., Bradford R., Davenport J.H., Wilson D.: Understanding branch cuts of expressions. In: Carette, J., Aspinall, D., Lange, C., Sojka, P., Windsteiger, W. (eds.) Intelligent Computer Mathematics. LNCS, vol. 7961, pp. 136–151. Springer, Berlin (2013)
Fotiou, I.A., Parrilo, P.A., Morari, M.: Nonlinear parametric optimization using cylindrical algebraic decomposition. In: Decision and Control, 2005 and 2005 European Control Conference. CDC-ECC ’05, pp. 3735–3740 (2005)
Hong, H.: An improvement of the projection operator in cylindrical algebraic decomposition. In: Proceedings of the ISSAC’90, pp. 261–264. ACM (1990)
Iwane, H., Yanami, H., Anai, H., Yokoyama, K.: An effective implementation of a symbolic-numeric cylindrical algebraic decomposition for quantifier elimination. In: Proceedings of the SNC’09, pp. 55–64 (2009)
Malladi, H.K., Dukkipati, A.: A preprocessor based on clause normal forms and virtual substitutions to parallelize cylindrical algebraic decomposition. http://arxiv.org/abs/1112.5352v3 (2013, preprint)
McCallum S.: Solving polynomial strict inequalities using cylindrical algebraic decomposition. Comput. J. 36(5), 432–438 (1993)
McCallum, S.: A computer algebra approach to path finding in the plane. In: Harland J. (ed.) Proceedings of Computing: The Australasian Theory Symposium (CATS), pp. 44–50 (1997)
McCallum, S.: An improved projection operation for cylindrical algebraic decomposition. In: Caviness, B., Johnson, J. Quantifier Elimination and Cylindrical Algebraic Decomposition. Texts and Monographs in Symbolic Computation, pp. 242–268. Springer, Berlin (1998)
McCallum, S.: On projection in CAD-based quantifier elimination with equational constraint. In: Proceedings of the ISSAC’99, pp. 145–149. ACM (1999)
McCallum, S.: On propagation of equational constraints in CAD-based quantifier elimination. In: Proceedings of the ISSAC’01, pp. 223–231. ACM (2001)
Paulson L.C.: Metitarski: past and future. In: Beringer, L., Felty, A. (eds.) Interactive Theorem Proving. LNCS, vol. 7406, pp. 1–10. Springer, Berlin (2012)
Phisanbut N., Bradford R.J., Davenport J.H.: Geometry of branch cuts. ACM Commun. Comput. Algebra 44(3), 132–135 (2010)
Schwartz J.T., Sharir M.: On the “Piano-Movers” problem: II. General techniques for computing topological properties of real algebraic manifolds. Adv. Appl. Math. 4, 298–351 (1983)
Seidl, A., Sturm, T.: A generic projection operator for partial cylindrical algebraic decomposition. In: Proceedings of the ISSAC’03, pp. 240–247. ACM (2003)
Strzeboński A.: Solving systems of strict polynomial inequalities. J. Symb. Comput. 29(3), 471–480 (2000)
Strzeboński A.: Cylindrical algebraic decomposition using validated numerics. J. Symb. Comput. 41(9), 1021–1038 (2006)
Strzeboński, A.: Computation with semialgebraic sets represented by cylindrical algebraic formulas. In: Proceedings of the ISSAC’10, pp. 61–68. ACM (2010)
Strzeboński, A.: Solving polynomial systems over semialgebraic sets represented by cylindrical algebraic formulas. In: Proceedings of the ISSAC’12, pp. 335–342. ACM (2012)
Wilson, D., Davenport, J.H., England, M., Bradford, R.: A “Piano Movers” problem reformulated. In: Proceedings of the SYNASC’13. IEEE (2013)
Wilson, D., England, M.: Layered cylindrical algebraic decomposition. Department of Computer Science Technical Report series 2013-05, University of Bath. http://opus.bath.ac.uk/36712/ (2013)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution License which permits any use, distribution, and reproduction in any medium, provided the original author(s) and the source are credited.
About this article
Cite this article
Wilson, D.J., Bradford, R.J., Davenport, J.H. et al. Cylindrical Algebraic Sub-Decompositions. Math.Comput.Sci. 8, 263–288 (2014). https://doi.org/10.1007/s11786-014-0191-z
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11786-014-0191-z
Keywords
- Cylindrical algebraic decomposition
- Real algebraic geometry
- Equational constraints
- Symbolic computation
- Computer algebra