Root isolation of zero-dimensional polynomial systems with linear univariate representation

DOI10.1016/j.jsc.2011.12.011zbMath1254.65064OpenAlexW2160976370MaRDI QIDQ420751

Xiao-Shan Gao, Leilei Guo, Jin-San Cheng~

Publication date: 23 May 2012

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2011.12.011

zbMATH Keywords

Gröbner basislinear univariate representationlocal generic positionroot isolationzero-dimensional polynomial system

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Numerical computation of roots of polynomial equations (65H04)

Related Items

Strong $\mu$-Bases for Rational Tensor Product Surfaces and Extraneous Factors Associated to Bad Base Points and Anomalies at Infinity ⋮ Certified numerical real root isolation for bivariate nonlinear systems ⋮ Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis ⋮ The complexity of subdivision for diameter-distance tests ⋮ Globally certified \(G^1\) approximation of planar algebraic curves ⋮ Certified rational parametric approximation of real algebraic space curves with local generic position method ⋮ A generic position based method for real root isolation of zero-dimensional polynomial systems ⋮ Real Root Isolation of Polynomial Equations Based on Hybrid Computation

Uses Software

• Kronecker
• ISOLATE
• Lgp

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing primitive elements of extension fields
• Derived eigenvalues of symmetric matrices, with applications to distance geometry
• Complete numerical isolation of real roots in zero-dimensional triangular systems
• An efficient algorithm for the stratification and triangulation of an algebraic surface
• Solving systems of algebraic equations by a general elimination method
• Résolution des systèmes d'équations algébriques
• On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
• Solving zero-dimensional systems through the rational univariate representation
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Root isolation for bivariate polynomial systems with local generic position method
• The DMM bound
• An Exact Method for Finding the Roots of a Complex Polynomial
• A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane
• Mathematics of Surfaces XI
• Algorithms in real algebraic geometry
• A Gröbner free alternative for polynomial system solving

This page was built for publication: Root isolation of zero-dimensional polynomial systems with linear univariate representation