×

zbMATH — the first resource for mathematics

Comprehensive Gröbner bases in a Java computer algebra system. (English) Zbl 1352.68297
Feng, Ruyong (ed.) et al., Computer mathematics. 9th Asian symposium, ASCM 2009, Fukuoka, Japan, December 14–17, 2009, 10th Asian symposium, ASCM 2012, Beijing, China, October 26–28, 2012. Contributed papers and invited talks. Berlin: Springer (ISBN 978-3-662-43798-8/hbk; 978-3-662-43799-5/ebook). 93-108 (2014).
Summary: We present an implementation of the algorithms for computing comprehensive Gröbner bases in a Java computer algebra system (JAS). Contrary to approaches to implement comprehensive Gröbner bases with minimal requirements to the computer algebra system, we aim to provide all necessary algebraic structures occurring in the algorithm. In the implementation of a condition we aim at the maximal semantic exploitation of the occurring algebraic structures: the set of equations that equal zero are implemented as an ideal (with Gröbner base computation) and the set of inequalities are implemented as a multiplicative set which is simplified to polynomials of minimal degrees using squarefree or irreducible decomposition. The performance of our implementation is compared on well-known examples. With our approach we can also make the transition of a comprehensive Gröbner system to a polynomial ring over a regular coefficient ring and test or compute Gröbner bases.
For the entire collection see [Zbl 1309.68008].
MSC:
68W30 Symbolic computation and algebraic computation
13P10 Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
PDF BibTeX XML Cite
Full Text: DOI
References:
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.