On Thu, 04 Jan 2007 13:40:19 -0800, Bill Hart <[EMAIL PROTECTED]> wrote:
David Harvey wrote:
It occured to me that the best way to provide this stuff directly to
SAGE, and improve a whole raft of other things is to include our code
in the SAGE version of Pari. But it occurs to me (just now) that this
might be ill advised, given that many SAGE objects are not implemented
through Pari, but through NTL. Unfortunately, integrating our code into
NTL is not an option.
I'm happy if people think they can write wrappers etc in time, to have
SAGE just work directly with FLINT objects. Polynomial multiplication
should be working by Monday-ish. But how I proceed might depend on what
people think about this. So, should I:
a) Try and incorporate FLINT into the SAGE pari; or
b) Keep writing FLINT and let someone else figure out how to
incorporate FLINT directly.
The advantage of (a) is that heaps of stuff gets sped up, since heaps
of stuff in Pari is built on polynomial arithmetic. The disadvantage is
that some NTL stuff will want to be changed over to Pari stuff in SAGE.
The advantage of (b) is probably a faster end product and less work for
me. The disadvantage is it only benefits basic arithmetic, i.e.
factoring, polynomial multiplication and integer multiplication and
stuff *in SAGE* that depends on any of the above.
I greatly prefer (a). Less of SAGE uses NTL than you might think, and using
PARI in those places is easier (generally using PARI for SAGE is quite easy).
Also, it will be tremendously exciting that the PARI included in SAGE will
be much faster than the stand-alone PARI :-).
William
--~--~---------~--~----~------------~-------~--~----~
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-devel
URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/
-~----------~----~----~----~------~----~------~--~---
