search

svrnm / parallelGBC

Parallel Groebner Basis Computation
GNU General Public License v3.0
19 stars 5 forks source link

can this program calculate the Groebner Basis in rational number field rather than finite field, such as Z_{32003}?. #1

Closed zhangyusi-hub closed 5 months ago

zhangyusi-hub commented 5 months ago

Hello Severin, I do a research in the polynomial embedded system, I want to ask you can this program calculate the Groebner Basis in rational number field rather than finite field, such as Z_{32003}?.

svrnm commented 5 months ago

Hey @zhangyusi-hub,

unfortunately no, this code is optimized for computations over finite fields, because with this restriction the most computation time is spend in matrix multiplication, which is optimized in this project. If you remove this restriction and compute over rational numbers, the complexity moves over to the computation of individual numbers in the matrix cells.

As you can see from this project I am not involved with Gröbner basis computation for a long while, to get more recent insights, you might check various projects by researchers like @ederc, or checkout https://github.com/oscar-system and https://github.com/Singular

zhangyusi-hub commented 5 months ago

thanks for your recommendation.

ederc commented 5 months ago

@zhangyusi-hub You can give msolve a try. It includes GB computations and system solving over finite fields and QQ.

svrnm commented 5 months ago

thanks for following up @ederc :-)

zhangyusi-hub commented 5 months ago

@ederc thanks