01.03.2013 Views

JST Vol. 21 (1) Jan. 2013 - Pertanika Journal - Universiti Putra ...

JST Vol. 21 (1) Jan. 2013 - Pertanika Journal - Universiti Putra ...

JST Vol. 21 (1) Jan. 2013 - Pertanika Journal - Universiti Putra ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Solving Delay Differential Equations by Using Implicit 2-Point Block Backward Differentiation Formula<br />

The numerical results were then compared to the classical 1-point backward differentiation<br />

formula (BDF). The corrector formula (Lambert, 1993) is given as:<br />

2 9 18 6<br />

yn+ 1= yn-2- yn- 1+ yn+ hf (5)<br />

n+<br />

1<br />

11 11 11 11<br />

In general, most numerical methods for solving differential equations produce only one<br />

new approximation value. However, the implicit block method can produce two new values<br />

simultaneously at each step. Thus, it is logically safe to presume that this particular method<br />

can reduce the timing of the calculation and its computational cost as well.<br />

IMPLEMENTATION OF THE METHOD<br />

Newton iteration is implemented in the method to evaluate the values of y n+<br />

1<br />

and y n+<br />

2 for solving equation [1]. The values for both y n+<br />

1 and y n+<br />

2 at ( i + 1)<br />

( i+<br />

1)<br />

( i+<br />

1)<br />

th iterative are given as y n+<br />

1 and y n+<br />

2 . According to Ibrahim et al. (2007), the<br />

Newton iteration takes the form of<br />

and<br />

Hence,<br />

æ ö<br />

ç f<br />

ç<br />

÷<br />

ç<br />

÷<br />

è ø÷<br />

( i)<br />

F1 y<br />

( i+ 1) ( i)<br />

n+<br />

1)<br />

n+ 1 = n+ 1- ' ( i)<br />

F1 yn+<br />

1<br />

y y<br />

( )<br />

( )<br />

( i)<br />

F2y ( i+ 1) ( i)<br />

n+<br />

2)<br />

n+ 2 = n+ 2- ' ( i)<br />

F2 yn+<br />

2<br />

y y<br />

( )<br />

( )<br />

n+<br />

1 ( i+ 1 ) ( i) () i () i () i<br />

1-2h ( yn+ 1 - yn+ 1) =-yn+ 1- yn+ 2+ 2hfn+<br />

1+ V 1<br />

yn+<br />

1<br />

3<br />

(8)<br />

æ 6 ö<br />

ç f ÷<br />

18 6<br />

ç ÷<br />

ç<br />

÷<br />

è ÷ ø<br />

n+<br />

2 ( i+ 1 ) ( i) () i () i () i<br />

1- h ( yn+ 2 - yn+ 2) = yn+ 1- yn+ 2+ hfn+<br />

2+ V 2<br />

11 yn+<br />

2<br />

11 11<br />

(9)<br />

where f<br />

y is a Jacobian and 1 V , V 2 are the back values.<br />

Let<br />

<strong>Pertanika</strong> J. Sci. & Technol. <strong>21</strong> (1): 283 - 298 (<strong>2013</strong>)<br />

2<br />

e = y -y<br />

(10)<br />

( i+ 1) ( i+ 1) ( i)<br />

n+ 1 n+ 1 n+<br />

1<br />

e = y -y<br />

(11)<br />

( i+ 1) ( i+ 1) ( i)<br />

n+ 2 n+ 2 n+<br />

2<br />

(6)<br />

(7)<br />

39

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!