1 Introduction

Singularly perturbed Volterra integro-differential equations arise in many physical and biological problems. Among these are diffusion-dissipation processes, epidemic dynamics, synchronous control systems, and filament stretching problems (see, e.g., [14]). For extensive reviews, see [1, 38].

Singularly perturbed differential equations are typically characterized by a small parameter ε multiplying some or all of the highest-order terms in the differential equations. The difficulties arising in the numerical solutions of singularly perturbed problems are well known. A comprehensive review of the literature on numerical methods for singularly perturbed differential equations may be found in [812].

This paper is concerned with the following singularly perturbed Volterra integro-differential equation:

Lu:=ε u (t)+f ( t , u ( t ) ) + 0 t K ( t , s , u ( s ) ) ds=0,tI:=[0,T],
(1.1)
u(0)=A,
(1.2)

where 0<ε1 is the perturbation parameter, f(t,u) ((t,u)I×R) and K(t,s,u) ((t,s,u)I×I×R) are sufficiently smooth functions, A is a given constant and f u α>0. By substituting ε=0 in (1.1), we obtain the reduced equation

f ( t , u r ( t ) ) + 0 t K ( t , s , u r ( s ) ) ds=0,

which is a Volterra integral equation of the second kind. The singularly perturbed nature of (1.1) occurs when the properties of the solution with ε>0 are incompatible with those when ε=0. The interest here is in those problems which do imply such an incompatibility in the behavior of u in a neighborhood of t=0. This suggests the existence of an initial layer near the origin where the solution undergoes a rapid transition.

A special class of singularly perturbed integro-differential-algebraic equations and singularly perturbed integro-differential systems has been solved by Kauthen [13, 14] by implicit Runge-Kutta methods. A survey of the existing literature on a singularly perturbed Volterra integral and integro-differential equations is given by Kauthen [15]. The exponential scheme that has a fourth-order accuracy when the perturbation parameter ε is fixed is derived and a stability analysis of this scheme is discussed in [16]. The numerical discretization of singularly perturbed Volterra integro-differential equations and Volterra integral equations by tension spline collocation methods in certain tension spline spaces are considered in [17]. For the numerical solution of singularly perturbed Volterra integro-differential equations, we have studied the following articles: [1821].

Our goal is to construct an ε-numerical method for solving (1.1)-(1.2), by which we mean a numerical method which generates ε-uniformly convergent numerical approximations to the solution. For this, we use a finite difference scheme on an appropriate graded mesh which are dense in the initial layer. Graded meshes are dependent on ε and mesh points have to be condensed in a neighborhood of t=0 in order to resolve the initial layer. In graded meshes, basically half of the mesh points are concentrated in a O(ε|lnε|) neighborhood of the point t=0 and the remaining half forms a uniform mesh on the rest of [0,T] (see [10, 11, 22]).

In [23], the authors gave a uniformly convergent numerical method with respect to ε on a uniform mesh for the numerical solution of a linear singularly perturbed Volterra integro-differential equation. However, in this study, we will derive a uniformly convergent ε-numerical method on a graded mesh for the numerical solution of a nonlinear singularly perturbed Volterra integro-differential equation. This is the aspect of the problem of this paper that is different from [23] and the others.

The outline of the paper is as follows: In Section 2, the properties of the problem (1.1), (1.2) are given. In Section 3, the difference scheme constructed on the non-uniform mesh for the numerical solution (1.1), (1.2) is presented and graded mesh is introduced. Stability and convergence of the difference scheme are investigated in Section 4 and error of the difference scheme is evaluated in Section 5. Finally numerical results are presented in Section 6.

Let us now introduce some notation. Let

ω N ={0< t 1 < t 2 << t N 1 < t N =T}, ϖ N = ω N {t=0},

be the non-uniform mesh on [0,T]. For each i1 we set the step size h i = t i t i 1 .

Here and throughout the paper we use the notation

v t ¯ , i = v i v i 1 h i ,

