Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis

DOI10.1007/s11425-012-4404-0zbMath1272.13026MaRDI QIDQ2392952

Yao Sun, Xiao-Dong Ma, Ding-Kang Wang

Publication date: 5 August 2013

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-012-4404-0

zbMATH Keywords

Gröbner basis; zero-dimensional ideals; PUR; RUR

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)

Uses Software

• ISOLATE

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient algorithm for factoring polynomials over algebraic extension field
• Root isolation of zero-dimensional polynomial systems with linear univariate representation
• Algorithms for computing the global infimum and minimum of a polynomial function
• On the computation of an arrangement of quadrics in 3D
• Solving zero-dimensional systems through the rational univariate representation
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Improved algorithms for computing determinants and resultants
• A modular method to compute the rational univariate representation of zero-dimensional ideals
• Ideal basis and primary decompositions: case of two variables
• Gröbner bases of ideals defined by functionals with an application to ideals of projective points
• Rational univariate reduction via toric resultants