HI all,

Here is an excerpt of a procedure I am working on:

>for i from 0 to N while T[i] <= rb do

>......

>Calculations

>.....

>X[1+i] := evalf(F(T[i],X[i]),15);
>T[1+i] := evalf(T[i]+h, 15);
>end do:

where rb is the rignt boundery

For example, if N equal 1000, knowing that X(T[0])=X[0] and F is an arrow procedure that depends on T[i] and X[i],  I will have 1001 elements that I could put in a list like:

[  [t[0],X[0]], [t[1],X[1]], ....]

Hi everybody,

Hi all,

I have the following ODE

Hi Everybody,

Suppose I have this procedure assign to p:

>p:=MyProc(args1,args2,args3,h) statement end proc:

where h is the step size.

args1 = {ode,ic} , args2 = x(t) et args3 = t=a..b.  The output of MyProc is a list of list

I would like to do what dsolve do when you write:

p:=dsolve( {ode,ic},x(t),x(t),numeric)

and then evaluate p(2) for example.

Hi all,

Suppose that you want to solve x'(t)=f(x,t)   x(t0)=x0

The theory show that:

x(t+h)=x(t)+1/2*h*(F1+F2) where F1=f(x,t) and F2=f(x+F1,t+h)

SO I made procedure: