[GiNaC-devel] Volunteer to continue the work on NTL factorisation bindings

[Remco Bloemen]

I have created a simple factorisation for polynomials in Q[x] with real roots 
(source attached, based on [2]) but it's really slow. Creating a reasonable 
implementation would require much work.

An NTL based implementation would be very powerfull and feasible, as said in 
[1]. I would like to volunteer to continue this work.

I have the following questions:

1) Where can I obtain the source of this binding?
   (or should I start from the code in gTybalt, or from scratch?)

2) Is there any chance such a patch will be included?
    (this would imply dependecy on NTL)

2a) And if it is compile-time optional?

2b) And if it also included integration of rational functions?

2c) And if it also included integration of trancedental functions?

3) Do you have any related advice, hints or pointers?

[1] http://www.ginac.de/pipermail/ginac-devel/2004-August/000695.html
[2] http://yacas.sourceforge.net/Algochapter3.html
-------------- next part --------------
A non-text attachment was scrubbed...
Name: factor_ginac.cpp
Type: text/x-c++src
Size: 5194 bytes
Desc: not available
Url : http://www.cebix.net/pipermail/ginac-devel/attachments/20070828/1b9f37a1/factor_ginac.bin