A fast algorithm for Gröbner basis conversion and its applications

DOI10.1006/jsco.1999.0416zbMath0988.13016OpenAlexW2049537752MaRDI QIDQ1588033

Quoc-Nam Tran

Publication date: 28 February 2001

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

Full work available at URL: https://semanticscholar.org/paper/389b985f9edcfe7f58ab1a95cb2b13381982462e

zbMATH Keywords

term ordersGröbner walkbasic conversion

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (7)

Gröbner systems conversion ⋮ Gröbner fans of \(x\)-homogeneous ideals in \(R [\![ t \!][x]\)] ⋮ Efficient Groebner walk conversion for implicitization of geometric objects ⋮ A new class of term orders for elimination ⋮ The generic Gröbner walk ⋮ Universal characteristic decomposition of radical differential ideals ⋮ Computing the radical of an ideal in positive characteristic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hilbert functions and the Buchberger algorithm
• Surface/surface intersection
• Tracing surface intersections
• Equations for the projective closure and effective Nullstellensatz
• The orthocentric simplex as an extreme simplex
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Converting bases with the Gröbner walk
• On the complexity of Gröbner bases conversion
• The Structure of Polynomial Ideals and Gröbner Bases
• Implicit representation of parametric curves and surfaces

This page was built for publication: A fast algorithm for Gröbner basis conversion and its applications