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.017zbMATH Open1304.13048OpenAlexW2048055604MaRDI QIDQ480656FDOQ480656
Abstract: We improve the local generic position method for isolating the real roots of a zero-dimensional bivariate polynomial system with two polynomials and extend the method to general zero-dimensional polynomial systems. The method mainly involves resultant computation and real root isolation of univariate polynomial equations. The roots of the system have a linear univariate representation. The complexity of the method is for the bivariate case, where , resp., is an upper bound on the degree, resp., the maximal coefficient bitsize of the input polynomials. The algorithm is certified with probability 1 in the multivariate case. The implementation shows that the method is efficient, especially for bivariate polynomial systems.
Recommendations
- Root isolation for bivariate polynomial systems with local generic position method
- Local Generic Position for Root Isolation of Zero-Dimensional Triangular Polynomial Systems
- An efficient real root isolation algorithm for a zero-dimensional triangular polynomial system
- Certified numerical real root isolation for bivariate polynomial systems
- An elimination method for solving bivariate polynomial systems: eliminating the usual drawbacks
Cites Work
- scientific article; zbMATH DE number 16651 (Why is no real title available?)
- scientific article; zbMATH DE number 52177 (Why is no real title available?)
- scientific article; zbMATH DE number 1206418 (Why is no real title available?)
- scientific article; zbMATH DE number 1253975 (Why is no real title available?)
- scientific article; zbMATH DE number 1253989 (Why is no real title available?)
- scientific article; zbMATH DE number 939802 (Why is no real title available?)
- scientific article; zbMATH DE number 1446863 (Why is no real title available?)
- A Gröbner free alternative for polynomial system solving
- A worst-case bound for topology computation of algebraic curves
- Algorithms in real algebraic geometry
- An algorithm for isolating the real solutions of semi-algebraic systems
- An elimination method for solving bivariate polynomial systems: eliminating the usual drawbacks
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
- Complete numerical isolation of real roots in zero-dimensional triangular systems
- Computer Algebra in Scientific Computing
- Computer Algebra in Scientific Computing
- Computing primitive elements of extension fields
- Efficient isolation of polynomial's real roots.
- Exact symbolic-numeric computation of planar algebraic curves
- Introduction to Interval Analysis
- On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers
- On the Boolean complexity of real root refinement
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- On the complexity of solving a bivariate polynomial system
- On the theory of resolvents and its applications.
- Parallel computation of real solving bivariate polynomial systems by zero-matching method
- Radical computations of zero-dimensional ideals and real root counting.
- Real Algebraic Numbers: Complexity Analysis and Experimentation
- Root isolation for bivariate polynomial systems with local generic position method
- Root isolation of zero-dimensional polynomial systems with linear univariate representation
- Separating element computation for the rational univariate representation with short coefficients in zero-dimensional algebraic varieties
- Solving zero-dimensional systems through the rational univariate representation
- Subdivision methods for solving polynomial equations
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- When Newton meets Descartes
Cited In (18)
- On the complexity of computing the topology of real algebraic space curves
- Parallel computation of real solving bivariate polynomial systems by zero-matching method
- An efficient real root isolation algorithm for a zero-dimensional triangular polynomial system
- Certified numerical real root isolation for bivariate polynomial systems
- Root isolation of zero-dimensional polynomial systems with linear univariate representation
- Root isolation for bivariate polynomial systems with local generic position method
- Representing rational curve segments and surface patches using semi-algebraic sets
- A heuristic method for certifying isolated zeros of polynomial systems
- On \(G^2\) approximation of planar algebraic curves under certified error control by quintic Pythagorean-hodograph splines
- An elimination method for solving bivariate polynomial systems: eliminating the usual drawbacks
- Certified numerical real root isolation for bivariate nonlinear systems
- Globally certified \(G^1\) approximation of planar algebraic curves
- Title not available (Why is no real title available?)
- On the topology and isotopic meshing of plane algebraic curves
- Isotopic meshing of a real algebraic space curve
- Local Generic Position for Root Isolation of Zero-Dimensional Triangular Polynomial Systems
- Continuous detection of the variations of the intersection curve of two moving quadrics in 3-dimensional projective space
- Resultant elimination via implicit equation interpolation
This page was built for publication: A generic position based method for real root isolation of zero-dimensional polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q480656)
