CVSROOT: /cvs/purrs
Module name: purrs
Changes by: pescetti(a)cs.unipr.it 2004-10-16 18:42:05
Modified files:
src : compute_prod.cc
Log message:
Honor lower bound when it is greater than 1 instead of silently
ignoring it. New special product \prod_{a=1}^n (3*a-1)(3*a-2).
Patches:
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/purrs/src/compute_prod.cc.diff?cv…
CVSROOT: /cvs/purrs
Module name: purrs
Changes by: pescetti(a)cs.unipr.it 2004-10-15 18:44:45
Modified files:
src : zeilberger.cc
Log message:
Workaround: PURRS is very picky when dealing with initial conditions,
Zeilberger not at all.
Patches:
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/purrs/src/zeilberger.cc.diff?cvsr…
CVSROOT: /cvs/purrs
Module name: purrs
Changes by: pescetti(a)cs.unipr.it 2004-10-15 18:43:43
Modified files:
src : rr_classifier.cc
Log message:
Behave properly when given a recurrence defined as a function of the
FOLLOWING terms - this often happens in Zeilberger.
Patches:
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/purrs/src/rr_classifier.cc.diff?c…
CVSROOT: /cvs/purrs
Module name: purrs
Changes by: zaccagnini(a)cs.unipr.it 2004-10-15 15:28:28
Modified files:
src : compute_prod.cc
Log message:
Slightly amended some comments.
Added the case that deals with the simplifications of products of the form
prod(a,1,n,2*a-1) which had been overlooked.
Previuosly, only the case prod(a,1,n,2*a+1) had been considered.
This new case leads to more compact solution for the recurrence
x(n) = (-1+2*n)*x(-1+n)
for example.
Patches:
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/purrs/src/compute_prod.cc.diff?cv…
CVSROOT: /cvs/purrs
Module name: purrs
Changes by: pescetti(a)cs.unipr.it 2004-10-14 23:50:57
Modified files:
src : zeilberger.cc
Log message:
Zeilberger functionality complete. We can now find the order of the
telescoped recurrence by trial and error, as it should be.
Patches:
http://www.cs.unipr.it/cgi-bin/cvsweb.cgi/purrs/src/zeilberger.cc.diff?cvsr…
