-
-
Notifications
You must be signed in to change notification settings - Fork 570
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Speed up the computation of the Hilbert basis of a cone #11312
Comments
This comment has been minimized.
This comment has been minimized.
Work Issues: non-full-dimensional errors |
comment:2
The speed-up looks impressive! About 20x on trivial examples (no surprise here since we are avoiding system calls to both cdd and PALP), on a "complicated" 6-d example that I picked the new version worked for 15sec and the old one didn't finish before my patience ran out ;-) Am I right that this speed is partially due to taking into account the special structure of the polytopes in which you are computing integral points? There are, however, issues with non-full-dimensional cones::
|
Reviewer: Andrey Novoseltsev |
comment:3
I think I'm just implementing the same algorithm as PALP would use to enumerate the points in the parallelotope spanned by the rays, though I'm not sure. Essentially you have to compute the Smith form to enumerate the points, the rest is a simple loop. I'll try to get some more info about Palp's inner workings out of Harald Skarke at the Kreuzer Memorial conference. And thanks for catching the non-full dimensional cone bug, I should have thought about that but didn't. |
comment:4
Fixed:
|
comment:5
On further thought, I think its better to also remove non-primitive vectors from the semigroup generators. The new version of the patch saves a few generators, which should speed up the Hilbert basis a little bit. |
comment:6
New version of the patch breaks out the |
Changed work issues from non-full-dimensional errors to none |
Work Issues: One long test fails in cone module |
Changed keywords from none to sd31 |
comment:9
As the patch has to be adjusted one more time anyway - what do you think about creating some kind of |
comment:10
Ah, this particular function is moved to another place in the next patch anyway! |
Updated patch |
comment:11
Attachment: trac_11312_speed_up_Hilbert_cone.patch.gz Good catch! I fixed the offending doctest. Up to the ordering the Hilbert bases before and after the patch are the same, of course. |
comment:12
All works now! |
Two corrections to REST formatting |
Changed work issues from One long test fails in cone module to none |
This comment has been minimized.
This comment has been minimized.
comment:13
Attachment: trac_11312_speed_up_Hilbert_cone.2.patch.gz I have made tiny adjustments to the patch to make the documentation compile without warnings, I'll leave it at positive review. (Added one column and replaced a quote with a backward one.) Volker: subsequent patches may need to be rebased. |
Merged: sage-4.7.2.alpha0 |
My first implementation of the Hilbert basis eventually uses PALP to compute the points in the parallelotope spanned by the rays of a simplicial cone. This can be done much faster with just the Smith normal form of the ray matrix.
This makes it easy to compute the points in the semi-open parallelotope, so the actual number of semigroup generators is sometimes less than the PALP version (which computed the integral points in the closure). As a pleasant side effect, arbitrary dimension cones work now as we are no longer limited to PALP's compile-time bounds.
Apply:
CC: @novoselt @zafeirakopoulos
Component: geometry
Keywords: sd31
Author: Volker Braun
Reviewer: Andrey Novoseltsev
Merged: sage-4.7.2.alpha0
Issue created by migration from https://trac.sagemath.org/ticket/11312
The text was updated successfully, but these errors were encountered: