Simple CAD construction and its applications (Q5938543)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1622577
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simple CAD construction and its applications |
scientific article; zbMATH DE number 1622577 |
Statements
Simple CAD construction and its applications (English)
0 references
22 July 2001
0 references
The method of quantifier elimination by cylindrical algebraic decomposition (CAD) takes a formula from the theory of real closed fields as input, and constructs a CAD of the space of unquantified variables. CAD \(B\) is ``simpler'' than CAD \(A\), if each cell in \(B\) is the union of some cells of \(A\). The author presents two algorithms for simplifying the so called truth-invariant CAD algorithm introduced by \textit{G. E. Collins} and \textit{H. Hong} [ibid. 12, No. 3, 299-328 (1991; Zbl 0754.68063)]. Examples are presented which show the performance of this new very fast method.
0 references
quantifier elimination
0 references
cylindrical algebraic decomposition
0 references
algorithms
0 references
performance
0 references
0.8764302134513855
0 references
0.8731817603111267
0 references
0.8521830439567566
0 references
0.849154531955719
0 references
