A generic position based method for real root isolation of zero-dimensional polynomial systems
From MaRDI portal
Publication:480656
DOI10.1016/j.jsc.2014.09.017zbMath1304.13048arXiv1312.0462OpenAlexW2048055604MaRDI QIDQ480656
Publication date: 9 December 2014
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.0462
Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05)
Related Items (8)
Certified numerical real root isolation for bivariate nonlinear systems ⋮ On the complexity of computing the topology of real algebraic space curves ⋮ On the topology and isotopic meshing of plane algebraic curves ⋮ Globally certified \(G^1\) approximation of planar algebraic curves ⋮ Resultant elimination via implicit equation interpolation ⋮ Isotopic meshing of a real algebraic space curve ⋮ Continuous detection of the variations of the intersection curve of two moving quadrics in 3-dimensional projective space ⋮ Representing rational curve segments and surface patches using semi-algebraic sets
Uses Software
Cites Work
- Exact symbolic-numeric computation of planar algebraic curves
- Root isolation of zero-dimensional polynomial systems with linear univariate representation
- On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- A worst-case bound for topology computation of algebraic curves
- Computing primitive elements of extension fields
- Subdivision methods for solving polynomial equations
- Complete numerical isolation of real roots in zero-dimensional triangular systems
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- Solving zero-dimensional systems through the rational univariate representation
- Efficient isolation of polynomial's real roots.
- Radical computations of zero-dimensional ideals and real root counting.
- An algorithm for isolating the real solutions of semi-algebraic systems
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
- Parallel computation of real solving bivariate polynomial systems by zero-matching method
- Root isolation for bivariate polynomial systems with local generic position method
- On the boolean complexity of real root refinement
- Introduction to Interval Analysis
- An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
- On the complexity of solving a bivariate polynomial system
- When Newton meets Descartes
- Real Algebraic Numbers: Complexity Analysis and Experimentation
- Computer Algebra in Scientific Computing
- Computer Algebra in Scientific Computing
- Algorithms in real algebraic geometry
- A Gröbner free alternative for polynomial system solving
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A generic position based method for real root isolation of zero-dimensional polynomial systems
