#5520: [with patch; needs review] implement Pizer's algorithm for computing
Brandt
Modules and Brandt Matrices
---------------------------+------------------------------------------------
Reporter: was | Owner: craigcitro
Type: enhancement | Status: new
Priority: major | Milestone: sage-3.4.1
Component: modular forms | Keywords:
---------------------------+------------------------------------------------
Comment(by was):
NOTE: I found one issue with the massive (10-100 times speedups) for small
linear algebra using PARI, when running a very large computation with this
code (a table of running it for all modabvars of level up to 1000):
http://sage.math.washington.edu/home/wstein/db/compgroup/
In some cases the PARI stack overflows because I guess a matrix is very
small but maybe it's hermite form or a product or something is too big.
The problem is that to do very fast linear algebra it's all done on the
PARI stack, and by default the PARI stack size is too small. The solution
is either to make it bigger by default (not an option), or be much more
conservative about what uses PARI, or to automatically increase it (very
tricky).
I will have to fix the above, though it's nearly orthogonal to the rest of
this patch, so I hope this patch can be reviewed as is anyways.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/5520#comment:9>
Sage <http://sagemath.org/>
Sage - Open Source Mathematical Software: Building the Car Instead of
Reinventing the Wheel
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to
[email protected]
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en
-~----------~----~----~----~------~----~------~--~---
