Solution of Boundary Value Obstacle Problems Using MQ-RBF and ...

0 downloads 0 Views 2MB Size Report
for third-order obstacle problems and Siraj-ul-Islam et al. [12] proposed nonpolynomial spline methods. Some of these methods require huge computational ...
Hindawi Publishing Corporation Mathematical Problems in Engineering Volume 2013, Article ID 490639, 7 pages http://dx.doi.org/10.1155/2013/490639

Research Article Solution of Boundary Value Obstacle Problems Using MQ-RBF and IMQ-RBF Feng Gao and Chunmei Chi Science School, Qingdao Technological University, Qingdao, Shandong 266033, China Correspondence should be addressed to Feng Gao; [email protected] Received 24 November 2013; Accepted 16 December 2013 Academic Editor: Manyu Xiao Copyright © 2013 F. Gao and C. Chi. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. A kind of numerical method which is based on multiquadric RBF, inverse multiquadric RBF, and Wu-Schaback operators is presented for solving second-order and third-order boundary value problems associated with obstacle, unilateral, and contact problems. The algorithms are proved to be highly accurate and easy to implement. Some numerical tests are also presented to show the efficiency of the algorithms.

1. Introduction We consider the numerical solutions of the following secondorder boundary value problems: 𝑓 (𝑥) , 𝑎 ≤ 𝑥 ≤ 𝑐, { { 𝑢 (𝑥) = {𝑔 (𝑥) 𝑢 (𝑥) + 𝑓 (𝑥) + 𝑟, 𝑐 ≤ 𝑥 ≤ 𝑑, { 𝑑 ≤ 𝑥 ≤ 𝑏, {𝑓 (𝑥) , 󸀠󸀠

(1)

with the boundary conditions 𝑢 (𝑎) = 𝛼,

𝑢 (𝑏) = 𝛽

(2)

and the continuity conditions of 𝑢 and 𝑢󸀠 at 𝑐 and 𝑑. We also consider the following third-order boundary value problems: 𝑓 (𝑥) , 𝑎 ≤ 𝑥 ≤ 𝑐, { { 𝑢󸀠󸀠󸀠 (𝑥) = {𝑔 (𝑥) 𝑢 (𝑥) + 𝑓 (𝑥) + 𝑟, 𝑐 ≤ 𝑥 ≤ 𝑑, { 𝑑 ≤ 𝑥 ≤ 𝑏, {𝑓 (𝑥) ,

(3)

with the boundary conditions 𝑢 (𝑎) = 𝛼1 ,

𝑢󸀠 (𝑎) = 𝛼2 ,

𝑢󸀠 (𝑏) = 𝛽

(4)

and the continuity conditions of 𝑢, 𝑢󸀠 , and 𝑢󸀠󸀠 at 𝑐 and 𝑑. In the two problems, 𝑓(𝑥) and 𝑔(𝑥) are continuous functions and 𝛼, 𝛽, 𝛼1 , 𝛼2 are real constants. The two problems arise usually

in obstacle, contact, unilateral, and equilibrium problems associated with economics, transportation, oceanography, fluid flow through porous media, and many other fields of pure and applied sciences; see [1–12]. In the literature, some techniques were used to solve the previous two systems of second-order and third-order boundary value problems associated with obstacles. For example, for problem (1), Noor and Khalifa [13] used first-order accuracy collocation method with cubic splines as basis functions. Al-Said et al. [14] developed second- and fourth-order finite difference and spline methods. Al-Said [5] developed and analyzed quadratic and cubic splines methods. He proved that both quadratic and cubic spline methods can be used to produce second-order smooth approximations for the solution of (1) and its first derivative over the whole interval [𝑎, 𝑏]. Al-Said [7] also used cubic spline polynomial functions for solving problem (1). For the problem (3), Khalifa and Noor [15] applied quintic spline method for contact problems. Noor and Khalifa [16] applied quartic spline method for odd-order obstacle problems. Gao and Chi [17] applied quartic B-spline method for third-order obstacle problems and Siraj-ul-Islam et al. [12] proposed nonpolynomial spline methods. Some of these methods require huge computational work for finding the numerical solutions. In this paper, we use multiquadric RBF (MQs) and inverse multiquadric RBF (IMQs) to solve systems of second-order

2

Mathematical Problems in Engineering

and third-order boundary value problems associated with obstacle. Recently, radial base functions (RBF) have been widely applied to the numerical solution of many types of PDE; see [18, 19]. The advantage of techniques of using RBF is that mesh grid can be avoided and high accuracy can be achieved. However, to the authors’ knowledge, little work has been done involving the usage of RBF in the solution of boundary value obstacle problems. Among Radial Basis Functions, MQs and IMQs are especially suitable for solving second- and third-order boundary value problems associated with obstacles because we can integrate IMQs to get MQs. Our technique is that we first use IMQs or MQs quasiinterpolation to approximate the derivatives of the solution of problems of (1) and (3); then we get their integrals to approximate the solutions. The following part of this paper is organized as follows. In Section 2, we review some basics of RBFs. In Section 3, we present the numerical schemes for problem (1) and (3). In Section 4, we do some numerical experiments. Section 5 is our conclusion.

We also adopt a kind of Quasi-interpolation to numerically solve problem (1) and (3). The Quasi-interpolation of a univariate function 𝑓 : [𝑎, 𝑏] → 𝑅 with MQs is constructed as follows. On the scattered points

2. RBF and MQ Quasi-Interpolation

where 𝑠 is a shape parameter. Given data {(𝑥𝑖 , 𝑓𝑖 )}𝑛𝑖=1 , Wu–Schabacks 𝐿 𝐷 operator is

RBF was proposed in 1951 [20] to deal with geological problem. For a given region Ω ∈ 𝑅𝑚 and a set distinct interpolation points, 𝑋 = {𝑥1 , 𝑥2 , . . . 𝑥𝑁} ⊂ Ω.

(5)

Given a function 𝑓 : 𝑋 → 𝑅, construct the interpolation to 𝑓 𝑁 󵄩 󵄩 𝑆𝑓,𝑋 (𝑥) = ∑ 𝛼𝑗 𝜑 (󵄩󵄩󵄩󵄩𝑥 − 𝑥𝑗 󵄩󵄩󵄩󵄩) ,

for 𝑥 ∈ Ω,

(6)

𝑗=1

where ‖ ⋅ ‖ denote Euclidean norm and 𝜑 is a certain RBF. The undetermined coefficients {𝛼1 , 𝛼2 , . . . , 𝛼𝑁} can be obtained by the linear system 𝑁 󵄩 󵄩 ∑ 𝛼𝑗 𝜑 (󵄩󵄩󵄩󵄩𝑥𝑖 − 𝑥𝑗 󵄩󵄩󵄩󵄩) = 𝑓 (𝑥𝑖 ) ,

𝑖 = 1, 2, . . . , 𝑁.

(7)

𝑗=1

We adopt multiquadric (MQs) RBF 𝜙 (𝑟) = √𝑠2 + 𝑟2

(8)

and inverse multiquadric (IMQs) RBF 𝜑 (𝑟) =

𝑠2 (𝑠2 + 𝑟2 )

(9)

3/2

to solve second-order and third-order boundary value obstacle problems, where 𝑠 ∈ 𝑅+ is a shape parameter. From [21], we know that the linear system (7) has unique solution. It is easy to see that 󸀠󸀠

(√𝑠2 + 𝑟2 ) =

𝑠2 3/2

(𝑠2 + 𝑟2 )

.

(10)

𝑎 = 𝑥0 < 𝑥1 < ⋅ ⋅ ⋅ < 𝑥𝑛 = 𝑏, (11)

ℎ := max (𝑥𝑖 − 𝑥𝑖−1 ) . 1≤𝑖≤𝑛

Quasi-interpolant of 𝑓 usually is as follows: 𝑛

(𝑀𝑓) (𝑥) = ∑ 𝑓 (𝑥𝑖 ) 𝜓𝑖 (𝑥) ,

(12)

𝑖=0

where 𝜓𝑖 (𝑥) is linear combinations of the MQs. Consider 2 󵄨 󵄨 𝜙𝑖 (󵄨󵄨󵄨𝑥 − 𝑥𝑖 󵄨󵄨󵄨) = √𝑠2 + (𝑥 − 𝑥𝑖 ) ,

𝑠 ∈ 𝑅+ ,

(13)

𝑛

(𝐿 𝐷𝑓) (𝑥) = ∑ 𝑓 (𝑥𝑗 ) 𝜓𝑗 (𝑥) ,

(14)

𝑗=0

where 󵄨 󵄨 1 𝜙 1 (󵄨󵄨󵄨𝑥 − 𝑥1 󵄨󵄨󵄨) − (𝑥 − 𝑥0 ) , + 2 2 (𝑥1 − 𝑥0 ) 󵄨 󵄨 󵄨 󵄨 𝜙 (󵄨󵄨𝑥 − 𝑥2 󵄨󵄨󵄨) − 𝜙1 (󵄨󵄨󵄨𝑥 − 𝑥1 󵄨󵄨󵄨) 𝜓1 (𝑥) = 2 󵄨 2 (𝑥2 − 𝑥1 ) 󵄨 󵄨 𝜙 (󵄨󵄨𝑥 − 𝑥1 󵄨󵄨󵄨) − (𝑥 − 𝑥0 ) − 1 󵄨 , 2 (𝑥1 − 𝑥0 ) 󵄨 󵄨 (𝑥 − 𝑥) − 𝜙𝑛−1 (󵄨󵄨󵄨𝑥 − 𝑥𝑛−1 󵄨󵄨󵄨) 𝜓𝑛−1 (𝑥) = 𝑛 2 (𝑥𝑛 − 𝑥𝑛−1 ) 󵄨 󵄨 󵄨 󵄨 𝜙 (󵄨󵄨𝑥 − 𝑥𝑛−1 󵄨󵄨󵄨) − 𝜙𝑛−2 (󵄨󵄨󵄨𝑥 − 𝑥𝑛−2 󵄨󵄨󵄨) − 𝑛−1 󵄨 , 2 (𝑥𝑛−1 − 𝑥𝑛−2 ) 󵄨 󵄨 1 𝜙𝑛−1 (󵄨󵄨󵄨𝑥 − 𝑥𝑛−1 󵄨󵄨󵄨) − (𝑥𝑛 − 𝑥) 𝜓𝑛 (𝑥) = + , 2 2 (𝑥𝑛 − 𝑥𝑛−1 ) 𝜓0 (𝑥) =

𝜓𝑗 (𝑥) =

(15)

󵄨 󵄨 󵄨 󵄨 𝜙𝑗−1 (󵄨󵄨󵄨󵄨𝑥 − 𝑥𝑗−1 󵄨󵄨󵄨󵄨) − 𝜙𝑗 (󵄨󵄨󵄨󵄨𝑥 − 𝑥𝑗 󵄨󵄨󵄨󵄨) 2 (𝑥𝑗−1 − 𝑥𝑗 )



󵄨 󵄨 󵄨 󵄨 𝜙𝑗 (󵄨󵄨󵄨󵄨𝑥 − 𝑥𝑗 󵄨󵄨󵄨󵄨) − 𝜙𝑗−1 (󵄨󵄨󵄨󵄨𝑥 − 𝑥𝑗−1 󵄨󵄨󵄨󵄨) 2 (𝑥𝑗 − 𝑥𝑗−1 )

,

𝑗 = 2, . . . , 𝑛 − 2. The advantage of 𝐿 𝐷 operator is that high accuracy can be achieved without solving any linear system.

Mathematical Problems in Engineering

3

For ∫ 𝜓𝑖 (𝑥)𝑑𝑥, we need only to integrate 𝜙𝑖 (|𝑥 − 𝑥𝑖 |),

where 𝜆, 𝜇 are constants. Therefore,

󵄨 󵄨 ∫ 𝜙𝑖 (󵄨󵄨󵄨𝑥 − 𝑥𝑖 󵄨󵄨󵄨) 𝑑𝑥

𝑛 󵄨 󵄨 𝑢 (𝑥) = ∫ 𝑑𝑥 ∫ ∑ 𝛼𝑗 𝜑𝑚+𝑗 (󵄨󵄨󵄨󵄨𝑥 − 𝑥𝑚+𝑗 󵄨󵄨󵄨󵄨) 𝑑𝑥

2

= ∫ √ 𝑠2 + (𝑥 − 𝑥𝑗 ) 𝑑𝑥 2

=

(𝑥 − 𝑥𝑗 ) √ (𝑥 − 𝑥𝑗 ) +

𝑗=1

(16)

𝑠2

𝑛 󵄨 󵄨 = ∑ 𝛼𝑗 𝜙𝑚+𝑗 (󵄨󵄨󵄨󵄨𝑥 − 𝑥𝑚+𝑗 󵄨󵄨󵄨󵄨) + 𝜆𝑥 + 𝜇, 𝑗=1

2

𝑥 ∈ [𝑐, 𝑑] ,

2 𝑠2 + ln ((𝑥 − 𝑥𝑗 ) + √ (𝑥 − 𝑥𝑗 ) + 𝑠2 ) . 2

For ∫ 𝑑𝑥 ∫ 𝜓𝑖 (𝑥)𝑑𝑥, which is denoted with Φ𝑖 (𝑥), we have 󵄨 󵄨 ∫ 𝑑𝑥 ∫ 𝜙𝑖 (󵄨󵄨󵄨𝑥 − 𝑥𝑖 󵄨󵄨󵄨) 𝑑𝑥 2

2

= ∫ 𝑑𝑥 ∫ √ 𝑠2 + (𝑥 − 𝑥𝑗 ) 𝑑𝑥 =

((𝑥 − 𝑥𝑗 ) + 𝑠2 ) 6

𝑚

(17)

2 𝑠2 √ (𝑥 − 𝑥𝑗 ) + 𝑠2 . 2

3. Numerical Algorithms To solve problem (1) and (3), we set 𝑎 = 𝑥1 < 𝑥2 < ⋅ ⋅ ⋅ < 𝑥𝑚 = 𝑐 = 𝑥𝑚+1 < 𝑥𝑚+2 < ⋅ ⋅ ⋅ < 𝑥𝑚+𝑛

where 𝜆, 𝜇 are constants and 𝜙𝑗 (|𝑥 − 𝑥𝑗 |) are defined in (15). Therefore, we have the approximation to the solution to problem (1) as follows:

1.5

2 𝑠2 + (𝑥 − 𝑥𝑗 ) ln ((𝑥 − 𝑥𝑗 ) + √ (𝑥 − 𝑥𝑗 ) + 𝑠2 ) 2



(18)

{ { ∫𝑑𝑥∫ ∑𝑓 (𝑥𝑗 ) 𝜓𝑗 (𝑥) 𝑑𝑥 { { { 𝑗=1 { { { 𝑚 { { { = ∑ 𝑓 (𝑥 ) Φ (𝑥) + 𝑐 𝑥 + 𝑐 , { 𝑗 𝑗 1 2 { { { 𝑗=1 { { { 𝑛 { { {∑ 𝛼 𝜙 (󵄨󵄨󵄨󵄨𝑥 − 𝑥 󵄨󵄨󵄨󵄨) { 𝑗 𝑚+𝑗 󵄨 𝑚+𝑗 󵄨 { { {𝑗=1 𝑢={ +𝜆𝑥 + 𝜇, { { { { 𝑘 { { { { 𝑓 (𝑥𝑚+𝑛+𝑗 ) 𝜓𝑚+𝑛+𝑗 (𝑥) 𝑑𝑥 ∑ ∫𝑑𝑥∫ { { { 𝑗=1 { { { { 𝑘 { { { 𝑓 (𝑥𝑚+𝑛+𝑗 ) Φ𝑚+𝑛+𝑗 (𝑥) = ∑ { { { { 𝑗=1 { { +𝑐3 𝑥 + 𝑐4 , {

𝑥 ∈ [𝑎, 𝑐] ,

𝑥 ∈ [𝑐, 𝑑] ,

𝑥 ∈ [𝑑, 𝑏] ,

= 𝑑 = 𝑥𝑚+𝑛+1 < 𝑥𝑚+𝑛+2 < ⋅ ⋅ ⋅ < 𝑥𝑚+𝑛+𝑘 = 𝑏. Construct (𝐿 𝐷𝑓)(𝑥) = ∑𝑚 𝑗=1 𝑓(𝑥𝑗 )𝜓𝑗 (𝑥) on [𝑎, 𝑐] to approx-

imate 𝑓(𝑥), 𝑥 ∈ [𝑎, 𝑐]; and (𝐿 𝐷𝑓)(𝑥) = ∑𝑘𝑗=1 𝑓(𝑥𝑚+𝑛+𝑗 ) 𝜓𝑚+𝑛+𝑗 (𝑥) on [𝑑, 𝑏] to approximate 𝑓(𝑥), 𝑥 ∈ [𝑑, 𝑏]. On the interval [𝑐, 𝑑], let 𝑢󸀠󸀠 (𝑥) = ∑𝑛𝑗=1 𝛼𝑗 𝜑𝑚+𝑗 (|𝑥−𝑥𝑚+𝑗 |), where 󵄨 󵄨 𝜑𝑚+𝑗 (󵄨󵄨󵄨󵄨𝑥 − 𝑥𝑚+𝑗 󵄨󵄨󵄨󵄨) =

𝑠2 (𝑠2

2 3/2

+ (𝑥 − 𝑥𝑚+𝑗 ) )

,

∫(

𝑥 − 𝑥𝑗 2

√ (𝑠2 + (𝑥 − 𝑥𝑗 ) )

(23)

where Φ𝑗 (𝑥) = ∫ 𝑑𝑥 ∫ 𝜓𝑖 (𝑥)𝑑𝑥 and is computed in (17), and 𝑐1 , 𝑐2 , 𝜆, 𝜇, 𝑐3 , 𝑐4 are constants. We need to determine the coefficients 𝑐1 , 𝑐2 , 𝛼1 , . . . , 𝛼𝑛 , 𝜆, 𝜇, 𝑐3 , 𝑐4 to identify the numerical solution (23) to problem (1). Let

(19) 𝑚

and 𝑠 is a shape parameter and 𝛼𝑗 , 𝑗 = 1, . . . , 𝑛 are coefficients to be identified. We can easily verify that 󵄨 󵄨 ∫ 𝜑𝑗 (󵄨󵄨󵄨󵄨𝑥 − 𝑥𝑗 󵄨󵄨󵄨󵄨) 𝑑𝑥 =

(22)

𝐻1 (𝑥) = ∑𝑓 (𝑥𝑗 ) Φ𝑗 (𝑥) + 𝑐1 𝑥 + 𝑐2 ,

𝑥 ∈ [𝑎, 𝑐] ,

𝑗=1

𝑛

𝑥 − 𝑥𝑗 2

√ (𝑠2 + (𝑥 − 𝑥𝑗 ) )

+ 𝜆,

(20)

󵄨 󵄨 𝐻2 (𝑥) = ( ∑ 𝛼𝑗 𝜙𝑚+𝑗 (󵄨󵄨󵄨󵄨𝑥 − 𝑥𝑚+𝑗 󵄨󵄨󵄨󵄨) + 𝜆𝑥 + 𝜇) , 𝑗=1

𝑥 ∈ [𝑐, 𝑑] , 𝑘

󵄨 󵄨 + 𝜆) 𝑑𝑥 = 𝜙𝑗 (󵄨󵄨󵄨󵄨𝑥 − 𝑥𝑗 󵄨󵄨󵄨󵄨) + 𝜆𝑥 + 𝜇,

𝐻3 (𝑥) = ∑𝑓 (𝑥𝑚+𝑛+𝑗 ) Φ𝑚+𝑛+𝑗 (𝑥) + 𝑐3 𝑥 + 𝑐4 ,

(21)

𝑥 ∈ [𝑑, 𝑏] .

𝑗=1

(24)

4

Mathematical Problems in Engineering

Substitute (24) into problem (1) at points (18) to get the following linear system: 𝐻1 (𝑎) = 𝛼, 𝐻1󸀠

(𝑐) =

(𝑐) ,

(𝑥 − 𝑥𝑗 ) √ (𝑥 − 𝑥𝑗 ) + 𝑠2 2

𝑛

𝑗=1

= 𝑔 (𝑥𝑚+𝑖 ) 𝐻2 (𝑥𝑚+𝑖 ) + 𝑓 (𝑥𝑚+𝑖 ) + 𝑟,

(25)

2 𝑠 ln ((𝑥 − 𝑥𝑗 ) + √ (𝑥 − 𝑥𝑗 ) + 𝑠2 ) . 2

Therefore, we need to identify the following numerical solution to (3): 𝑚

𝑖 = 1, . . . , 𝑛, 𝐻2󸀠 (𝑑) = 𝐻3󸀠 (𝑑) ,

𝐻3 (𝑏) = 𝛽, where 𝐻1󸀠 (𝑥), 𝐻3󸀠 (𝑥) can be computed in (16) and 𝐻2󸀠 (𝑥) can be computed in (20). Solving the linear system (24), we get 𝑐1 , 𝑐2 , 𝛼1 , . . . , 𝛼𝑛 , 𝜆, 𝜇, 𝑐3 , 𝑐4 to identify the numerical solution (23) to problem (1). To solve problem (3), we use

{ { ∑ 𝛼𝑗 𝜁𝑗 (𝑥) + 𝑐1 𝑥2 + 𝑐2 𝑥 + 𝑐3 , { { { 𝑗=1 { { { 𝑛 { { 2 𝑢 = { ∑ 𝛼𝑚+𝑗 𝜁𝑚+𝑗 (𝑥) + 𝜆𝑥 + 𝜇𝑥 + ], { 𝑗=1 { { { 𝑘 { { 2 { { { ∑ 𝛼𝑚+𝑛+𝑗 𝜁𝑚+𝑛+𝑗 (𝑥) + 𝑐4 𝑥 + 𝑐5 𝑥 + 𝑐6 . { 𝑗=1

(32)

To determine the coefficients 𝑐1 , 𝑐2 , 𝑐3 , 𝛼1 , . . . , 𝛼𝑚+𝑛+𝑘 , 𝜆, 𝜇, ], 𝑐3 , 𝑐4 , 𝑐5 , denote 𝑚

𝐻1 (𝑥) = ∑𝛼𝑗 𝜁𝑗 (𝑥) + 𝑐1 𝑥2 + 𝑐2 𝑥 + 𝑐3 , 𝑗=1

𝑚

󵄨 󵄨 ∑ 𝛼𝑗 𝜑𝑗 (󵄨󵄨󵄨󵄨𝑥 − 𝑥𝑗 󵄨󵄨󵄨󵄨) ,

𝑛

𝐻2 (𝑥) = ∑𝛼𝑚+𝑗 𝜁𝑚+𝑗 (𝑥) + 𝜆𝑥2 + 𝜇𝑥 + ],

𝑗=1

𝑗=1

𝑛

󵄨 󵄨 ∑ 𝛼𝑚+𝑗 𝜑𝑚+𝑗 (󵄨󵄨󵄨󵄨𝑥 − 𝑥𝑚+𝑗 󵄨󵄨󵄨󵄨) ,

(26)

𝑗=1

(33)

𝑘

𝐻3 (𝑥) = ∑𝛼𝑚+𝑛+𝑗 𝜁𝑚+𝑛+𝑗 (𝑥) + 𝑐4 𝑥2 + 𝑐5 𝑥 + 𝑐6 , 𝑗=1

𝑘

󵄨 󵄨 ∑ 𝛼𝑚+𝑛+𝑗 𝜑𝑚+𝑛+𝑗 (󵄨󵄨󵄨󵄨𝑥 − 𝑥𝑚+𝑛+𝑗 󵄨󵄨󵄨󵄨)

𝑗=1

to approximate 𝑢󸀠󸀠󸀠 on intervals [𝑎, 𝑐], [𝑐, 𝑑], and [𝑑, 𝑏], respectively, where 󵄨 󵄨 𝜑𝑚+𝑗 (󵄨󵄨󵄨󵄨𝑥 − 𝑥𝑚+𝑗 󵄨󵄨󵄨󵄨) =

(31)

2

+

󵄨 󵄨 ∑ 𝛼𝑗 𝜑𝑚+𝑗 (󵄨󵄨󵄨󵄨𝑥𝑚+𝑖 − 𝑥𝑚+𝑗 󵄨󵄨󵄨󵄨)

𝐻2 (𝑑) = 𝐻3 (𝑑) ,

2

𝜁𝑗 (𝑥) =

𝐻1 (𝑐) = 𝐻2 (𝑐) , 𝐻2󸀠

where ] is a constant and

and 𝐻1󸀠 (𝑥), 𝐻2󸀠 (𝑥), 𝐻3󸀠 (𝑥) can be computed in (29) and 𝐻1󸀠󸀠 (𝑥), 𝐻2󸀠󸀠 (𝑥), 𝐻3󸀠󸀠 (𝑥) can be computed in (28). Substitute (25) into problem (3) at points (18) to get the following linear system: 𝐻1 (𝑎) = 𝛼1 , 𝐻1 (𝑐) = 𝐻2 (𝑐) ,

𝑠2 2 3/2

(𝑠2 + (𝑥 − 𝑥𝑚+𝑗 ) )

(27)

𝐻1󸀠 (𝑎) = 𝛼2 , 𝐻1󸀠 (𝑐) = 𝐻2󸀠 (𝑐) ,

𝐻1󸀠󸀠 (𝑐) = 𝐻2󸀠󸀠 (𝑐) , 𝑛

󸀠󸀠

󸀠

and 𝑠 is a shape parameter. To get 𝑢 , 𝑢 , and 𝑢, we need only to compute 󵄨 󵄨 ∫ 𝜑𝑗 (󵄨󵄨󵄨󵄨𝑥 − 𝑥𝑗 󵄨󵄨󵄨󵄨) 𝑑𝑥 =

𝑗=1

(34)

= 𝑔 (𝑥𝑖 ) 𝐻2 (𝑥𝑚+𝑖 ) + 𝑓 (𝑥𝑚+𝑖 ) + 𝑟,

𝑥 − 𝑥𝑗 (𝑠2

󵄨 󵄨 ∑ 𝛼𝑚+𝑗 𝜑𝑚+𝑗 (󵄨󵄨󵄨󵄨𝑥𝑚+𝑖 − 𝑥𝑚+𝑗 󵄨󵄨󵄨󵄨)

2 1/2

+ 𝜆,

+ (𝑥 − 𝑥𝑗 ) )

󵄨 󵄨 󵄨 󵄨 ∫ 𝑑𝑥 ∫ 𝜑𝑗 (󵄨󵄨󵄨󵄨𝑥 − 𝑥𝑗 󵄨󵄨󵄨󵄨) 𝑑𝑥 = 𝜙𝑗 (󵄨󵄨󵄨󵄨𝑥 − 𝑥𝑗 󵄨󵄨󵄨󵄨) + 𝜆𝑥 + 𝜇,

𝑖 = 2, . . . , 𝑛 − 1,

(28) 𝐻2 (𝑑) = 𝐻3 (𝑑) , (29)

where 𝜆, 𝜇 are constants and 𝜙𝑗 is defined in (13). And we also have 𝜆2 󵄨 󵄨 ∫ (𝜙𝑗 (󵄨󵄨󵄨󵄨𝑥 − 𝑥𝑗 󵄨󵄨󵄨󵄨) + 𝜆𝑥 + 𝜇) 𝑑𝑥 = 𝜁𝑗 (𝑥) + 𝑥2 + 𝜇 + ], 2 (30)

𝐻2󸀠󸀠 (𝑑) = 𝐻3󸀠󸀠 (𝑑) ,

𝐻2󸀠 (𝑑) = 𝐻3󸀠 (𝑑) , 𝐻3󸀠 (𝑏) = 𝛽.

Then, we can solve (34) to identify the numerical solution (32) to problem (3).

4. Numerical Experiment We do numerical experiments to test the efficiency of our numerical methods.

Mathematical Problems in Engineering

5

Table 1: Comparison of exact and numerical solutions for Example 1. 𝑥 𝑥1 𝑥3 𝑥6 𝑥7 𝑥8 𝑥9 𝑥10 𝑥11 𝑥14 𝑥16 𝐿 ∞ error 𝐿 2 error

𝑠 = 1.0, 𝑚 = 𝑛 = 6 RBF method 0 0.13633712736 0.34084281842 0.44620383234 0.49629810661 0.49629810661 0.44620383234 0.34084281842 0.13633712736 0 8.82875509702𝑒 − 004 2.09345530306𝑒 − 004

𝑠 = 1.2, 𝑚 = 𝑛 = 9 RBF method 0 0.13596345616525 0.33994454291217 0.44536178581320 0.49553678904558 0.49553578798663 0.44536480583846 0.33996457654310 0.13597686714765 0 1.54000009599𝑒 − 005 3.69805440717𝑒 − 006

Exact solution 0 0.13598397716525 0.33995994291313 0.44535138581350 0.49554948904960 0.49554948904960 0.44535138581350 0.33995994291313 0.13598397716525 0

Table 2: Comparison of exact and numerical solutions for Example 2. 𝑥 0.0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1.0 𝐿 ∞ error 𝐿 2 error

𝑠 = 1.0, 𝑚 = 𝑛 = 6 RBF method 0 0.00078568857778 0.00294888593935 0.00653975857589 0.01101039579013 0.01550387591395 0.01909384653746 0.02053875436899 0.01951387899385 0.01862948575889 0.01832948588680 6.145552721𝑒 − 005 1.290788173𝑒 − 005

0 0.00072603711810 0.00290414847242 0.00651360507585 0.01105748825987 0.01556533144116 0.01905044604835 0.02053013998469 0.01955230368928 0.01867323762406 0.01838021560231

Example 1. Consider the following second-order boundary obstacle problem as given in [22]: 0, { { { { { { { 𝑢󸀠󸀠 = {𝑢 − 1, { { { { { {0, {

𝜋 , 4 3 𝜋 ≤ 𝑥 ≤ 𝜋, 4 4 3 𝜋 ≤ 𝑥 ≤ 𝜋, 4

0≤𝑥≤

The results are reported in Table 1. The errors between numerical and exact solution in terms of 𝐿 ∞ and 𝐿 2 are listed in Table 1. The accuracy of the proposed method is measured using the 𝐿 2 and 𝐿 ∞ error norms defined as

(35) 𝐿2 =

𝑛 1 2 √ ∑ 󵄨󵄨󵄨󵄨𝑢𝑖exact − 𝑢𝑖num 󵄨󵄨󵄨󵄨 , 𝑛 + 1 𝑖=0

𝐿∞

with boundary condition 𝑢(0) = 0, 𝑢(𝜋) = 0. The exact solution of this problem is given as 𝜋 4 { 𝑥, 0≤𝑥≤ , { { 𝑟 4 { 1 { { { { 𝜋 𝜋 3 4 ≤ 𝑥 ≤ 𝜋, 𝑢 = {1 − cosh ( − 𝑥) , 𝑟 4 4 4 { { {4 2 3 { { { 𝜋 ≤ 𝑥 ≤ 𝜋, { 𝑟 (𝜋 − 𝑥) , 4 { 1

𝑠 = 1.2, 𝑚 = 𝑛 = 9 RBF method 0 0.00072504958690 0.00290536784209 0.00651038335789 0.01105193964378 0.01556193848997 0.01905677849423 0.02053284784996 0.01955135789349 0.01867204968224 0.01838334510084 6.3324458800𝑒 − 006 9.7350311797𝑒 − 007

Exact solution

(37)

󵄨 󵄨 = max 󵄨󵄨󵄨󵄨𝑢𝑖exact − 𝑢𝑖num 󵄨󵄨󵄨󵄨 . 0≤𝑖≤𝑛

In Table 1, we set

(36)

where 𝑟1 = 𝜋 + 4 coth(𝜋/4), 𝑟2 = 𝜋 sinh(𝜋/4) + 4 cosh(𝜋/4).

𝑥𝑖 = (𝑖 − 1) ℎ1 , 𝑥𝑖 =

𝜋 + (𝑖 − 6) ℎ2 , 4

3 𝑥𝑖 = 𝜋 + (𝑖 − 11) ℎ1 , 4

𝑖 = 1, 2, . . . , 6, ℎ1 =

𝜋 , 20

𝑖 = 6, 7, . . . , 11, ℎ2 =

𝜋 , 10

𝑖 = 12, 13, . . . , 17, ℎ1 =

𝜋 . 20

(38)

6

Mathematical Problems in Engineering

Example 2. Consider the following third-order boundary obstacle problem as given in [17]: 0, { { { { { { { 𝑢󸀠󸀠󸀠 (𝑥) = {𝑢 (𝑥) − 1, { { { { { {0, {

1 0≤𝑥≤ , 4 3 1 ≤𝑥≤ , 4 4 3 ≤ 𝑥 ≤ 1, 4

(39)

with boundary conditions 𝑢(0) = 0, 𝑢󸀠 (0) = 0, 𝑢󸀠 (1) = 0. The exact solution of this problem is 1 1 { 0≤𝑥≤ , 𝑎1 𝑥2 , { { 2 4 { { { 1 + 𝑎2 𝑒𝑥 { { { { { { +𝑒−𝑥/2 (𝑎 cos √3 𝑥 { 3 𝑢 (𝑥) = { 2 { { √3 { 1 3 { { +𝑎4 sin 𝑥) , ≤𝑥≤ , { { { 2 4 4 { { { 3 {𝑎 𝑥 ( 1 𝑥 − 1) + 𝑎 , ≤ 𝑥 ≤ 1, 6 { 5 2 4

(40)

where 𝑎1 = 0.14520742362098, 𝑎2 = −0.21130240827197, 𝑎3 = −0.78610085318732, 𝑎4 = −0.24585768969643,

(41)

𝑎5 = 0.05860440434801, 𝑎6 = 0.04768241777632. The results are reported in Table 2. The errors between numerical and exact solution in terms of 𝐿 ∞ and 𝐿 2 are listed in Table 2. From the results of Tables 1 and 2, we can see that the shape parameter 𝑠 plays no significant role in the computation.

5. Conclusions In this paper, based on the multiquadric RBF and inverse multiquadric RBF, numerical schemes are presented for solving system of second-order and third-order boundary value problems associated with obstacle. The schemes are shown to be highly accurate and easy to implement. We point out three notes here. First, to solve second-order problem, we use 𝐿 𝐷 operator to approximate the derivatives on the interval [𝑎, 𝑐] and [𝑑, 𝑏] because by using 𝐿 𝐷 operator, we can on one hand avoid solving linear systems and on the other hand achieve high accuracy. Second, to solve third-order problem, we do not employ 𝐿 𝐷 operators to approximate the derivatives on the interval [𝑎, 𝑐] and [𝑑, 𝑏] because it is no easy to integrate 𝐿 𝐷𝑓 for three times and no explicit integral expressions can be found. Third, why we choose MQs and IMQs rather than other RBF? That is because

MQs and IMQs can achieve high accuracy and IMQs are the second derivatives of MQs and this property bring much convenience to our calculation. Further study can be carried out for the applications of RBF in the numerical solution of higher-order boundary value obstacle problems.

References [1] C. Baiocchi and A. Capelo, Variational and Quasivariational Inequalities, John Wiley & Sons, New York, NY, USA, 1984. [2] F. Giannessi and A. Magueri, Variational Inequalities and Network Equilibrium Problems, Plenum Press, New York, NY, USA, 1995. [3] M. A. Noor, K. I. Noor, and T. M. Rassias, “Some aspects of variational inequalities,” Journal of Computational and Applied Mathematics, vol. 47, no. 3, pp. 285–312, 1993. [4] E. A. Al-Said, “Smooth spline solutions for a system of second order boundary value problems,” Journal of Natural Geometry, vol. 16, no. 1-2, pp. 19–28, 1999. [5] E. A. Al-Said, “Spline solutions for system of second-order boundary-value problems,” International Journal of Computer Mathematics, vol. 62, no. 1-2, pp. 143–154, 1996. [6] E. A. Al-Said, “Spline methods for solving system of secondorder boundary-value problems,” International Journal of Computer Mathematics, vol. 70, no. 4, pp. 717–727, 1999. [7] E. A. Al-Said, “The use of cubic splines in the numerical solution of a system of second-order boundary value problems,” Computers & Mathematics with Applications, vol. 42, no. 6-7, pp. 861–869, 2001. [8] M. Aslam Noor, “Some developments in general variational inequalities,” Applied Mathematics and Computation, vol. 152, no. 1, pp. 199–277, 2004. [9] M. A. Noor, Principles of Variational Inequalities, Lap-Lambert Academic Publishing AG, Saarbr¨ucken, Germany, 2009. [10] M. A. Noor, K. I. Noor, A. Waheed, and E.-A. Eisa-Al-Said, “Modified variation of parameters method for solving system of second-order nonlinear boundary value problem,” International Journal of Physical Sciences, vol. 5, no. 16, pp. 2426–2431, 2010. [11] M. A. Noor and S. I. A. Tirmizi, “Numerical methods for unilateral problems,” Journal of Computational and Applied Mathematics, vol. 16, no. 3, pp. 387–395, 1986. [12] Siraj-ul-Islam, M. A. Khan, I. A. Tirmizi, and E. H. Twizell, “Non polynomial spline approach to the solution of a system of third-order boundary-value problems,” Applied Mathematics and Computation, vol. 168, no. 1, pp. 152–163, 2005. [13] M. A. Noor and A. K. Khalifa, “Cubic splines collocation methods for unilateral problems,” International Journal of Engineering Science, vol. 25, no. 11-12, pp. 1525–1530, 1987. [14] E. A. Al-Said, M. A. Noor, and A. A. Al-Shejari, “Numerical solutions for system of second order boundary value problems,” The Korean Journal of Computational & Applied Mathematics, vol. 5, no. 3, pp. 659–667, 1998. [15] A. K. Khalifa and M. A. Noor, “Quintic splines solutions of a class of contact problems,” Mathematical and Computer Modelling, vol. 13, no. 2, pp. 51–58, 1990. [16] M. A. Noor and A. K. Khalifa, “A numerical approach for oddorder obstacle problems,” International Journal of Computer Mathematics, vol. 54, no. 1-2, pp. 109–116, 1994.

Mathematical Problems in Engineering [17] F. Gao and C.-M. Chi, “Solving third-order obstacle problems with quartic B-splines,” Applied Mathematics and Computation, vol. 180, no. 1, pp. 270–274, 2006. [18] E. Larsson and B. Fornberg, “A numerical study of some radial basis function based solution methods for elliptic PDEs,” Computers & Mathematics with Applications. An International Journal, vol. 46, no. 5-6, pp. 891–902, 2003. [19] M. D. Buhmann, S. Dinew, and E. Larsson, “A note on radial basis function interpolant limits,” IMA Journal of Numerical Analysis, vol. 30, no. 2, pp. 543–554, 2010. [20] D. G. Krige, A statistical approach to some mine valuation and allied problems on the Witwatersrand, [M.Sc. thesis], University of Witwatersrand, Witwatersrand, South Africa, 1951. [21] C. A. Micchelli, “Interpolation of scattered data: distance matrices and conditionally positive definite functions,” Constructive Approximation, vol. 2, no. 1, pp. 11–22, 1986. [22] P. Villaggio, “The Ritz method in solving unilateral problems in elasticity,” Meccanica, vol. 16, no. 3, pp. 123–127, 1981.

7

Advances in

Operations Research Hindawi Publishing Corporation http://www.hindawi.com

Volume 2014

Advances in

Decision Sciences Hindawi Publishing Corporation http://www.hindawi.com

Volume 2014

Journal of

Applied Mathematics

Algebra

Hindawi Publishing Corporation http://www.hindawi.com

Hindawi Publishing Corporation http://www.hindawi.com

Volume 2014

Journal of

Probability and Statistics Volume 2014

The Scientific World Journal Hindawi Publishing Corporation http://www.hindawi.com

Hindawi Publishing Corporation http://www.hindawi.com

Volume 2014

International Journal of

Differential Equations Hindawi Publishing Corporation http://www.hindawi.com

Volume 2014

Volume 2014

Submit your manuscripts at http://www.hindawi.com International Journal of

Advances in

Combinatorics Hindawi Publishing Corporation http://www.hindawi.com

Mathematical Physics Hindawi Publishing Corporation http://www.hindawi.com

Volume 2014

Journal of

Complex Analysis Hindawi Publishing Corporation http://www.hindawi.com

Volume 2014

International Journal of Mathematics and Mathematical Sciences

Mathematical Problems in Engineering

Journal of

Mathematics Hindawi Publishing Corporation http://www.hindawi.com

Volume 2014

Hindawi Publishing Corporation http://www.hindawi.com

Volume 2014

Volume 2014

Hindawi Publishing Corporation http://www.hindawi.com

Volume 2014

Discrete Mathematics

Journal of

Volume 2014

Hindawi Publishing Corporation http://www.hindawi.com

Discrete Dynamics in Nature and Society

Journal of

Function Spaces Hindawi Publishing Corporation http://www.hindawi.com

Abstract and Applied Analysis

Volume 2014

Hindawi Publishing Corporation http://www.hindawi.com

Volume 2014

Hindawi Publishing Corporation http://www.hindawi.com

Volume 2014

International Journal of

Journal of

Stochastic Analysis

Optimization

Hindawi Publishing Corporation http://www.hindawi.com

Hindawi Publishing Corporation http://www.hindawi.com

Volume 2014

Volume 2014

Suggest Documents