Dear John,
On Nov 4, 1:45 pm, "John Cremona" <[EMAIL PROTECTED]> wrote:
> Is it recomputing a Grobner basis for the new ideal? That could be slow.
No, it is simply
> > singular.eval( I.name()+'[%d]' = '%(sz)+p.name())
where sz is ncols(I)+1, and p is a polynomial.
Of course, that line of code is part of a bigger computation. So, why
do i think that this line is critical? When i observed that the whole
computation got stuck, i inserted various "print" commands into my
code - and it turned out that the print command in front of the above
line was executed, but the print command after the line wasn't. So, i
conclude that it is surprizingly difficult to put <p> into the
position <sz> of <I>, while all other commands (including groebner
basis computation) were easy.
Probably it'd be the best to make a singular log and send you the log
file, right?
Yours
Simon
--~--~---------~--~----~------------~-------~--~----~
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-support
URLs: http://sage.math.washington.edu/sage/ and http://sage.scipy.org/sage/
-~----------~----~----~----~------~----~------~--~---
