[Maxima] is there a gospel algorithm in maxima?
miguel39123 at hotmail.com
Wed Dec 20 12:21:26 CST 2006
miguel lopez <miguel39123 <at> hotmail.com> writes:
> I suppose that recurrence to determine taylor = 0 in special cases would be
> reduced to gospel algorithm.
> I remember that there is free packages available.
>From the maxima mail:
Martin RUBEY rubey at labri.fr
Mon, 25 Nov 2002 11:20:28 +0100 (CET)
At the RISC in Linz, the Zeilberger METHOD was implemented for macsyma,
maxima, mma, maple and is known as "fast Zeilberger". Wegschaider
described and implemented a multisum version of "Sister Celine's technique
to find a homogeneous polynomial recurrence relation for the sum."
Again: I think you have to distinguish between maths and implementation. I
wrote to Fabricio Caruso some time ago whether he would free his maxima
implementation, but he did not respond. So I think we have to do it
Petkovsek et al. (1996) describe Gosper algorithm as "one of the landmarks in
the history of computerization of the problem of closed form summation."
Gosper's algorithm is vital in the operation of Zeilberger's algorithm and the
machinery of Wilf-Zeilberger pairs.
Following the post of R. Fateman:
I think symbolic integration via taylor takes the same route as symbolic
summation when restricted to rational recurrences in the coefficient of the
I beg your perdon for so much mailing today. This is the last one for today.
Thanks for your patient. (to the reader).
More information about the Maxima