Parallel modular computation of Gröbner and involutive bases

DOI10.1134/S0361768813020084zbMATH Open1323.68631MaRDI QIDQ2017756FDOQ2017756

D. A. Yanovich

Publication date: 23 March 2015

Published in: Programming and Computer Software (Search for Journal in Brave)

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Parallel algorithms in computer science (68W10)

Cites Work

• Involutive bases of polynomial ideals
• Modular algorithms for computing Gröbner bases.
• Parallelization of modular algorithms
• Involutive divisions of monomials
• Mapping integers and Hensel codes onto Farey fractions
• Parallel computation of Janet and Gröbner bases over rational numbers

Cited In (7)

• Parallel Processing and Applied Mathematics
• Parallelization of an algorithm for computation of involutive Janet bases
• Computation of involutive and Gröbner bases using the tableau representation of polynomials
• Modular algorithms for computing Gröbner bases.
• Modular computations of standard bases for subalgebras
• Title not available (Why is that?)
• Compact representation of polynomials for algorithms for computing Gröbner and involutive bases

Uses Software

• PoSSo

   Recommendations

• Parallelization of an algorithm for computation of involutive Janet bases 👍 👎
• Parallelization of modular algorithms 👍 👎
• Parallel algorithms for Gröbner-basis construction 👍 👎
• Extended parallelism in the Gröbner basis algorithm 👍 👎
• Modular techniques for noncommutative Gröbner bases 👍 👎

This page was built for publication: Parallel modular computation of Gröbner and involutive bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2017756)