Paulo Ney de Souza wrote:
>
> Richard Fateman: Do you know of anyone else that has possible
> improvements from these times of separate codes, that could be
> brought in Maxima ?
>
> Paulo Ney
>
I don't know if Paul Wang from Kent State University is on this
list, but he wrote a few programs that may not have made it
into Schelter's code. In particular some enhancements to
polynomial factorization (written in C).
As far as stuff done at Berkeley, I have a few pieces of
code written in C that could be interfaced to Maxima related
to FFT-based polynomial arithmetic, as well as interfaces
to the aribtrary-precision float MPFUN. These were not written
with GCL or CLISP in mind. I also have a (lisp) package that
could be used to make the simplifier run, in some cases, many
times faster: this is based on hashtables to represent very
large sums. While experiments show it can be even 100 times
faster, it is probably not ready for "prime time".
I also have integration look-up code, though it is not
really macsyma-oriented, rather it is a web server. The
idea is: if you have a problem, look it up in our table.
(20 millisecs). If you find it, go away happy. If you don't
find it, run some algorithms.
I would still like to figure some way of getting the
commercial macsyma improvements into maxima.
In any of these efforts (my own included) there is always
the danger of someone saying "I have a really good replacement
for the X module" when in reality it is in almost all
ways inferior. A valuable component of this group
effort would be thorough testing. Presumably the
commercial people developed test suites.
RJF