Cylindrical Algebraic Decomposition using validated numerics

• Autores: A. Strzebonski
• Localización: Journal of symbolic computation, ISSN 0747-7171, Vol. 41, Nº 9, 2006, págs. 1021-1038
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • Abstract We present a version of the Cylindrical Algebraic Decomposition (CAD) algorithm which uses interval sample points in the lifting phase, whenever the results can be validated. This gives substantial time savings by avoiding computations with exact algebraic numbers. We use bounds based on Rouche¿s theorem combined with information collected during the projection phase and during construction of the current cell to validate the singularity structure of roots. We compare empirically our implementation of this variant of CAD with implementations of CAD using exact algebraic sample points (our and QEPCAD) and with our implementation of CAD using interval sample points with validation based solely on interval data.