๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Interval Arithmetic in Cylindrical Algebraic Decomposition

โœ Scribed by George E. Collins; Jeremy R. Johnson; Werner Krandick


Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
237 KB
Volume
34
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

โœฆ Synopsis


Cylindrical algebraic decomposition requires many very time consuming operations, including resultant computation, polynomial factorization, algebraic polynomial gcd computation and polynomial real root isolation. We show how the time for algebraic polynomial real root isolation can be greatly reduced by using interval arithmetic instead of exact computation. This substantially reduces the overall time for cylindrical algebraic decomposition.


๐Ÿ“œ SIMILAR VOLUMES


Improved Projection for Cylindrical Alge
โœ Christopher W. Brown ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 358 KB

McCallum's projection operator for cylindrical algebraic decomposition (CAD) represented a huge step forward for the practical utility of the CAD algorithm. This paper presents a simple theorem showing that the mathematics in McCallum's paper actually point to a better projection operator than he pr

Local Box Adjacency Algorithms for Cylin
โœ Scott M c Callum; George E. Collins ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 372 KB

We describe new algorithms for determining the adjacencies between zero-dimensional cells and those one-dimensional cells that are sections (not sectors) in cylindrical algebraic decompositions (cad). Such adjacencies constitute a basis for determining all other cell adjacencies. Our new algorithms

Modular Arithmetic for Linear Algebra Co
โœ I.Z. Emiris; V.Y. PAN; Y. YU ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 528 KB

The aim of this work is to decrease the bit precision required in computations without affecting the precision of the answer, whether this is computed exactly or within some tolerance. By precision we understand the number of bits in the binary representation of the values involved in the computatio