On Thu, 21 Aug 2008 03:28:25 -0700 (PDT) Bill Hart <[EMAIL PROTECTED]> wrote:
<snip> > Also at the end of the pdf you mention that SAGE will use the new > russian library ginv for poly gcd and factorisation. I didn't seem to > be able to find functions in the user's guide in the tarball for the > latest version which mentioned poly gcd or factorisation, though I may > have missed them. I also had a look through the source code and > couldn't find them either, though again I didn't look all that > thoroughly. Look in the files named igcd* in src/ginv/coeff. I looked at the slides after this remark, and that statement about GINV should be changed. GINV [1] is a not so new library for involutive basis algorithms. The copyright statements in the files suggest it was started in 2004. [1] http://invo.jinr.ru/ginv/index.html The factorization code was added by some people from Aachen (the copyright on the files points to Sebastian Jambor), and there is talk about making that part into a separate library. Maybe we should invite them to the Sage days in Nancy? Regarding the "fastest in the world" statement on the slides, GINV unfortunately can't beat magma. I haven't timed it myself yet, but Vladimir Gerdt claims that it's faster than maple. I'll try to post some code to use the ginv gcd from Sage soon. Cheers, Burcin --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
