Solving algebraic equations: Combining Buchberger's algorithm with multivariate factorization
type: Item
instance of: scholarly article
title: Solving algebraic equations: Combining Buchberger's algorithm with multivariate factorization
zbMATH Open document ID: 0668.68033
DOI: 10.1016/S0747-7171(89)80005-7
author: S. H. Smith
published in: Journal of Symbolic Computation
publication date: 1989-01-01T00:00:00Z
review text: A modification of the algorithm reducing the Gröbner bases in a polynomial ideal is described. It uses the lexicographical term ordering and involves multivariate polynomial factoring as a subroutine. The author claims that this algorithm is better suited for solving algebraic equations.
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 13B25
zbMATH DE Number: 4094795
zbMATH Keywords: Gröbner bases
zbMATH Keywords: polynomial ideal
zbMATH Keywords: lexicographical term ordering
zbMATH Keywords: polynomial factoring
zbMATH Keywords: algebraic equations
MaRDI profile type: Publication
cites work: Some examples for solving systems of algebraic equations by calculating Gröbner bases
cites work: Q3325832
cites work: Q3714165
cites work: Solving algebraic equations via Buchberger's algorithm
cites work: A heuristic irreducibility test for univariate polynomials
cites work: Q3703294
description: scientific article; zbMATH DE number 4094795