Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis
From MaRDI portal
Publication:2392952
DOI10.1007/S11425-012-4404-0zbMATH Open1272.13026OpenAlexW1998550351MaRDI QIDQ2392952FDOQ2392952
Xiao-Dong Ma, Dingkang Wang, Yao Sun
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
Recommendations
- A modular method to compute the rational univariate representation of zero-dimensional ideals
- 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
- Computing PUR of zero-dimensional ideals of breadth at most one
- Root isolation of zero-dimensional polynomial systems with linear univariate representation
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Cites Work
- Solving zero-dimensional systems through the rational univariate representation
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Gröbner bases of ideals defined by functionals with an application to ideals of projective points
- Title not available (Why is that?)
- An efficient algorithm for factoring polynomials over algebraic extension field
- A modular method to compute the rational univariate representation of zero-dimensional ideals
- Root isolation of zero-dimensional polynomial systems with linear univariate representation
- Algorithms for computing the global infimum and minimum of a polynomial function
- Ideal basis and primary decompositions: case of two variables
- Separating element computation for the rational univariate representation with short coefficients in zero-dimensional algebraic varieties
- On the computation of an arrangement of quadrics in 3D
- Improved algorithms for computing determinants and resultants
- Rational univariate reduction via toric resultants
Cited In (8)
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
- A simplified rational representation for positive-dimensional polynomial systems and SHEPWM equations solving
- Computing PUR of zero-dimensional ideals of breadth at most one
- Title not available (Why is that?)
- Root isolation of zero-dimensional polynomial systems with linear univariate representation
- The invertibility of rational univariate representations
- Separating element computation for the rational univariate representation with short coefficients in zero-dimensional algebraic varieties
- An improvement of the rational representation for high-dimensional systems
Uses Software
This page was built for publication: Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392952)
