Zeros, multiplicities, and idempotents for zero-dimensional systems
Algorithms in algebraic geometry and applications
An efficient method for analyzing the topology of plane real algebraic curves
Selected papers presented at the international IMACS symposium on Symbolic computation, new trends and developments
Fundamental problems of algorithmic algebra
Fundamental problems of algorithmic algebra
Interval arithmetic in cylindrical algebraic decomposition
Journal of Symbolic Computation
Real solution isolation using interval arithmetic
Computers & Mathematics with Applications
Exact geometric-topological analysis of algebraic surfaces
Proceedings of the twenty-fourth annual symposium on Computational geometry
Complete numerical isolation of real roots in zero-dimensional triangular systems
Journal of Symbolic Computation
Root isolation for bivariate polynomial systems with local generic position method
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
The DMM bound: multivariate (aggregate) separation bounds
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
A simple but exact and efficient algorithm for complex root isolation
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Determining the topology of real algebraic surfaces
IMA'05 Proceedings of the 11th IMA international conference on Mathematics of Surfaces
A descartes algorithm for polynomials with bit-stream coefficients
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
Root isolation of zero-dimensional polynomial systems with linear univariate representation
Journal of Symbolic Computation
| Hi-index | 0.00 |
We present an algorithm to isolate the real roots, and compute their multiplicities, of a zero-dimensional triangular polynomial system, based on the local generic position method. We also presentexperiments that demonstrate the efficiency of the method.