Abstract
For a set S of cells in a cylindrical algebraic decomposition of ℝn, we introduce the notion of generalized cylindrical algebraic formula (GCAF) associated with S. We propose a multi-level heuristic algorithm for simplifying the cylindrical algebraic formula associated with S into a GCAF. The heuristic strategies are motivated by solving examples coming from the application of automatic loop transformation. While the algorithm works well on these examples, its effectiveness is also illustrated by examples from other application domains.
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
Arnon, D.S., Collins, G.E., McCallum, S.: Cylindrical algebraic decomposition II: an adjacency algorithm for the plane. SIAM J. Comput. 13(4), 878–889 (1984)
Brown, C.W.: Solution Formula Construction for Truth Invariant CAD’s. PhD thesis, University of Delaware (1999)
Brown, C.W.: Fast simplifications for tarski formulas based on monomial inequalities. Journal of Symbolic Computation 47(7), 859–882 (2012)
Brown, C.W., Strzeboński, A.: Black-box/white-box simplification and applications to quantifier elimination. In: Proc. of ISSAC 2010, pp. 69–76 (2010)
Chen, C., Davenport, J.H., May, J., Moreno Maza, M., Xia, B., Xiao, R.: Triangular decomposition of semi-algebraic systems. In: Watt, S.M. (ed.) Proceedings ISSAC 2010, pp. 187–194 (2010)
Chen, C., Moreno Maza, M.: An incremental algorithm for computing cylindrical algebraic decompositions. In: Computer Mathematics: Proc. of ASCM 2012, pp. 199–222 (2014)
Chen, C., Moreno Maza, M.: Quantifier elimination by cylindrical algebraic decomposition based on regular chains. In: Proc. of ISSAC 2014, pp. 91–98 (2014)
Collins, G.E.: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. Springer Lecture Notes in Computer Science 33, 515–532 (1975)
Collins, G.E., Hong, H.: Partial cylindrical algebraic decomposition. Journal of Symbolic Computation 12(3), 299–328 (1991)
Dolzmann, A., Sturm, T.: Simplification of quantifier-free formulas over ordered fields. Journal of Symbolic Computation 24, 209–231 (1995)
Größlinger, A.: Scanning index sets with polynomial bounds using cylindrical algebraic decomposition. Number MIP-0803 (2008)
Größlinger, A., Griebl, M., Lengauer, C.: Quantifier elimination in automatic loop parallelization. J. Symb. Comput. 41(11), 1206–1221 (2006)
Iwane, H., Higuchi, H., Anai, H.: An effective implementation of a special quantifier elimination for a sign definite condition by logical formula simplification. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2013. LNCS, vol. 8136, pp. 194–208. Springer, Heidelberg (2013)
Strzeboński, A.: Computation with semialgebraic sets represented by cylindrical algebraic formulas. In: Proc. of ISSAC 2010, pp. 61–68. ACM (2010)
Strzeboński, A.: Solving polynomial systems over semialgebraic sets represented by cylindrical algebraic formulas. In: Proc. of ISSAC 2012, pp. 335–342. ACM (2012)
Wilson, D.J.: Real geometry and connectedness via triangular description: Cad example bank (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Chen, C., Maza, M.M. (2015). Simplification of Cylindrical Algebraic Formulas. In: Gerdt, V., Koepf, W., Seiler, W., Vorozhtsov, E. (eds) Computer Algebra in Scientific Computing. CASC 2015. Lecture Notes in Computer Science(), vol 9301. Springer, Cham. https://doi.org/10.1007/978-3-319-24021-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-24021-3_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24020-6
Online ISBN: 978-3-319-24021-3
eBook Packages: Computer ScienceComputer Science (R0)