Applied Mathematics
Vol.08 No.07(2017), Article ID:77658,11 pages
10.4236/am.2017.87075

Numerical Methods for a Class of Hybrid Weakly Singular Integro-Differential Equations

Shihchung Chiang

Department of Finance, Chung Hua University, Hsinchu, Taiwan

Email: Chiang@chu.edu.tw

Copyright © 2017 by author and Scientific Research Publishing Inc.

This work is licensed under the Creative Commons Attribution International License (CC BY 4.0).

http://creativecommons.org/licenses/by/4.0/

Received: May 25, 2017; Accepted: July 11, 2017; Published: July 14, 2017

ABSTRACT

This paper proposes numerical methods for solving hybrid weakly singular integro-differential equations of the second kind. The terms in these equations are in the following order: derivative term of a state, integro-differential term of a state with a weakly singular kernel, a state, integral term of a state with a smooth kernel, and force. The original class of weakly singular integro-differential equations of the first kind is derived from aeroelasticity mathematical models. Among the proposed methods, the method for solving linear cases is fully based on previously reported approximation scheme for equations of the first kind. For nonlinear cases, a revised method is proposed. Examples are presented to demonstrate the effectiveness of the proposed methods, and the results indicate that the proposed methods facilitate achieving satisfactory and accurate approximations.

Keywords:

Hybrid, Weakly Singular, Integro-Differential Equations

1. Introduction

The original class of integro-differential equations is from an aeroelasticity pro- blem, in which the mathematical model comprises eight integro-differential equations [1] . In this model, the most determinate equation is a scalar weakly singular integro-differential equation of the first kind. For the current study, a new equation comprising additional derivative terms and integro-differential terms with smooth kernel was used. Under an integrable assumption in previous studies, this new equation can be transformed into a Volterra integral equation of the second kind [2] [3] [4] [5] [6] . The remainder of this paper is organized as follows: Section 2 presents the equations. Section 3 presents the approach to the numerical methods from [7] for the linear cases and the revised version for the nonlinear cases. Section 4 presents the numerical results obtained by the methods in Section 4. Section 5 presents the summary.

2. Problem Description

Consider the class of hybrid weakly singular integro-differential equations

d d t x ( t ) + d d t D x t = x ( t ) + L x t + f ( t ) , (1)

the initial condition

x ( s ) = ϕ ( s ) , b s 0 , (2)

where b is a positive constant. The operators D and L are defined as follows:

D x t = b 0 g ( s ) x t ( s ) d s (3)

L x t = b 0 c ( s ) x t ( s ) d s , (4)

where

x t ( s ) = x ( t + s ) . (5)

The weighting kernel g is integrable, positive, nondecreasing, and weakly singular at s = 0 . Kernel c is smooth on s. The force f ( t ) is assumed to be locally integrable for t > 0 . Although a more general kernel g is suitable, in this study, emphasis was placed on the Abel type kernel and considers g ( s ) = | s | p and s [ b , 0 ] for 0 < p < 1 . A special value of p = 0.5 corresponds to the original aeroelastic problem. The initial condition ϕ ( s ) , b s 0 is in L 1 , g space, which is a weighted L 1 space with weight g ( ) . The initial value problems (1) and (2) can be expressed as

x ( t ) + D x t = D x 0 + ϕ ( 0 ) + 0 t ( x ( τ ) + b 0 c ( s ) x ( τ + s ) d s + f ( τ ) ) d τ , (6)

provided that the function

t D x t = b 0 g ( s ) x ( t + s ) d s (7)

is absolutely continuous and the function g ( ) ϕ ( ) belongs to L 1 [ b , 0 ] . The corresponding weakly singular Volterra integral equation of the hybrid kind is

x ( t ) + 0 t | s t | p x ( s ) d s = ϕ ( 0 ) + b 0 | s | p ϕ ( s ) d s + b 0 ( x ( τ ) + b 0 c ( s ) x ( τ + s ) d s + f ( τ ) ) d τ ,

for 0 < t b .

The proposed algorithms use the separating variables method to directly solve Equations (1) and (2). Without loss of generality, assuming b = 1, the equation is expressed as

d d t x ( t ) + d d t 1 0 | s | p x ( t + s ) d s = x ( t ) + 1 0 c ( s ) x ( t + s ) d s + f ( t ) , (8)

