Didier

Email: MailTo(dfdeshom AT SPAMFREE gmail DOT com)

Multiplication algorithm

A (slightly) faster multiplication algorithm of univariate polynomnials over R. Currently, this is known as _mul_fateman() in rings/polynomial_element.py but needs to be faster, probably through PARI or PyrexDELTA: I've finally started working on this. See my ext/polynomial_pyx.pyx for a preview. As predicted, the speedup is nice. Only integers are handled for now.

DELTA: Martin suggested working directly from ntl_ZZ integers. Will have to investigate this.

DELTA: The implementation is done (07/06), as expected, it's slower over ZZ and QQ but faster over RR

DELTA: Correcting bug: handling of polys with big (10^6) coefficients. It's really slow for bigger rational coefficients

RealLib inclusion

DELTA: Some AMD64 compilation problems prevent me from working on this on the sage server.

DELAT: Thanks to Dr Lambov, this now compiles on 386 and AMD64. I've built a new version and posted patches.

Tweaking Hermes

Logging of sessions using mathml through hermes:

Logging of pictures in dvi and mathml logger.

DELTA: Currently doesn't compile on AMD64!

DELTA: Actually, it does after some modifications by Martin.

cimport-ing RealNumber types

Kinda annoying and unituitive (from a user's POV) of why you cannot do "cimport mpfr"

DELTA: done, submitted as a patch for possible inclusion

IDEAS/Wishlist for SAGE

easily generate random polynomials over rings

* Just a shorthand fucntions that doesnt male me write this every time: sage: x = ZZ['x'].gen() ; h = sum([randint(105,106)*x^i for i in range(1000)]); * should look like:

* See "Random elements" on SAGE projects page

doctest status script

Does each method have an example? Instead of checking by hand a handy script could be used

Automatic build+testing

* sage -br is nice, but how about an option to also run tests on any file that is being rebuilt?