Decomposing algebraic sets using Gröbner bases

DOI10.1016/0167-8396(89)90027-7zbMath0681.65030OpenAlexW2165153119MaRDI QIDQ1823621

C. Andrew Neff

Publication date: 1989

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8396(89)90027-7

zbMATH Keywords

Gröbner basespolynomial factorizationirreducible componentssymbolic algorithmgeometric designpolynomial idealcomputer aidedCAGD systems

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Polynomials in number theory (11C08) Algorithms for approximation of functions (65D15) Descriptive geometry (51N05)

Related Items (2)

An algorithm for solving parametric linear systems ⋮ Irreducible decomposition of algebraic varieties via characteristic sets and Gröbner bases

Uses Software

• IBM Scratchpad

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the application of Buchberger's algorithm to automated geometry theorem proving
• Using Gröbner bases to reason about geometry problems
• Factoring polynomials with rational coefficients
• The decomposition theorem for ideals in polynomial rings over a domain
• Factoring Multivariate Polynomials over Algebraic Number Fields
• Automatic parsing of degenerate quadric-surface intersections

This page was built for publication: Decomposing algebraic sets using Gröbner bases