for 0 < t 1 , with initial data

x ( s ) = ϕ ( s ) , s 0 , (9)

where f ( t ) , t > 0 is a locally integrable function. By the form of the state in the hybrid integro-differential Equation (8), we obtain the following result:

x ( t + s ) s = x ( t + s ) t , 1 s 0 , t > 0 , (10)

and Equation (8) can be rewritten as

d d t x ( t ) + 1 0 | s | p s x ( t + s ) d s = x ( t ) + 1 0 c ( s ) x ( t + s ) d s + f ( t ) . (11)

3. Numerical Method

3.1. Linear Problems

The proposed method entails discretizing Equation (1). The space mesh points (corresponding to the s variable) are discretized as 1 = τ n < τ n 1 < < τ 1 < τ 0 = 0 , and a new variable ξ is defined as follows:

ξ ( t , s ) = x ( t + s ) , 1 s 0 , 0 < t . (12)

Equation (12) can then be reformulated as a first-order hyperbolic equation

t ξ ( t , s ) = s ξ ( t , s ) , 1 s 0 , (13)

with the condition

d d t ξ ( t , 0 ) + 1 0 | s | p s ξ ( t , s ) d s = ξ ( t , 0 ) + 1 0 c ( s ) ξ ( t , s ) d s + f ( t ) . (14)

Next, assume that the solution to Equations (13) and (14) has the form

ξ ( t , s ) = i = 0 n κ i ( t ) B i ( s ) , (15)

where the basis, B i ( s ) , i = 0 , , n is given by

