Adams-Basforth Methods

The Adams-Bashforth methods are multistep methods obtained by the following consideration:

The solution to the initial value problem

[Maple Math] ,

satisfies the equations

[Maple Math] and

[Maple Math]

Therefore,

[Maple Math]

We can then use the Lagrange Interpolating Polynomial through the already obtained data points ( [Maple Math] ) , ( [Maple Math] ),..., ( [Maple Math] ) to estimate the value of the integral. Here, we assume a fixed stepsize [Maple Math] .

>

For example, when using a quadratic interpolating polynomial through ( [Maple Math] ) , ( [Maple Math] ) and ( [Maple Math] )yields:

> P[2]:=interp([t[i]-2*h,t[i]-h,t[i]],[f(t[i-2],w[i-2]),f(t[i-1],w[i-1]),f(t[i],w[i])],tt);

[Maple Math]
[Maple Math]
[Maple Math]

> int1:=int(P[2],tt=t[i]..t[i]+h);

[Maple Math]
[Maple Math]
[Maple Math]
[Maple Math]

> simplify(int1);

[Maple Math]

Which yields the Three-step Adams-Bashforth Method:

[Maple Math] .

In addition, the local truncation error can be determined from the error term of the Lagrange Interpolating Polynomial:

> lagerr:=(D@@3)(f(xi[i],y(xi[i])))*(tt-t[i])*(tt-t[i]+h)*(tt-t[i]+2*h)/3!;

[Maple Math]

Since [Maple Math] does not change sign over the integration interval [Maple Math] , we can use the Weighted Mean Value Theorem so that there exists a [Maple Math] in the interval [Maple Math] such that

> errint:=Int(lagerr,tt=t[i]..t[i]+h):

> errint=(D@@3)(f(nu[i],y(nu[i])))/3!*Int((tt-t[i])*(tt-t[i]+h)*(tt-t[i]+2*h),tt=t[i]..t[i]+h);

[Maple Math]

This yields the error,

> err:=(D@@3)(f(nu[i],y(nu[i])))/3!*int((tt-t[i])*(tt-t[i]+h)*(tt-t[i]+2*h),tt=t[i]..t[i]+h);

[Maple Math]

The truncation error is then given by

[Maple Math] ,

with [Maple Math] the formula on the right-hand-side of the Three-step Adams-Bashforth method, or

[Maple Math] .

>

Similarly, one can obtain formulae and expressions for the corresponding truncation errors for other Adams-Bashforth methods. Some of these will be seen in the computer session.

>