v i =v( t i ), for any continuous function v(t).

In our estimates, we use the maximum norm given by

v = max [ 0 , T ] |v(t)|.

For any discrete function v i , we also define the corresponding discrete norm by

v , ω h v = max 1 i N | v i |.

Throughout the paper, C will denote a generic positive constant that is independent of ε and the mesh parameter.

2 The continuous problem

In this section, we study the behavior of the solution of (1.1)-(1.2) and its first derivative which are required for the analysis of the remainder term in the next sections when the error of the difference scheme is analyzed.

Lemma 2.1 Suppose that f(t,u) and K(t,s,u) have continuous partial derivatives with respect to u, respectively, on I×R and I×I×R and have uniformly bounded first partial derivatives in ε. Then the solution u(x) of problem (1.1)-(1.2) satisfies the inequalities

u C,
(2.1)
| u (t)|C ( 1 + 1 ε exp ( α t ε ) ) ,tI.
(2.2)

Proof The analysis of the convergence properties of numerical method that will be obtained and the study of the behavior of the solution of (1.1)-(1.2) with its first derivative will necessarily involve the linearization of the given problem using the mean value theorem for several variables (see [24]). Hence, we obtain

ε u (t)+p(t)u(t)+ 0 t G(t,s)u(s)ds=q(t),tI,u(0)=A,
(2.3)

where

p ( t ) = u f ( t , θ u ) , 0 < θ < 1 , G ( t , s ) = u K ( t , s , γ u ) , 0 < γ < 1

and

q(t)=f(t,0) 0 t K(t,s,0)ds.

We show the validity of (2.1). For the solution of the problem (2.3), we have

u ( t ) = u ( 0 ) exp ( 1 ε 0 t p ( η ) d η ) + 1 ε 0 t q ( ξ ) exp ( 1 ε ξ t q ( η ) d η ) d ξ 1 ε 0 t [ 0 ξ G ( ξ , s ) u ( s ) d s ] exp ( 1 ε ξ t q ( η ) d η ) d ξ

and from this we can write

| u ( t ) | | u ( 0 ) | exp ( 1 ε 0 t p ( η ) d η ) + 1 ε 0 t | q ( ξ ) | exp ( 1 ε ξ t p ( η ) d η ) d ξ + 1 ε 0 t [ 0 ξ | G ( ξ , s ) | | u ( s ) | d s ] exp ( 1 ε ξ t q ( η ) d η ) d ξ .

If M= max I × I |G(t,s)|, then it follows that

| u ( t ) | | A | exp ( α t ε ) + α 1 q ( 1 exp ( α t ε ) ) + 1 ε M 0 t [ 0 ξ | u ( s ) | d s ] exp ( α ( t ξ ) ε ) d ξ | A | exp ( α t ε ) + α 1 q ( 1 exp ( α t ε ) ) + M α 1 ( 1 exp ( α t ε ) ) 0 t | u ( s ) | d s | A | + α 1 q + α 1 M 0 t | u ( s ) | d s .

Then, applying the Gronwall inequality to the last estimate, we obtain

|u(t)| ( | A | + α 1 q ) exp ( α 1 M t ) ,

which proves (2.1).

To prove (2.2), differentiating equation (1.1) we have

ε v (t)+b(t)v(t)=c(t),
(2.4)

where

u (t)=v(t),b(t)= u f(t,u)

and

c(t)= u f ( t , u ( t ) ) K ( t , t , u ( t ) ) 0 t t K ( t , s , u ( s ) ) ds.

By using (1.1), we can obtain

|v(0)|=| u (0)| ε 1 |f(0,A)|C ε 1 .
(2.5)

It follows from (2.4) that

v(t)=v(0)exp ( 1 ε 0 t b ( η ) d η ) + 1 ε 0 t c(ξ)exp ( 1 ε ξ t b ( η ) d η ) dξ.
(2.6)

