Intermediate coefficient swell is a well-known difficulty with Buchberger's algorithm for computing Gröbner bases over the rational numbers. p-Adic and modular methods have been successful in limiting intermediate coefficient growth in other computations, and in particular in the Euclidian algorithm
✦ LIBER ✦
Invariant G2V algorithm for computing SAGBI-Gröbner bases
✍ Scribed by Amir Hashemi, M.-Alizadeh Benyamin, Monireh Riahi
- Book ID
- 120796494
- Publisher
- SP Science China Press
- Year
- 2012
- Tongue
- English
- Weight
- 254 KB
- Volume
- 56
- Category
- Article
- ISSN
- 1674-7283
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Modular algorithms for computing Gröbner
✍
Elizabeth A. Arnold
📂
Article
📅
2003
🏛
Elsevier Science
🌐
English
⚖ 190 KB
On the use of Buchberger criteria in G2V
✍
Vladimir P. Gerdt, Amir Hashemi
📂
Article
📅
2013
🏛
SP MAIK Nauka/Interperiodica
🌐
English
⚖ 276 KB
Involutive method for computing Gröbner
✍
V. P. Gerdt; M. V. Zinin
📂
Article
📅
2008
🏛
SP MAIK Nauka/Interperiodica
🌐
English
⚖ 235 KB
A Gröbner-Bases Algorithm for the Comput
✍
Mansour Aghasi, Benyamin M.-Alizadeh, Joël Merker…
📂
Article
📅
2011
🏛
Springer
🌐
English
⚖ 485 KB
Fraction-free algorithm for the computat
✍
Viktor Levandovskyy; Kristina Schindelar
📂
Article
📅
2012
🏛
Elsevier Science
🌐
English
⚖ 342 KB
Gröbner Bases for the Rings of Special O
✍
M Domokos; V Drensky
📂
Article
📅
2001
🏛
Elsevier Science
🌐
English
⚖ 110 KB
We present a Gröbner basis for the ideal of relations among the standard generators of the algebra of invariants of the special orthogonal group acting on k-tuples of vectors. The cases of SO 3 and SO 4 are interpreted in terms of the algebras of invariants and semi-invariants of k-tuples of 2 × 2 m