Computing Cylindrical Algebraic Decomposition via Triangular Decomposition

Simple item page
dc.creatorChen, Changbo
dc.creatorMaza, Marc Moreno
dc.creatorXia, Bican
dc.creatorYang, Lu
dc.date2009-03-30
dc.date.accessioned2026-07-07T12:58:11Z
dc.date.available2026-07-07T12:58:11Z
dc.descriptionCylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approaches for manipulating constructible sets. In this paper, for an arbitrary finite set $F \subset {\R}[y_1, ..., y_n]$ we apply comprehensive triangular decomposition in order to obtain an $F$-invariant cylindrical decomposition of the $n$-dimensional complex space, from which we extract an $F$-invariant cylindrical algebraic decomposition of the $n$-dimensional real space. We report on an implementation of this new approach for constructing cylindrical algebraic decompositions.
dc.description10 pages
dc.identifierhttps://arxiv.org/abs/0903.5221
dc.identifierhttp://arxiv.org/abs/0903.5221
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/225156
dc.subjectSymbolic Computation
dc.titleComputing Cylindrical Algebraic Decomposition via Triangular Decomposition
dc.typetext

Files

Collections

arXiv