| 1 2 3 | ||
|
Editor: 127.0.0.1
Time: 2007/11/06 21:12:10 GMT-8 |
||
| Note: copied from axiom-developer | ||
removed:
-
Here is a simple implemention of a recurrence relation operator. It is far from finished, but might serve as a starting point. I experienced the following difficulties:
sum(k,k=1.0..2.5)
| (1) |
sum, rootOf or the like needs to be written.
The operation evalRec is just for a startevalRec needs to be speeded upevalADE doesn't really work concerning evaluationThe pamphlet is rec.spad.pamphlet and the source is rec.spad.
Here is an example:
)lib RECOP
RecurrenceOperator is now explicitly exposed in frame initial RecurrenceOperator will be automatically loaded when needed from /var/zope2/var/LatexWiki/RECOP.NRLIB/code dummy := new()$Symbol;
f := operator 'f;
eq := f(dummy) - f(dummy - 1) - f(dummy - 2);
r:=evalRec(f, dummy, n, n0, eq, [1,1])$RecurrenceOperator(Integer, Expression Integer)
| (2) |
[eval(r, n0=k) for k in 0..10]
| (3) |