A cluster-based cylindrical algebraic decomposition algorithm (Q1105372): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:57, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A cluster-based cylindrical algebraic decomposition algorithm |
scientific article |
Statements
A cluster-based cylindrical algebraic decomposition algorithm (English)
0 references
1988
0 references
Assuming the availability of a cylindrical algebraic decomposition (cad) algorithm that not only determines the cells of the cad but also identifies pairs of adjacent cells, a modified cad algorithm is presented. It uses clusters of cells (a collection of cells whose union is connected) and seems to be more efficient in some cases than the original (but also less efficient in other examples).
0 references
cylindrical algebraic decomposition
0 references
clusters of cells
0 references
