Advances in Cylindrical Algebraic Decomposition


Wilson, D., 2014. Advances in Cylindrical Algebraic Decomposition. Thesis (Doctor of Philosophy (PhD)). University of Bath.

Related documents:

PDF (Cylindrical Algebraic Decomposition - David John Wilson) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (2918kB) | Preview


    Since their conception by Collins in 1975, Cylindrical Algebraic Decompositions (CADs) have been used to analyse the real algebraic geometry of systems of polynomials. Applications for CAD technology range from quantifier elimination to robot motion planning. Although of great use in practice, the CAD algorithm was shown to have doubly exponential complexity with respect to the number of variables for the problem, which limits its use for large examples. Due to the high complexity of CAD, much work has been done to improve its performance. In this thesis new advances will be discussed that improve the practical efficiency of CAD for a variety of problems, with a new complexity result for one set of algorithms. A new invariance condition, truth table invariance (TTICAD), and two algorithms to construct TTICADs are given and shown to be highly efficient. The idea of restricting the output of CADs, allowing for greater efficiency, is formalised as sub-decompositions and two particular ideas are investigated in depth. Efficient selection of various formulation choices for a CAD problem are discussed, with a collection of heuristics investigated and machine learning applied to assist in choosing an optimal heuristic. The mathematical expression of a problem is shown to be of great importance, with preconditioning and reformulation investigated. Finally, these advances are collected together in a general framework for applying CAD in an efficient manner to a given problem. It is shown that their combination is not cumulative and care must be taken. To this end, a prototype software CADassistant is described to help users take advantage of the advances without knowledge of the underlying theory. The effects of the various advances are demonstrated through a guiding example originally considered by Solotareff, which describes the approximation of a cubic polynomial by a linear function. Naïvely applying CAD to the problem takes 916.1 seconds of construction (from which a solution can easily be derived), which is reduced to 20.1 seconds by combining various advances from this thesis.


    Item Type Thesis (Doctor of Philosophy (PhD))
    CreatorsWilson, D.
    Uncontrolled Keywordscylindrical algebraic decomposition,computer algebra,real algebraic geometry
    DepartmentsFaculty of Science > Computer Science
    Publisher Statementdjwthesis.pdf: © The Author
    ID Code42577


    Actions (login required)

    View Item

    Document Downloads

    More statistics for this item...