Obviously, if f(t,u) and K(t,s,u) has continuous partial derivatives in u, respectively, on I×R and I×I×R, then

1 ε | 0 t c(ξ)exp ( 1 ε ξ t b ( η ) d η ) dξ|C.

Hence, we can conclude that (2.2) is a direct consequence of (2.5), (2.6). □

3 Discretization and mesh

To obtain an approximation for (1.1), we integrate (1.1) over ( t i 1 , t i ):

h i 1 t i 1 t i Ludt=0.
(3.1)

Using the quadrature rules in [25], we have

ε u t ¯ , i +f( t i , u i )+ 0 t i K ( t i , s , u ( s ) ) ds+ R i ( 1 ) + R i ( 2 ) =0,
(3.2)

where

R i ( 1 ) = h i 1 t i 1 t i (ξ t i 1 ) d d ξ f ( ξ , u ( ξ ) ) dξ

and

R i ( 2 ) = h i 1 t i 1 t i (ξ t i 1 ) d d ξ ( 0 ξ K ( ξ , s , u ( s ) ) d s ) dξ.

Applying also (2.1) in [25] for σ= 1 2 to the integral in (3.2), we obtain

0 t i K ( t i , s , u ( s ) ) ds= m = 1 i h i 2 [ K ( t i , t m , u m ) + K ( t i , t m 1 , u m 1 ) ] + R i ( 3 ) ,
(3.3)

where

R i ( 3 ) = m = 1 i t i 1 t i ( t m 1 2 ξ) d d ξ K ( t i , ξ , u ( ξ ) ) dξ.

It is clear from (3.1) and (3.2) that

ε u t ¯ , i +f( t i , u i )+ m = 1 i h i 2 [ K ( t i , t m , u m ) + K ( t i , t m 1 , u m 1 ) ] + R i =0,i=1,,N,
(3.4)
u 0 =A,
(3.5)

where the remainder term is

R i = h i 1 t i 1 t i ( ξ t i 1 ) d d ξ f ( ξ , u ( ξ ) ) d ξ h i 1 t i 1 t i ( ξ t i 1 ) d d ξ ( 0 ξ K ( ξ , s , u ( s ) ) d s ) d ξ + m = 1 i t i 1 t i ( t m 1 2 ξ ) d d ξ K ( t i , ξ , u ( ξ ) ) d ξ .
(3.6)

Neglecting R i in (3.3), we may suggest the following difference scheme for approximating (1.1), (1.2):

L h U i ε U t ¯ , i + f ( t i , U i ) + m = 1 i h i 2 [ K ( t i , t m , U m ) + K ( t i , t m 1 , U m 1 ) ] L h U i = 0 , i = 1 , , N ,
(3.7)
U 0 =A.
(3.8)

For the difference scheme (3.7), (3.8) to be ε-uniform convergent, we will use a mesh that is graded inside the initial layer region. For an even number N, the graded mesh takes N/2+1 points in the interval [0,τ] and also N/2+1 points in the interval [τ,T], where the transition point τ, which separates the fine and coarse portions of the mesh, is obtained by taking

τ=min { T / 2 , α 1 ε | ln ε | } .
(3.9)

In practice one usually has τT, so the mesh is fine on [0,τ] and coarse on [τ,T]. We shall consider a mesh ω N which is equidistant in [τ,T] but graded in [0,τ] by a logarithmic mesh generating function (see [26, 27]). The corresponding mesh points are as follows:

