Solving algebraic equations: Combining Buchberger's algorithm with multivariate factorization (Q1118397)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4094795
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving algebraic equations: Combining Buchberger's algorithm with multivariate factorization |
scientific article; zbMATH DE number 4094795 |
Statements
Solving algebraic equations: Combining Buchberger's algorithm with multivariate factorization (English)
0 references
1989
0 references
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.
0 references
Gröbner bases
0 references
polynomial ideal
0 references
lexicographical term ordering
0 references
polynomial factoring
0 references
algebraic equations
0 references
0.7572315335273743
0 references
0.7354785203933716
0 references
0.7263177633285522
0 references
0.7260509133338928
0 references
