Solving algebraic equations: Combining Buchberger's algorithm with multivariate factorization
From MaRDI portal
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.
Recommendations
Cites work
- A heuristic irreducibility test for univariate polynomials
- scientific article; zbMATH DE number 3857248 (Why is no real title available?)
- scientific article; zbMATH DE number 3930348 (Why is no real title available?)
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- Solving algebraic equations via Buchberger's algorithm
- Some examples for solving systems of algebraic equations by calculating Gröbner bases
Cited in
(7)- Computing global minima to polynomial optimization problems using Gröbner bases
- A factorization algorithm for \(G\)-algebras and its applications
- Primary decomposition in \textsc{Singular}
- scientific article; zbMATH DE number 1163443 (Why is no real title available?)
- scientific article; zbMATH DE number 1444000 (Why is no real title available?)
- Using Galois ideals for computing relative resolvents
- Constructive algebra methods for the \(L_ 2\)-problem for stable linear systems
This page was built for publication: Solving algebraic equations: Combining Buchberger's algorithm with multivariate factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1118397)