A cluster-based cylindrical algebraic decomposition algorithm

  • Authors:

  • Dennis S. Arnon

  • Affiliations:

  • Xerox PARC, 3333 Coyote Hill Road, Palo Alto, California 94304, U.S.A.

  • Venue:
  • Journal of Symbolic Computation
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract

Let A @? Z [x"1,000, x"r be a finite set. An A-invariant cylindrical algebraic decomposition (cad) is a certain partitlon of r-dlmensional euclidean space E^r into semi-algebralc cells such that the value of each A"i @? A has constant sign (positive, negative, or zero) throug|umt each cell. Two cells are adjacent if their union is connected. Recently a number of mathoda have been given for augmenting Colllns' cad construction algorithm (1975), so that in addition to specifying the cell~ that comprise a cad, it identifies the pairs of adjacent cells. Assuming the availability of such an adjacency algorithm, in this paper we give a modified cad construction algorithm based on the utillzatloa of clusters of cells in a cad (a cluster is a collection of cells whose union is connected). Preliminary observations indicate that the 11ew algorithm can be significantly more efficient in some cases than the original, although in other examples it is somewhat less efficient.