Abstract
Cylindrical algebraic decomposition (CAD) is an important tool, both for quantifier elimination over the reals and a range of other applications. Traditionally, a CAD is built through a process of projection and lifting to move the problem within Euclidean spaces of changing dimension. Recently, an alternative approach which first decomposes complex space using triangular decomposition before refining to real space has been introduced and implemented within the RegularChains Library of Maple. We here describe a freely available package ProjectionCAD which utilises the routines within the RegularChains Library to build CADs by projection and lifting. We detail how the projection and lifting algorithms were modified to allow this, discuss the motivation and survey the functionality of the package.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aubry, P., Lazard, D., Moreno Maza, M.: On the theories of triangular sets. Journal of Symbolic Computation 28(1-2), 105–124 (1999)
Boulier, F., Chen, C., Lemaire, F., Moreno Maza, M.: Real root isolation of regular chains. In: Proc. ASCM 2009, pp. 15–29 (2009)
Bradford, R., Chen, C., Davenport, J.H., England, M., Moreno Maza, M., Wilson, D.: Truth table invariant cylindrical algebraic decomposition by regular chains. To appear: Proc. CASC 2014 (2014), Preprint: http://opus.bath.ac.uk/38344/
Bradford, R., Davenport, J.H., England, M., McCallum, S., Wilson, D.: Cylindrical algebraic decompositions for boolean combinations. In: Proc. ISSAC 2013, pp. 125–132. ACM (2013)
Bradford, R., Davenport, J.H., England, M., McCallum, S., Wilson, D.: Truth table invariant cylindrical algebraic decomposition (submitted 2014), Preprint: http://opus.bath.ac.uk/38146/
Bradford, R., Davenport, J.H., England, M., Wilson, D.: Optimising problem formulation for cylindrical algebraic decomposition. In: Carette, J., Aspinall, D., Lange, C., Sojka, P., Windsteiger, W. (eds.) CICM 2013. LNCS, vol. 7961, pp. 19–34. Springer, Heidelberg (2013)
Brown, C.W.: The McCallum projection, lifting, and order-invariance. Technical report, U.S. Naval Academy, Compt. Sci. Dept. (2005)
Brown, C.W., Davenport, J.H.: The complexity of quantifier elimination and cylindrical algebraic decomposition. In: Proc. ISSAC 2007, pp. 54–60. ACM (2007)
Chen, C., Davenport, J.H., May, J., Moreno Maza, M., Xia, B., Xiao, R., Xie, Y.: User interface design for geometrical decomposition algorithms in Maple. In: Proc. Mathematical User-Interface Workshop, 12 pages (2009)
Chen, C., Moreno Maza, M.: An incremental algorithm for computing cylindrical algebraic decompositions. In: Proc. ASCM 2012. Preprint: http://arxiv.org/abs/1210.5543
Chen, C., Moreno Maza, M., Xia, B., Yang, L.: Computing cylindrical algebraic decomposition via triangular decomposition. In: Proc. ISSAC 2009, pp. 95–102. ACM (2009)
Collins, G.E.: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 134–183. Springer, Heidelberg (1975)
Davenport, J.H., Bradford, R., England, M., Wilson, D.: Program verification in the presence of complex numbers, functions with branch cuts etc. In: Proc. SYNASC 2012, pp. 83–88. IEEE (2012)
England, M.: An implementation of CAD in Maple utilising McCallum projection. Technical report, Uni. of Bath, Dept. Comp. Sci., 2013-02 (2013), http://opus.bath.ac.uk/33180/
England, M.: An implementation of CAD in Maple utilising problem formulation, equational constraints and truth-table invariance. Technical report, Uni. of Bath, Dept. Comp. Sci., 2013-04 (2013), http://opus.bath.ac.uk/35636/
England, M., Bradford, R., Chen, C., Davenport, J.H., Moreno Maza, M., Wilson, D.: Problem formulation for truth-table invariant cylindrical algebraic decomposition by incremental triangular decomposition. In: Watt, S.M. (ed.) CICM 2014. LNCS (LNAI), vol. 8543, pp. 45–60. Springer, Heidelberg (2014)
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.) CICM 2013. LNCS, vol. 7961, pp. 136–151. Springer, Heidelberg (2013)
Li, X., Moreno Maza, M., Pan, W.: Computations modulo regular chains. In: Proc. ISSAC 2009, pp. 239–246. ACM (2009)
Moreno Maza, M.: On triangular decompositions of algebraic varieties. Presented at: Effective Methods in Algebraic Geometry, MEGA (2000)
McCallum, S.: An improved projection operation for cylindrical algebraic decomposition. In: Quantifier Elimination and Cylindrical Algebraic Decomposition. Texts & Monographs in Symbolic Computation, pp. 242–268. Springer (1998)
McCallum, S.: On projection in CAD-based quantifier elimination with equational constraint. In: Proc. ISSAC 1999, pp. 145–149. ACM (1999)
Musser, D.R.: Multivariate polynomial factorization. Journal of the ACM 22(2), 291–308 (1975)
Wang, D.: Computing triangular systems and regular systems. Journal of Symbolic Computation 30(2), 221–236 (2000)
Wilson, D., Bradford, R., Davenport, J.H., England, M.: Cylindrical algebraic sub-decompositions. To appear: Mathematics in Computer Science. Springer (2014)
Wilson, D., Davenport, J.H., England, M., Bradford, R.: A “piano movers” problem reformulated. In: Proc. SYNASC 2013. IEEE (2014)
The RegularChains Library, http://www.regularchains.org
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
England, M., Wilson, D., Bradford, R., Davenport, J.H. (2014). Using the Regular Chains Library to Build Cylindrical Algebraic Decompositions by Projecting and Lifting. In: Hong, H., Yap, C. (eds) Mathematical Software – ICMS 2014. ICMS 2014. Lecture Notes in Computer Science, vol 8592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44199-2_69
Download citation
DOI: https://doi.org/10.1007/978-3-662-44199-2_69
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44198-5
Online ISBN: 978-3-662-44199-2
eBook Packages: Computer ScienceComputer Science (R0)