Solving algebraic equations: Combining Buchberger's algorithm with multivariate factorization

DOI10.1016/S0747-7171(89)80005-7zbMath0668.68033MaRDI QIDQ1118397

S. H. Smith

Publication date: 1989

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

zbMATH Keywords

Gröbner basesalgebraic equationspolynomial factoringpolynomial ideallexicographical term ordering

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials over commutative rings (13B25)

Related Items (5)

Unnamed Item ⋮ Computing global minima to polynomial optimization problems using Gröbner bases ⋮ A factorization algorithm for \(G\)-algebras and its applications ⋮ Constructive algebra methods for the \(L_ 2\)-problem for stable linear systems ⋮ Primary Decomposition in Singular

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some examples for solving systems of algebraic equations by calculating Gröbner bases
• A heuristic irreducibility test for univariate polynomials
• Solving algebraic equations via Buchberger's algorithm

This page was built for publication: Solving algebraic equations: Combining Buchberger's algorithm with multivariate factorization