if τ<T/2, t i = { α 1 ε ln [ 1 ( 1 ε ) 2 i / N ] , i = 0 , , N / 2 , τ + ( i N / 2 ) h , i = N / 2 + 1 , , N
(3.10)

and

if τ=T/2, t i = { α 1 ε ln [ 1 ( 1 exp ( α T 2 ε ) ) 2 i / N ] , i = 0 , , N / 2 , τ + ( i N / 2 ) h , i = N / 2 + 1 , , N ,
(3.11)

where h=2(Tτ)/N.

We only consider the graded mesh defined by (3.9)-(3.11) in the remainder of the paper.

4 Stability and convergence of the difference scheme

Lemma 4.1 Let the difference operator

U i A i U i B i U i 1 ,1iN,
(4.1)

be given, where A i >0 and B i >0. Then we have the following:

  1. (i)

    For the difference operator (4.1), the discrete maximum principle holds: If U i 0, i1 and U 0 0, then U i 0, i0.

  2. (ii)

    If A i B i α>0, then the solution of the difference initial value problem

    U i = F i , i 1 , U 0 = μ

satisfies the estimate

U |μ|+ α 1 max 1 i N | F i |.
(4.2)
  1. (iii)

    If F i 0 is nondecreasing and A i B i α>0, then

    | U i ||μ|+ α 1 F i ,i1.
    (4.3)

Proof See [23]. □

Lemma 4.2 Under condition

α+ h i 2 U K( t i , t i ,γ U i ) α >0,i=1,2,,N,
(4.4)

for the difference operator

h U i :=ε U t ¯ , i + U f( t i ,γ U i ) U i + h i 2 U K( t i , t i ,γ U i ) U i
(4.5)

we have

U | U 0 |+ α 1 max 1 i N | h U i |.
(4.6)

Proof Difference expression (4.5) can be rewritten as

U i A i U i B i U i 1 ,

where

A i = ε h i + U f( t i ,γ U i )+ h i 2 U K( t i , t i ,γ U i ), B i = ε h i .

It is easy to see that

A i ε h i +α+ h i 2 U K( t i , t i ,γ U i )>0

and

B i = ε h i >0.

Since

A i B i = U f( t i ,γ U i )+ h i 2 U K( t i , t i ,γ U i )>0

by (4.3), (4.6) follows in view of (4.2). □

Now we will show stability for the difference problem (3.7)-(3.8).

Lemma 4.3 Let the difference operator h U i be defined by (4.5). Then for the difference problem (3.7)-(3.8) we have

| h U i | f +C m = 1 i h i | U m 1 |,1iN.
(4.7)

Proof From (3.7) we have

| h U i | | f ( t i , 0 ) | + | m = 1 i h i 2 K ( t i , t m , 0 ) | + | m = 1 i 1 h i 2 [ U K ( t i , t m , γ U m ) U m ] | + | m = 1 i h i 2 [ K ( t i , t m 1 , 0 ) + U K ( t i , t m 1 , γ U m 1 ) U m 1 ] | .

If we take into consideration that the kernel K(t,s,u) is bounded, it can be concluded that the estimate (4.7) holds. □

Lemma 4.4 We assume that the condition (4.4) holds. Then for the solution of difference scheme (3.7)-(3.8), we have

| U i | ( α 1 f + | A | ) exp ( α 1 C t i ) ,1iN.
(4.8)

Proof Let

V i = { m = 1 i 1 h i | U m 1 | , i 0 , 0 , i = 0 ,

where

V t ¯ , i =| U i 1 |.

Thus, from the inequality (4.7), we have the following difference inequality:

| h U i | C V i + f , U 0 = A .

Using the discrete maximum principle, we have

| U i | W i ,

where w i is the solution of the problem

h W i = C V i + f , W 0 = | A | .

In view of (4.2), it follows that

| U i || W i | α 1 C V i + α 1 f +|A|
(4.9)

and

V t ¯ , i =| U i 1 | α 1 C V i 1 + α 1 f +|A|.

Then application of the difference analog of the differential inequality gives

V i ( α 1 f + | A | ) α C 1 ( exp ( α 1 C t i ) 1 ) ,

which together with (4.9) proves (4.8). □

5 Uniform error estimates

To investigate the convergence of the method, note that the error function z i = U i u i , 0iN, is the solution of the discrete problem

L h z i = ε z t ¯ , i + [ f ( t i , U i ) f ( t i , u i ) ] + h i 2 [ K ( t i , t i , U i ) K ( t i , t i , u i ) ] L h z i = + h i 2 [ K ( t i , t i 1 , U i 1 ) K ( t i , t i 1 , u i 1 ) ] L h z i = + K ˜ i = R i , i = 1 , , N ,
(5.1)
z 0 =0,
(5.2)

where R i is given by (3.6) and

K ˜ i = { 0 , i = 1 , m = 1 i 1 h i 2 { [ K ( t i , t m , U m ) K ( t i , t m , u m ) ] + [ K ( t i , t m 1 , U m 1 ) K ( t i , t m 1 , u m 1 ) ] } , i > 1 .

Lemma 5.1 Under the condition of Lemma  2.1, for the remainder term R i of the scheme (3.7)-(3.8), the estimate

R , ω N C N 1
(5.3)

holds.

Proof The remainder term of the scheme (3.7) can be rewritten as

R i = R i ( 1 ) + R i ( 2 ) + R i ( 3 ) ,

where

R i ( 1 ) = h i 1 t i 1 t i (ξ t i 1 ) d d ξ f ( ξ , u ( ξ ) ) dξ,
(5.4)
R i ( 2 ) = h i 1 t i 1 t i (ξ t i 1 ) d d ξ ( 0 ξ K ( ξ , s , u ( s ) ) d s ) dξ
(5.5)

and

R i ( 3 ) = m = 1 i t i 1 t i ( t m 1 2 ξ) d d ξ K ( t i , ξ , u ( ξ ) ) dξ.
(5.6)

In view of Lemma 2.1, for an arbitrary mesh, it follows from (5.4), (5.5), and (5.6) that

| R i ( 1 ) | h i 1 t i 1 t i ( ξ t i 1 ) | d d ξ f ( ξ , u ( ξ ) ) | d ξ | R i ( 1 ) | = h i 1 t i 1 t i ( ξ t i 1 ) | ξ f ( ξ , u ( ξ ) ) + u f ( ξ , u ( ξ ) ) u ( ξ ) | d ξ | R i ( 1 ) | C h i 1 t i 1 t i ( ξ t i 1 ) | 1 + u ( ξ ) | d ξ | R i ( 1 ) | C { h i + ε 1 t i 1 t i | u ( ξ ) | d ξ } , i = 1 , , N ,
(5.7)
| R i ( 2 ) | h i 1 t i 1 t i | ( ξ t i 1 ) d d ξ ( 0 ξ K ( ξ , s , u ( s ) ) d s ) | d ξ | R i ( 2 ) | h i 1 t i 1 t i ( ξ t i 1 ) | K ( ξ , ξ , u ( ξ ) ) + 0 ξ ξ K ( ξ , s , u ( s ) ) d s | d ξ | R i ( 2 ) | C h i , i = 1 , , N ,
(5.8)
| R i ( 3 ) | m = 1 i t i 1 t i ( t m 1 2 ξ ) | d d ξ K ( t i , ξ , u ( ξ ) ) | d ξ | R i ( 3 ) | m = 1 i t i 1 t i ( t m 1 2 ξ ) | ξ K ( t i , ξ , u ( ξ ) ) + u K ( t i , ξ , u ( ξ ) ) u ( ξ ) | d ξ | R i ( 3 ) | m = 1 i t i 1 t i ( t m 1 2 ξ ) | 1 + u ( ξ ) | d ξ | R i ( 3 ) | C max 1 m i h m 0 t i ( 1 + u ( ξ ) ) d ξ | R i ( 3 ) | C max 1 m i h m , i = 1 , 2 , , N ,
(5.9)

respectively, where

h i = { α 1 ε ln [ 1 ( 1 ε ) 2 i N ] + α 1 ε ln [ 1 ( 1 ε ) 2 ( i 1 ) N ] , i = 1 , , N / 2 , T τ N / 2 , i = N / 2 + 1 , , N .

First, we consider the τ<T/2 and estimate R i on [0,τ] and [τ,T] separately. Then τ= α 1 εlnε. In the layer region [0,τ], we get

| R i ( 1 ) |C { h i + α 1 ( exp ( α t i 1 ε ) + exp ( α t i ε ) ) } ,i=1,,N/2,
(5.10)

by (2.2). Since

h i = t i t i 1 = α 1 ε ln [ 1 ( 1 ε ) 2 i N ] + α 1 ε ln [ 1 ( 1 ε ) 2 ( i 1 ) N ] 2 α 1 ( 1 ε ) N 1

and

exp ( α t i 1 ε ) +exp ( α t i ε ) =2(1ε) N 1 ,

it follows from (5.10) that

| R i ( 1 ) |4 α 1 C N 1 ,i=1,,N/2.
(5.11)

It follows from (5.8) and (5.9) that

| R i ( 2 ) |ChC2 α 1 (1ε) N 1 2 α 1 C N 1 ,i=1,,N/2
(5.12)

and

| R i ( 3 ) |C h i +C ε 1 h i C N 1 ,i=1,,N/2,
(5.13)

respectively. From (5.11), (5.12), and (5.13) for the region [0,τ] we get

| R i |C N 1 ,i=1,,N/2.
(5.14)

In the layer region [τ,T], | u (x)|C (or ε 1 exp(αx/ε)1) by (2.2), and

| R i ( 1 ) |Ch,i=N/2+1,,N.

In view of the above discussion, we get

| R i ( 1 ) |2TC N 1 ,i=N/2+1,,N.
(5.15)

Similarly, it is clear that

| R i ( 2 ) |2TC N 1 ,i=N/2+1,,N
(5.16)

and

| R i ( 3 ) |2TC N 1 ,i=N/2+1,,N.
(5.17)

Combining the estimates (5.11), (5.12), and (5.13) for the region [τ,T], we get

| R i |C N 1 ,i=N/2+1,,N.
(5.18)

Now we consider the case τ=T/2. In this case, T/2< α 1 εlnε. Therefore, for t i [0,τ] with (3.10), we can obtain similar results to that obtained above. For t i (τ,T], since h i =h=2(Tτ)/N=T/N,

max i = N / 2 + 1 , , N t i 1 t i ε 1 exp ( α t ε ) d x h ε 1 exp ( α T 2 ε ) ( 2 α 1 exp ( 1 ) h ) / T = 2 C α 1 exp ( 1 ) N 1 .

It follows from (5.7), (5.8), and (5.9) that

| R i ( 1 ) |C ( T + 2 exp ( 1 ) α 1 ) N 1 ,i=N/2+1,,N,
(5.19)
| R i ( 2 ) |ChC N 1 ,i=N/2+1,,N,
(5.20)
| R i ( 3 ) |Ch+C ε 1 hC N 1 ,i=N/2+1,,N,
(5.21)

respectively. When we combine the estimates (5.19), (5.20), and (5.21), we get

| R i |C N 1 ,i=N/2+1,,N.
(5.22)

From (5.14), (5.18), and (5.22), it is easy to see that (5.3) holds. □

Lemma 5.2 Under condition (4.4) and Lemma  5.1, the solution z i of problem (5.1)-(5.2) satisfies

z , ϖ N max 1 i N | R i |.
(5.23)

Proof Using intermediate value theorem for the problem (3.7)-(3.8), we get

L h z i = ε z t ¯ , i + u f ( t i , u i + γ z i ) z i + h i 2 u K ( t i , t i , u i + γ z i ) z i L h z i = + h i 2 u K ( t i , t i 1 , u i 1 + γ z i 1 ) z i 1 + K ˜ L h z i = R i , i = 1 , 2 , , N ,
(5.24)
z 0 =0,
(5.25)

where

K ˜ = { 0 , i = 1 , m = 1 i 1 h i 2 [ u K ( t i , t m , u m + γ z m ) z m + u K ( t i , t m 1 , u m 1 + γ z m 1 ) z m 1 ] , i > 1 .

If we apply Lemma 4.4 to (5.24)-(5.25), then we see the validity of the inequality (5.23). □

Combining the two previous lemmas gives us the following main result.

Theorem 5.3 Suppose that the conditions of Lemma  5.1 and (4.4) are satisfied and u is the solution of problem (1.1), (1.2). Then the following ε-uniform convergence result holds for the solution U of the difference problem (3.7), (3.8) on the mesh (3.9)-(3.11):

U u , ϖ N C N 1 .

6 Numerical results

In this section, we test the performance of the difference problem (3.7), (3.8). It is clear that the difference problem (3.7), (3.8) is a nonlinear problem. When we solve such problems, nonlinear equations arise in each step. There are several methods for solving these kinds of nonlinear equations. One of these methods is quasi-linearization. Quasi-linearization is a method like Newton’s method (see, e.g., [28]). This method amounts to linearizing the nonlinear terms in the nonlinear problems. A quasi-linearization procedure defines a sequence of linear problems whose solutions converge to that of the given nonlinear problems. For convergence of this method, one can refer to [28, 29]. If we use this method for the difference problem (3.7), (3.8), we obtain

ε U t ¯ , i ( n ) + f ( t i , U i ( n 1 ) ) + U f ( t i , U i ( n 1 ) ) ( U i ( n ) U i ( n 1 ) ) + m = 1 i h i 2 [ K ( t i , t m , U m ( n 1 ) ) + U K ( t i , t m , U m ( n 1 ) ) ( U m ( n ) U m ( n 1 ) ) + K ( t i , t m 1 , U m 1 ( n 1 ) ) + U K ( t i , t m 1 , U m 1 ( n 1 ) ) ( U m 1 ( n ) U m 1 ( n 1 ) ) ] = 0 , i = 1 , , N ,
(6.1)
U 0 ( n ) =A.
(6.2)

Here, we obtain the following iteration process:

U i ( n ) = A i U i 1 ( n ) + B i U i ( n 1 ) C i K ˜ i ε h i + U f ( t i , U i ( n 1 ) ) + h i 2 U K ( t i , t i , U i ( n 1 ) ) ,i=1,2,,N,
(6.3)
U 0 ( n ) =A,
(6.4)

where

A i = ε h i , B i = U f ( t i , U i ( n 1 ) ) + U K ( t i , t i , U i ( n 1 ) ) , C i = f ( t i , U i ( n 1 ) ) + h i 2 [ K ( t i , t i , U i ( n 1 ) ) + K ( t i , t i 1 , U i 1 ( n ) ) ] , K ˜ i = { 0 , i = 1 , m = 1 i 1 h i 2 [ K ( t i , t m , U m ( n ) ) + K ( t i , t m 1 , U m 1 ( n ) ) ] , i > 1 ,

and U i ( 0 ) is given.

We apply the difference scheme (3.7), (3.8) to the following Volterra integro-differential equation:

ε u (t)+ u 3 (t)+3u(t)+ 0 t u 2 (s)ds= e 3 t ε 1 2 ε e 2 t ε +2 e t ε + 1 2 ε

with u(0)=1. The exact solution of the equation is u(t)= e t ε . Some computational results are presented in Table 1. We also calculate the experimental rate of uniform convergence p as follows:

p N = ln ( e N / e 2 N ) ln 2 ,

where

e N = max 1 i N | U i u i |.

The obtained results show that the convergence rate of the difference scheme (3.7), (3.8) is essentially in accord with the theoretical analysis.

Table 1 Approximate errors e N and computed orders of convergence p N on ω ¯ N for various values of ε and N

7 Conclusion

A nonlinear Volterra integro-differential equation was considered. We solved this equation by using a finite difference scheme on an appropriate graded mesh which is dense in the initial layer. We showed that the method shows uniform convergence with respect to the perturbation parameter for the numerical approximation of the solution. Numerical results which support the theoretical results were presented.