Sparse FGLM using the block Wiedemann algorithm
| Autor: | Éric Schost, Seung Gyu Hyun, Hamid Rahkooy, Vincent Neiger |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Ideal (set theory)
Block Wiedemann algorithm Degree (graph theory) Computer science Computation 010102 general mathematics 0102 computer and information sciences General Medicine Term (logic) Lexicographical order 01 natural sciences Combinatorics Gröbner basis 010201 computation theory & mathematics 0101 mathematics Representation (mathematics) |
| Zdroj: | ACM Communications in Computer Algebra. 52:123-125 |
| ISSN: | 1932-2240 |
| DOI: | 10.1145/3338637.3338641 |
| Popis: | Overview. Computing the Gröbner basis of an ideal with respect to a term ordering is an essential step in solving systems of polynomials; in what follows, we restrict our attention to systems with finitely many solutions. Certain term orderings, such as the degree reverse lexicographical ordering ( degrevlex ), make the computation of the Gröbner basis faster, while other orderings, such as the lexicographical ordering ( lex ), make it easier to find the coordinates of the solutions. Thus, one typically first computes a Gröbner basis for the degrevlex ordering, and then converts it to either a lex Gröbner basis or a related representation, such as Rouillier's Rational Univariate Representation [8]. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|