B i ( s ) = { 1 τ i τ i + 1 ( s τ i + 1 ) : s [ τ i + 1 , τ i ] 1 τ i 1 τ i 1 ( τ i 1 s ) : s [ τ i , τ i 1 ] 0 : otherwise ,

where B i ( s ) , i = 0 , , n is a piecewise linear function. After substituting the special form of ξ expressed in Equation (15) into Equations (13) and (14), the governing equations for κ j ( t ) , j = 0 , , n can be expressed as follows:

d d t κ i ( t ) = 1 δ i ( κ i 1 ( t ) κ i ( t ) ) , i = 1 , , n , (16)

d d t i = 0 n κ i ( t ) B i ( 0 ) + 1 0 | s | p i = 0 n κ i ( t ) d d s B i ( s ) d s = κ i ( t ) B i ( 0 ) + 1 0 c ( s ) i = 0 n κ i ( t ) B i ( s ) d s + f ( t ) , (17)

where δ i = τ i 1 τ i > 0 , for i = 1 , , n . By defining constants c i and d i , for i = 0 , , n , and applying the property of B i ( s ) , Equation (17) can be written as

d d t κ 0 ( t ) + i = 0 n c i κ i ( t ) = κ 0 ( t ) + i = 0 n d i κ i ( t ) + f ( t ) . (18)

Note that Equations (16) and (18) can form a system of first order ordinary differential equations. For time t, the discretization contains T 0 , T 1 , , T m , for 0 = T 0 < T 1 < < T m = 1. Define Δ k = T k + 1 T k , for k = 0 , , m 1. Assume α i k = κ i ( T k ) , for i = 0 , , n , and k = 0 , , m . With first term of Equation (18) replaced by the first order finite difference, Equations (16) and (18) can now be expressed as follows:

1 Δ k ( α 0 k + 1 α 0 k ) + i = 0 n c i α i k + 1 = α 0 k + 1 + i = 0 n d i α i k + 1 + f ( T k + 1 ) , (19)

for k = 0 , , m 1. Furthermore, assume a uniform mesh for both space and time variables, the mesh points are τ i , i = 0 , , n , and T k , k = 0 , , m . Specifi-

cally, τ i = i n and T k = k m for some positive integers n and m . The corres-

ponding differences are defined as Δ k = T k + 1 T k , k = 0 , , m 1 , for the time

variable, and δ i = τ i 1 τ i , i = 1 , , n , for the space variable. Thus, Δ k = 1 m and δ i = 1 n for k = 0 , , m 1 and i = 1 , , n . Setting m = n leads to the relation Δ k = δ i = 1 n for k = 0 , , m 1 and i = 1 , , n and Equations (19) and

(18) lead to the following system:

α i k + 1 = α i 1 k , (20)

and

α 0 k + 1 α 0 k δ k + 1 + α 0 k + 1 ( c 0 d 0 1 ) + α 1 k + 1 ( c 1 d 1 ) + + α n k + 1 ( c n d n ) = f ( T k + 1 ) , (21)

for k = 0 , 1 , , n 1. After defining the corresponding constants e 0 , e 1 , , e n , Equation (21) can be simplified as follows:

α 0 k + 1 e 0 + α 1 k + 1 e 1 + + α i k + 1 e k + 1 + + α n k + 1 e n = f ( T k + 1 ) , (22)

for k = 0 , 1 , , n 1. The connection of the solution x ( t ) and α s is as follows: Because ξ ( t , s ) = x ( t + s ) , for 1 s 0 and t > 0 , and

ξ ( t , s ) = i = 0 n κ i ( t ) B i ( s ) . x ( t ¯ ) can be obtained for 1 t ¯ > 0 in the following

case:

x ( T j ) = l = 0 n κ l ( T j ) B l ( 0 ) = κ 0 ( T j ) = α 0 j , for j = 1 , , n . (23)

Equations above with the initial condition can be set up as [ A ] [ x ] = [ b ] , where the vector [ x ] comprises the unknowns α 0 j , j = 1 , , n . The structure of matrix [ A ] is

[ e 0 0 0 0 e 1 e 0 0 0 e n 1 e n 2 e 0 ] n × n ,

and that of vector [ b ] is

[ f ( T 1 ) α 0 0 e 1 α 1 0 e 2 α n 1 0 e n f ( T 2 ) α 0 0 e 2 α 1 0 e 3 α n 2 0 e n f ( T n ) α 0 0 e n ] n × 1 .

3.2. Nonlinear Problems

The second proposed method contains part of the first method. By assuming x ( t + s ) = ξ ( t , s ) , then the property of Equation (13):

t ξ ( t , s ) = s ξ ( t , s ) ,

for 1 s 0 still holds. The discretized Equation (1) follows the study [7] :

d d t x ( t ) + j = 0 n / 2 1 τ 2 j + 2 τ 2 j | s | p x ( t + τ 2 j ) x ( t + τ 2 j + 2 ) 2 Δ s d s = x ( t ) + j = 0 n / 2 1 τ 2 j + 2 τ 2 j c ( s ) x ( t + τ 2 j + 1 ) d s + f ( t ) , (24)

for n is even. Δ s = τ j + 1 τ j , for j = 0 , 1 , , n 1 is constant for uniform mesh. By applying the property of τ i , i = 0 , 1 , , n , Equation (24) can be written as

d d t ξ ( t , 0 ) + ξ ( t , 0 ) [ ( τ 2 ) 1 p 2 Δ s ( 1 p ) 1 ] = ξ ( t , τ 2 ) [ ( τ 2 ) 1 p 2 Δ s ( 1 p ) ] + 1 2 Δ s ( 1 p ) j = 0 n / 2 1 [ ( τ 2 j ) 1 p ( τ 2 j + 2 ) 1 p ] × [ ξ ( t , τ 2 j ) ξ ( t , τ 2 j + 2 ) ] + 2 Δ s j = 0 n / 2 1 c ( τ 2 j + 1 ) ξ ( t , τ 2 j + 1 ) + f ( t ) . (25)

Next, assume that

ξ ( t , s ) = i = 0 n κ i ( t ) B i ( s ) , (26)

where the basis, B i ( s ) , i = 0 , 1 , , n are the same as above.

3.2.1. c(s) = 1

Equation (25) becomes

d d t κ 0 ( t ) + κ 0 ( t ) [ ( τ 2 ) 1 p 2 Δ s ( 1 p ) 1 ] = κ 2 ( t ) [ ( τ 2 ) 1 p 2 Δ s ( 1 p ) ] + 1 2 Δ s ( 1 p ) j = 0 n / 2 1 [ ( τ 2 j ) 1 p ( τ 2 j + 2 ) 1 p ] × [ κ 2 j ( t ) κ 2 j + 2 ( t ) ] + 2 Δ s j = 0 n / 2 1 κ 2 j + 1 ( t ) + f ( t ) . (27)

Setting t = T 1 , and assuming d d t κ 0 ( T 1 ) = κ 0 ( T 2 ) κ 0 ( T 0 ) 2 Δ s , then

κ 0 ( T 2 ) 2 Δ s + κ 0 ( T 1 ) [ ( τ 2 ) 1 p 2 Δ s ( 1 p ) 1 ] = ϕ ( 0 ) 2 Δ s + ϕ ( τ 1 ) [ ( τ 2 ) 1 p 2 Δ s ( 1 p ) ] + 1 2 Δ s ( 1 p ) j = 0 n / 2 1 [ ( τ 2 j ) 1 p ( τ 2 j + 2 ) 1 p ] × [ ϕ ( τ 2 j 1 ) ϕ ( τ 2 j + 1 ) ] + 2 Δ s j = 0 n / 2 1 ϕ ( τ 2 j ) + f ( T 1 ) . (28)

Similarly, setting t = T 2 , then

κ 0 ( T 3 ) 2 Δ s + κ 0 ( T 2 ) [ ( τ 2 ) 1 p 2 Δ s ( 1 p ) 1 ] + κ 0 ( T 1 ) [ 1 2 Δ s 2 Δ s ] = ϕ ( 0 ) [ ( τ 2 ) 1 p 2 Δ s ( 1 p ) ] + 1 2 Δ s ( 1 p ) j = 1 n / 2 1 [ ( τ 2 j ) 1 p ( τ 2 j + 2 ) 1 p ] × [ ϕ ( τ 2 j 2 ) ϕ ( τ 2 j ) ] + 2 Δ s j = 1 n / 2 1 ϕ ( τ 2 j 1 ) + f ( T 2 ) . (29)

For 3 i n / 2 1 and t = T 2 i 1 ,

κ 0 ( T 2 i ) 2 Δ s + κ 0 ( T 2 i 1 ) [ ( τ 2 ) 1 p 2 Δ s ( 1 p ) 1 ] + κ 0 ( T 2 i 2 ) [ 1 2 Δ s 2 Δ s ] + + κ 0 ( T 1 ) 1 2 Δ s ( 1 p ) [ ( τ 2 i 4 ) 1 p 2 ( τ 2 i 2 ) 1 p + ( τ 2 i ) 1 p ] = ϕ ( τ 1 ) [ 1 2 Δ s ( 1 p ) ] [ ( τ 2 i 2 ) 1 p ( τ 2 i ) 1 p ] + 1 2 Δ s ( 1 p ) j = i n / 2 1 [ ( τ 2 j ) 1 p ( τ 2 j + 2 ) 1 p ] [ ϕ ( τ 2 j 2 i + 1 ) ϕ ( τ 2 j 2 i + 3 ) ] + 2 Δ s j = i 1 n / 2 1 ϕ ( τ 2 j 2 i + 2 ) + f ( T 2 i 1 ) . (30)

For t = T 2 i ,

κ 0 ( T 2 i + 1 ) 2 Δ s + κ 0 ( T 2 i ) [ ( τ 2 ) 1 p 2 Δ s ( 1 p ) 1 ] + κ 0 ( T 2 i 1 ) [ 1 2 Δ s 2 Δ s ] + + κ 0 ( T 1 ) [ 2 Δ s ] = ϕ ( 0 ) [ 1 2 Δ s ( 1 p ) ] [ ( τ 2 i 2 ) 1 p ( τ 2 i ) 1 p ] + 1 2 Δ s ( 1 p ) j = i n / 2 1 [ ( τ 2 j ) 1 p ( τ 2 j + 2 ) 1 p ] [ ϕ ( τ 2 j 2 i ) ϕ ( τ 2 j 2 i + 2 ) ] + 2 Δ s j = i n / 2 1 ϕ ( τ 2 j 2 i + 1 ) + f ( T 2 i ) , (31)

then, for t = T n 1 ,

κ 0 ( T n ) 2 Δ s + κ 0 ( T n 1 ) [ ( τ 2 ) 1 p 2 Δ s ( 1 p ) 1 ] + κ 0 ( T n 2 ) [ 1 2 Δ s 2 Δ s ] + + κ 0 ( T 1 ) 1 2 Δ s ( 1 p ) [ ( τ n 4 ) 1 p 2 ( τ n 2 ) 1 p + ( τ n ) 1 p ] = ϕ ( τ 1 ) [ 1 2 Δ s ( 1 p ) ] [ ( τ n 2 ) 1 p ( τ n ) 1 p ] + 1 2 Δ s ( 1 p ) j = i n / 2 1 [ ( τ 2 j ) 1 p ( τ 2 j + 2 ) 1 p ] [ ϕ ( τ 2 j 2 i + 1 ) ϕ ( τ 2 j 2 i + 3 ) ] + 2 Δ s ϕ ( 0 ) + f ( T n 1 ) , (32)

and for t = T n ,

κ 0 ( T n ) [ 1 2 Δ s + ( τ 2 ) 1 p 2 Δ s ( 1 p ) 1 ] + κ 0 ( T 1 ) [ 2 Δ s ] + κ 0 ( T n 2 ) [ 1 2 Δ s 2 ( τ 2 ) 1 p + ( τ 4 ) 1 p 2 Δ s ( 1 p ) ] + + κ 0 ( T 1 ) [ 2 Δ s ] = ϕ ( 0 ) [ 1 2 Δ s ( 1 p ) ] [ ( τ n 2 ) 1 p ( τ n ) 1 p ] + f ( T n ) . (33)

By collecting Equations (28), (29), (30), (31), (32), (33) and assuming α 0 k = κ 0 ( T k ) , for k = 0 , 1 , , n , the system [ A ] [ x ] = [ b ] is constructed, where

[ A ] = [ ( τ 2 ) 1 p 2 Δ s ( 1 p ) 1 1 2 Δ s 0 0 0 * * * 0 0 * * * ] n × n ,

and that of vector [ b ] is

[ b ] = [ f ( T 1 ) + ϕ ( 0 ) 1 2 Δ s + + 2 Δ s j = 0 n / 2 1 ϕ ( τ 2 j ) f ( T 2 ) + ϕ ( 0 ) ( τ 2 ) 1 p 2 Δ s ( 1 p ) + + 2 Δ s j = 1 n / 2 1 ϕ ( τ 2 j 1 ) f ( T n ) ϕ ( 0 ) ( τ n 2 ) 1 p ( τ n ) 1 p 2 Δ s ( 1 p ) ] n × 1 .

3.2.2. c(s) = s

In this case, Equation (25) becomes

d d t κ 0 ( t ) + κ 0 ( t ) [ ( τ 2 ) 1 p 2 Δ s ( 1 p ) 1 ] = κ 2 ( t ) [ ( τ 2 ) 1 p 2 Δ s ( 1 p ) ] + 1 2 Δ s ( 1 p ) j = 0 n / 2 1 [ ( τ 2 j ) 1 p ( τ 2 j + 2 ) 1 p ] × [ κ 2 j ( t ) κ 2 j + 2 ( t ) ] + 2 Δ s j = 0 n / 2 1 τ 2 j + 1 κ 2 j + 1 ( t ) + f ( t ) , (34)

Setting t = T 1 , and assuming d d t κ 0 ( T 1 ) = κ 0 ( T 2 ) κ 0 ( T 0 ) 2 Δ s , then

κ 0 ( T 2 ) 2 Δ s + κ 0 ( T 1 ) [ ( τ 2 ) 1 p 2 Δ s ( 1 p ) 1 ] = ϕ ( 0 ) 2 Δ s + ϕ ( τ 1 ) [ ( τ 2 ) 1 p 2 Δ s ( 1 p ) ] + 1 2 Δ s ( 1 p ) j = 0 n / 2 1 [ ( τ 2 j ) 1 p ( τ 2 j + 2 ) 1 p ] × [ ϕ ( τ 2 j 1 ) ϕ ( τ 2 j + 1 ) ] + 2 Δ s j = 0 n / 2 1 τ 2 j + 1 ϕ ( τ 2 j ) + f ( T 1 ) . (35)

Similarly, setting t = T 2 , then

κ 0 ( T 3 ) 2 Δ s + κ 0 ( T 2 ) [ ( τ 2 ) 1 p 2 Δ s ( 1 p ) 1 ] + κ 0 ( T 1 ) [ 1 2 Δ s 2 Δ s ] = ϕ ( 0 ) [ ( τ 2 ) 1 p 2 Δ s ( 1 p ) ] + 1 2 Δ s ( 1 p ) j = 1 n / 2 1 [ ( τ 2 j ) 1 p ( τ 2 j + 2 ) 1 p ] × [ ϕ ( τ 2 j 2 ) ϕ ( τ 2 j ) ] + 2 Δ s j = 1 n / 2 1 τ 2 j + 1 ϕ ( τ 2 j 1 ) + f ( T 2 ) . (36)

For 3 i n / 2 1 and t = T 2 i 1 ,

κ 0 ( T 2 i ) 2 Δ s + κ 0 ( T 2 i 1 ) [ ( τ 2 ) 1 p 2 Δ s ( 1 p ) 1 ] + κ 0 ( T 2 i 2 ) [ 1 2 Δ s 2 Δ s τ 1 ] + + κ 0 ( T 1 ) 1 2 Δ s ( 1 p ) [ ( τ 2 i 4 ) 1 p 2 ( τ 2 i 2 ) 1 p + ( τ 2 i ) 1 p ] = ϕ ( τ 1 ) [ 1 2 Δ s ( 1 p ) ] [ ( τ 2 i 2 ) 1 p ( τ 2 i ) 1 p ] + 1 2 Δ s ( 1 p ) j = i n / 2 1 [ ( τ 2 j ) 1 p ( τ 2 j + 2 ) 1 p ] [ ϕ ( τ 2 j 2 i + 1 ) ϕ ( τ 2 j 2 i + 3 ) ] + 2 Δ s j = i 1 n / 2 1 τ 2 j + 1 ϕ ( τ 2 j 2 i + 2 ) + f ( T 2 i 1 ) . (37)

For t = T 2 i ,

κ 0 ( T 2 i + 1 ) 2 Δ s + κ 0 ( T 2 i ) [ ( τ 2 ) 1 p 2 Δ s ( 1 p ) 1 ] + κ 0 ( T 2 i 1 ) [ 1 2 Δ s 2 Δ s τ 1 ] + + κ 0 ( T 1 ) [ 2 Δ s τ 2 i 1 ] = ϕ ( 0 ) [ 1 2 Δ s ( 1 p ) ] [ ( τ 2 i 2 ) 1 p ( τ 2 i ) 1 p ] + 1 2 Δ s ( 1 p ) j = i n / 2 1 [ ( τ 2 j ) 1 p ( τ 2 j + 2 ) 1 p ] [ ϕ ( τ 2 j 2 i ) ϕ ( τ 2 j 2 i + 2 ) ] + 2 Δ s j = i n / 2 1 τ 2 j + 1 ϕ ( τ 2 j 2 i + 1 ) + f ( T 2 i ) ,
(38)

then, for t = T n 1 ,

κ 0 ( T n ) 2 Δ s + κ 0 ( T n 1 ) [ ( τ 2 ) 1 p 2 Δ s ( 1 p ) 1 ] + κ 0 ( T n 2 ) [ 1 2 Δ s 2 Δ s τ 1 ] + + κ 0 ( T 1 ) 1 2 Δ s ( 1 p ) [ ( τ n 4 ) 1 p 2 ( τ n 2 ) 1 p + ( τ n ) 1 p ] = ϕ ( τ 1 ) [ 1 2 Δ s ( 1 p ) ] [ ( τ n 2 ) 1 p ( τ n ) 1 p ] + 2 Δ s τ n 1 ϕ ( 0 ) + f ( T n 1 ) , (39)

and for t = T n ,

κ 0 ( T n ) [ 1 2 Δ s + ( τ 2 ) 1 p 2 Δ s ( 1 p ) 1 ] + κ 0 ( T 1 ) [ 2 Δ s τ 1 ] + κ 0 ( T n 2 ) [ 1 2 Δ s 2 ( τ 2 ) 1 p + ( τ 4 ) 1 p 2 Δ s ( 1 p ) ] + + κ 0 ( T 1 ) [ 2 Δ s τ n 1 ] = ϕ ( 0 ) [ 1 2 Δ s ( 1 p ) ] [ ( τ n 2 ) 1 p ( τ n ) 1 p ] + f ( T n ) . (40)

By collecting Equations (35), (36), (37), (38), (39), (40) and assuming α 0 k = κ 0 ( T k ) , for k = 0 , 1 , , n , the system [ A ] [ x ] = [ b ] is constructed, where

[ A ] = [ ( τ 2 ) 1 p 2 Δ s ( 1 p ) 1 1 2 Δ s 0 0 0 * * * 0 0 * * * ] n × n ,

and that of vector [ b ] is

[ b ] = [ f ( T 1 ) + ϕ ( 0 ) 1 2 Δ s + + 2 Δ s j = 0 n / 2 1 τ 2 j + 1 ϕ ( τ 2 j ) f ( T 2 ) + ϕ ( 0 ) ( τ 2 ) 1 p 2 Δ s ( 1 p ) + + 2 Δ s j = 1 n / 2 1 τ 2 j + 1 ϕ ( τ 2 j 1 ) f ( T n ) ϕ ( 0 ) ( τ n 2 ) 1 p ( τ n ) 1 p 2 Δ s ( 1 p ) ] n × 1 .

4. Numerical Examples

A desktop computer (Intel Pentium 4 microprocessor, 2.80 GHz CPU, and 224 MB RAM) was used for testing the examples.

Example 1. c ( s ) = 1 , ϕ ( s ) = s , f ( t ) = 3.5 2 t , x ( t ) = t .

Example 2. c ( s ) = 1 , ϕ ( s ) = 0 , f ( t ) = 1 + 2 t 0.5 t t 2 , x ( t ) = t .

Example 3. c ( s ) = 1 , ϕ ( s ) = s 2 , f ( t ) = 5 / 3 + 7 t 2 t 2 , x ( t ) = t 2 .

Example 4. c ( s ) = s , ϕ ( s ) = s , f ( t ) = 8 / 3 t / 2 , x ( t ) = t .

Example 5. c ( s ) = s , ϕ ( s ) = 0 , f ( t ) = 1 + 2 t 0.5 t + t 3 / 6 , x ( t ) = t .

Example 6. c ( s ) = s , ϕ ( s ) = s 2 , f ( t ) = 13 / 12 + 16 t / 3 t 2 / 2 , x ( t ) = t 2 .

5. Summary

In this study, we present numerical methods for solving a class of hybrid integro-differential equations; the equation of the first kind originates from an aeroelasticity model. The direct method from previous study provides satisfactory results essentially for the linear cases. For the nonlinear cases, a revised method is proposed to obtain more accurate results.

Cite this paper

Chiang, S. (2017) Numerical Methods for a Class of Hybrid Weakly Singular Integro-Differential Equations. Applied Mathematics, 8, 956-966. https://doi.org/10.4236/am.2017.87075

References

  1. 1. Burns, J.A., Cliff, E.M. and Herdman, T.L. (1983) A State-Space Model for an Aeroelastic System. 22nd IEEE Conference on Decision and Control, 1074-1077. https://doi.org/10.1109/CDC.1983.269685

  2. 2. Burns, J.A., Herdman, T.L. and Stech, H.W. (1983) Linear Functional Differential Equations as Semigroups on Product Spaces. SIAM Journal on Mathematical Analysis, 14, 98-116. https://doi.org/10.1137/0514007

  3. 3. Chen, H.-H. and Chiang, S. (2009) A Specific Procedure for Analytic Solutions to a Class of Singular Integral Equations. Chung Hua Journal of Computational Science, 7, 29-34.

  4. 4. Chiang, S. (2005) Notes on the Solution of a Class of Singular Integral Equations. Chung Hua Journal of Science and Engineering, 3, 89-95.

  5. 5. Chiang, S. (2006) On the Numerical Solution of a Class of Singular Integro-Differential Equations. Chung Hua Journal of Science and Engineering, 4, 43-48.

  6. 6. Kappel, F. and Zhang, K.P. (1986) Equivalence of Functional Equations of Neutral Type and Abstract Cauchy Problems. Monatshefte für Mathematik, 101, 115-133. https://doi.org/10.1007/BF01298925

  7. 7. Chiang, S. (2016) Numerical Algorithm and Its Revision for Solving a Class of Nonsingular Integro-Differential Equations of the First Kind. Chung Hua Journal of Computational Science, 6, 15-23.