Interval arithmetic in cylindrical algebraic decomposition
From MaRDI portal
Publication:1864882
DOI10.1006/jsco.2002.0547zbMath1007.68210OpenAlexW2084459701MaRDI QIDQ1864882
George E. Collins, Jeremy R. Johnson, Werner Krandick
Publication date: 23 March 2003
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/af4e094a7b1f1ceffca3dc5224444277597605c9
Related Items
Continuous amortization and extensions: with applications to bisection-based root isolation, Blending implicit interval curves and surfaces, An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination, Efficient isolation of polynomial's real roots., A general approach to isolating roots of a bitstream polynomial, SqFreeEVAL: An (almost) optimal real-root isolation algorithm, Cylindrical algebraic decomposition using validated numerics, Real solution isolation using interval arithmetic, From approximate factorization to root isolation with application to cylindrical algebraic decomposition, Clustering complex zeros of triangular systems of polynomials, Real Root Isolation of Regular Chains, An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions, Complete numerical isolation of real roots in zero-dimensional triangular systems, The Voronoi diagram of three lines, An efficient algorithm for the stratification and triangulation of an algebraic surface
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partial cylindrical algebraic decomposition for quantifier elimination
- Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993
- Computing GCDs of polynomials over algebraic number fields
- Interval arithmetic
- Multiprecision floating point addition
