When building a cylindrical algebraic decomposition (CAD) savings can be made in the presence of an equational constraint (EC): an equation logically implied by a formula. The present paper is concerned with how to use multiple ECs, propagating those in the input throughout the projection set. We improve on the approach of McCallum in ISSAC 2001 by using the reduced projection theory to make savings in the lifting phase (both to the polynomials we lift with and the cells lifted over). We demonstrate the benefits with worked examples and a complexity analysis.
|Publication status||Published - 2015|
|Event||40th International Symposium on Symbolic and Algebraic Computation (ISSAC) - The University of Bath, Bath, United Kingdom|
Duration: 6 Jul 2015 → 9 Jul 2015
|Conference||40th International Symposium on Symbolic and Algebraic Computation (ISSAC)|
|Period||6/07/15 → 9/07/15|
- cylindrical algebraic decomposition
- equational constraint