7.2
CiteScore
3.7
Impact Factor
Generic selectors
Exact matches only
Search in title
Search in content
Post Type Selectors
Search in posts
Search in pages
Filter by Categories
ABUNDANCE ESTIMATION IN AN ARID ENVIRONMENT
Case Study
Correspondence
Corrigendum
Editorial
Full Length Article
Invited review
Letter to the Editor
Original Article
Retraction notice
REVIEW
Review Article
SHORT COMMUNICATION
Short review
7.2
CiteScore
3.7
Impact Factor
Generic selectors
Exact matches only
Search in title
Search in content
Post Type Selectors
Search in posts
Search in pages
Filter by Categories
ABUNDANCE ESTIMATION IN AN ARID ENVIRONMENT
Case Study
Correspondence
Corrigendum
Editorial
Full Length Article
Invited review
Letter to the Editor
Original Article
Retraction notice
REVIEW
Review Article
SHORT COMMUNICATION
Short review
View/Download PDF

Translate this page into:

Original article
03 2020
:33;
101259
doi:
10.1016/j.jksus.2020.101259

Approximate analytical solutions for some obstacle problems

Mathematics Department, College of Science and Arts, AlKamel, University of Jeddah, Saudi Arabia
University of Tunis El Manar, National Engineering School at Tunis, LAMSIN, B.P. 37, 1002 Tunis-Belvédère, Tunisia

⁎Corresponding author at: Mathematics Department, College of Science and Arts, AlKamel, University of Jeddah, Saudi Arabia. chamekhmourad1@gmail.com (Mourad Chamekh),

Disclaimer:
This article was originally published by Elsevier and was migrated to Scientific Scholar after the change of Publisher.

Peer review under responsibility of King Saud University.

Abstract

The paper deals with the variational iteration method to obtain a semi-analytical solution to some obstacle problems. We will focus on applications of a contact problem for a deformed beam with an elastic obstacle. To validate the accuracy this approach,the obtained solution has been compared with the exact solution, in the case where it can be calculated in the closed-form expression. Otherwise, a comparison of variational iteration method with the Adomian decomposition method for some nonlinear examples has been used.

Keywords

Obstacle problems
Penalty function method
Variational Iteration Method
74K10
74M15
74S05
PubMed
1

1 Introduction

Obstacle problems are problems well studied in many scientific literatures, including the problems of deformation of an elastic rod in the presence of an elastic or rigid obstacle (Caffarelli, 1998; Caffarelli and Figalli, 2013; Figalli and Serra, 2019). The resolution of the problems is either difficult, or too long to implement like the numerical problems of the contact in an elastic rod with or without friction (Chamekh et al., 2014; Chamekh, 2015; Chamekh et al., 2020a). Thanks to the penalization method, the obstacle problems are transformed into types of differential equations which can be solved by the Adomian decomposition method or the Variational Iteration Method (VIM), see Alderremy et al. (2019), Chamekh et al. (2020b) and Elzaki and Chamekh (2018).

This work emphasizes studies semi-analytical solutions related to obstacle problem. The term of obstacle problem is usually used for a classic motivating example in the analytical study of differential inequalities and free boundary problems. In the scientific literature, we can find a good number of applications that have a model that is built on the obstacle problem, such as the finances, the engineering problems, Stefan problem etc. For this purpose, for example, we can consult the following references Baxter and Rennie (1996), Brezzi et al. (1978) and Gupta (2003).

In this paper, the original idea had been to find a semi-analytical solution of the deformation of a beam in the presence of an elastic foundation. They answered that surround this engineering application must not prevent to apply these results to other specialties but, on the contrary, must pave the way for more complex obstacle problems. On the alternatives of Lagrange multiplier method, J. H. He has developed the variational iteration method (He, 1999) since the end of the last century. In scientific literature, the VIM is increasingly being used in different research types. For example, we mention the viscoelastic beams (Martin, 2016), behavior fluids (Chamekh and Elzaki, 2018) etc…

Amongst the engineering problems leading to an obstacle problem which were classically raised, the bending analysis of clamped–clamped Euler–Bernoulli beams, onto an elastic foundation and subject to an applied load. The goal is to find the deflexion, the maximum deflexion of this beam. This could also be in the case of a membrane but with an alternative form occupies a bounded domain of the plane with a rigid obstacle. Vertical displacement of the membrane is represented by the graph of a function U of Ω in R . We then look for the equilibrium position taking the membrane subjected to an external force, under the non-penetration constraint U Ψ on Ω .

In the equilibrium state, if the membrane is out of contact with the obstacle, the elasticity produces a balance of the membrane tension and the surface of the membrane is described by U. If the membrane comes in contact with the obstacle, the function fulfills the curvatures of U. More generally, in monodimensional case, these discussed problems can induce the type of system

(1)
- ( k ) U ( x ) x k F ( U ( x ) , x ) , x Ω , U ( x ) Ψ ( x ) , x Ω , ( k ) U ( x ) x k + F ( U , x ) U ( x ) - Ψ ( x ) = 0 , x Ω , Ψ ( x ) 0 , x Ω , with Ω = [ a , d ] and subject to k boundary conditions among the following conditions:
(2)
( i ) U x i ( a ) = α i and ( j ) U x j ( d ) = β j fori + j = 0 , 1 , , k - 1 ,
where α i and β j are real constants.

The obstacle problem has many extensions well-respected in the literature, particularly in the nonlinearity of the elastic reactions and/or the noncommutative effects are considered of the membrane, because of that, we have obtained the last possible generalized form. The function F ( U ( · ) , · ) is continuous on Ω and Ψ is the obstacle function. The system (1–2) results of the mathematical modeling of problems containing the contact, unilateral, obstacle, deformation, and/or free boundary value. In the remainder, some possibilities are discussed concerning the semi-analytical solutions of this type of system using the VIM.

2

2 Main equations

The penalty method is the most commonly used method of constraint handling. The goal is to take advantage of the fact that this penalty can reduce differential inequalities in the form of equalities. In this regard, by using the penalty technique which has been applied by Lewy-Stampacchia (Lewy and Stampacchia, 1969) to give the regularity of the solutions of the variational inequalities, the system (1) results in the equation given by:

(3)
- ( k ) U ( x ) x k - U ( x ) - Ψ ( x ) + = F ( U ( x ) , x ) , x [ a , d ] , where [ s ] + = max ( 0 , s ) is the penalty function.

In the following, for the sake of simplicity, we assume that the obstacle function Ψ is known as follows (see Al-Said et al., 1996):

(4)
Ψ ( x ) = - 1 x [ a , b [ [ c , d ] , 1 x [ b , c [ , where a < b < c < d .

Upon substitution of (4) into (3) with taking into account the penalty function we finally obtain

(5)
- ( k ) U ( x ) x k = F ( U ( x ) , x ) + U ( x ) + 1 if x [ a , b [ [ c , d ] , F ( U ( x ) , x ) if x [ b , c [ . As well as taking into consideration the boundary conditions (2) and continuity conditions of U , U x , , ( p ) U x p at b and c, where p < k .

3

3 Variational Iteration Method (VIM)

The VIM or the He’s method is a simple and however capable method for solving a wide class of nonlinear problems. It successfully has been applied to many problems. For example, He has utilized his method to solve the classical Blasius equation, a few well-known nonlinear problems, and ordinary differential systems. Presently, the VIM has been used in many fields, it is capable of handling a large class of linear or nonlinear differential equations. Adaptability and adjustment given by this method have made it promptly appropriate for cases where the analytical solutions are not available as is often the case in the applied sciences and engineering. The VIM gives effective calculation for analytic approximate solutions and numeric simulations for real-world applications in sciences. This method does not require the utilization of additive computation algorithms regularly utilized to confront the nonlinear terms as the Adomian decomposition method, which would complicate the analytical calculations. The VIM approaches directly the linear and nonlinear problems straightforwardly in the same way.

From He (1999), we recall the basic concept of VIM associated with the problem (5) follows the following iterative formula

(6)
U n + 1 ( x ) = U n ( x ) + a x λ ( s ) ( k ) U n ( s ) s k + F ( U n ( s ) , s ) + U n ( s ) + 1 ds , a x < b , b x λ ( s ) ( k ) U n ( s ) s k + F ( U n ( s ) , s ) ds , b x < c , c x λ ( s ) ( k ) U n ( s ) s k + F ( U n ( s ) , s ) + U n ( s ) + 1 ds , c x d , with λ is Lagrangian multiplicative. The possible practical form of λ is given by:
(7)
λ ( s ) = ( - 1 ) k ( s - x ) k - 1 ( k - 1 ) ! , x [ a , d ] .
But we must note that in some special cases, we may first have to face the challenge of finding the optimum value of λ to accelerate the convergence of the solution. So we have to take back the calculation of variations necessary to find λ . Iterative techniques rely on the computation of a recurrence from an initial function U 0 and which, step by step, tends towards the solution. These techniques are effective as long as one starts from a well chosen initial value U 0 . With some initial value, this method may not converge to a desired approximate solution because the starting point is not suitable. To do this, we will try to discuss the choice of the initial value of the different examples treated in the numerical section. Another interesting measure to consider the choice of U 0 is the continuity conditions of the solution and its derivatives within the interior of domain Ω .

4

4 Numerical examples

The proposed examples of the solutions of the linear and nonlinear problems show the effectiveness of the studied approach. The classical examples where we can give a closed-form solution that is possible enables us to evaluate the precision of calculated solutions.

4.1

4.1 Third-order linear obstacle problem

In the areas of oceanography (Al-Said et al., 1996), for example, the modeling can contribute to third-order differential equations. Taking F ( U , x ) = U , k = 3 , a = 0 , b = 1 4 , c = 3 4 and d = 1 , with boundary conditions α 0 = α 1 = β 0 = 0 , we obtain the following problem

(8)
- ( 3 ) U ( x ) x 3 = 2 U ( x ) + 1 x [ 0 , 1 4 [ [ 3 4 , 1 ] , U ( x ) x [ 1 4 , 3 4 [ . Using (7), we obtain λ ( s ) = - ( s - x ) 2 2 .

From the variational formulation we can easily verify the regularity of solution in Sobolev space H 0 2 ( Ω ) of the next problem which is equivalent to problem (8) (see Al-Said et al., 1996):

(9)
- ( 3 ) U ( x ) x 3 U ( x ) x [ 0 , 1 ] , U ( x ) Ψ ( x ) x [ 0 , 1 ] , ( 3 ) U ( x ) x 3 + U ( x ) U ( x ) - Ψ ( x ) = 0 x [ 0 , 1 ] ,

The exact solution is as follows

(10)
U ( x ) = - 1 2 + a 0 e - 2 3 x + a 1 cos 3 2 3 x 2 + a 2 sin 3 2 3 x 2 e 2 3 x 2 x [ 0 , 1 4 [ , b 0 e - x + b 1 cos 3 x 2 + b 2 sin 3 x 2 e x 2 x [ 1 4 , 3 4 [ , - 1 2 + c 0 e - 2 3 x + c 1 cos 3 2 3 x 2 + c 2 sin 3 2 3 x 2 e 2 3 x 2 x [ 3 4 , 1 ] . where the constants a i , b i and c i is given with i = 1 , , 3 by applying the continuity conditions on U , U , U . a 0 = 0.220300649527402 , a 1 = 0.279699350472598 , a 2 = 0.0928967833270709 , b 0 = - 0.00973786559844113 , b 1 = 0.0208426867753722 , b 2 = 0.00712428122870885 , c 0 = 0.423614465941949 , c 1 = 0.145695066676027 , c 2 = 0.168780738107810 .

We can now find the approximate solution of the problem (8) by using VIM. According to the iterative formula (6), we can write the problem (8) in the iterative form

(11)
U n + 1 ( x ) = U n ( x ) + - 1 2 0 x ( s - x ) 2 ( 3 ) U n ( s ) s 3 + 2 U n ( s ) + 1 ds , 0 x < 1 4 , - 1 2 1 4 x ( s - x ) 2 ( 3 ) U n ( s ) s 3 + U n ( s ) ds , 1 4 x < 3 4 , - 1 2 3 4 x ( s - x ) 2 ( 3 ) U n ( s ) s 3 + 2 U n ( s ) + 1 ds , 3 4 x 1 .

Using the boundary conditions at 0, we obtain a possible parametric expression of U 0 that is given by

(12)
U 0 ( x ) = a 2 x 2 + a 1 x + a 0 , x 0 , 1 4 , b 2 ( x - 1 4 ) 2 + b 1 ( x - 1 4 ) + b 0 x 1 4 , 3 4 , c 2 ( x - 3 4 ) 2 + c 1 ( x - 3 4 ) + c 0 , x 3 4 , 1 . Using (12), we obtain a parametric expression of U 2 after two VIM iteration. Then, applying the continuity condition of U , U and U at the points 1 4 and 3 4 and the boundary condition at the point 1, we obtain a system of linear equations in seven variables a 2 , b 0 , b 1 , b 2 , c 0 , c 1 and c 2 . This system get to the following solutions: a 2 = 955 / 7478 , b 0 = 103 / 19166 , b 1 = 252 / 7745 , b 2 = 52 / 23575 , c 0 = 184 / 8365 , c 1 = 749 / 22436 , c 2 = - 31 / 25704 . Thus, the expression of U 2 is as follows
(13)
U 2 ( x ) = 21 x 8 828766 + x 6 360 - 45 x 5 10571 - x 3 6 + 955 x 2 7478 , 0 x < 1 4 , - x 8 9139846 + 3 x 7 481004 - x 6 274566 - 7 x 5 176854 - 24 x 4 18373 + 23 x 3 52801 + 37 x 2 15578 + 127 x 4051 - 99 37879 , 1 4 x < 3 4 , - x 8 4178973 + 3 x 7 3107408 + 63 x 6 22850 - 44 x 5 3467 + 154 x 4 7285 - 463 x 3 2442 + 1637 x 2 4151 - 224 x 869 + 397 5728 , 3 4 x 1 .

Fig. 1 shows that the curve of the exact solution merges with that of the VIM solution. This precise result can be clearer in Fig. 2 where we notice that the order of the relative error is 10 - 7 . After the second iteration of VIM, we obtained satisfactory results, which indicates the effectiveness and high accuracy of this method for an optimal computing cost.

Comparing the exact solution in blue dashed-line with the two-iteration VIM solution in red straight-line.
Fig. 1
Comparing the exact solution in blue dashed-line with the two-iteration VIM solution in red straight-line.
The curve of relative error.
Fig. 2
The curve of relative error.

4.2

4.2 Third-order nonlinear obstacle problem

In the next, we Take F ( U , x ) = U 2 , k = 3 , a = - 1 , b = - 1 2 , c = 1 2 and d = 1 , with boundary conditions α 0 = α 1 = β 0 = 0 , under (5) we obtain the following problem

(14)
- ( 3 ) U ( x ) x 3 = U 2 ( x ) + 2 U ( x ) + 1 x [ - 1 , - 1 2 [ [ 1 2 , 1 ] , U 2 ( x ) + U ( x ) x [ - 1 2 , 1 2 [ . We can use the iterative formula (6) associated with VIM to find an approximate solution of the previous problem, we write
(15)
U n + 1 ( x ) = U n ( x ) + - 1 2 0 x ( s - x ) 2 ( 3 ) U n ( s ) s 3 + U n 2 ( s ) + 2 U n ( s ) + 1 ds , - 1 x < - 1 2 , - 1 2 1 4 x ( s - x ) 2 ( 3 ) U n ( s ) s 3 + U n 2 ( s ) + U n ( s ) ds , - 1 2 x < 1 2 , - 1 2 3 4 x ( s - x ) 2 ( 3 ) U n ( s ) s 3 + U n 2 ( s ) + 2 U n ( s ) + 1 ds , 1 2 x 1 .
With the same procedures, we consider the following expression of U 0
(16)
U 0 ( x ) = a 0 + a 1 ( x + 1 ) + a 2 ( x + 1 ) 2 , - 1 x < - 1 2 , b 0 + b 1 ( x + 1 2 ) + b 2 ( x + 1 2 ) 2 , - 1 2 x < 1 2 , c 0 + c 1 ( x - 1 2 ) + c 2 ( x - 1 2 ) 2 , 1 2 x 1 .
Applying (15) to U 0 , we obtain U 2 last two VIM iteration. Then, the use of the continuity conditions on U , U and U at points - 1 2 and 1 2 and the boundary conditions leads to a nonlinear system in variable a i , b i and c i , where i = 0 , 1 , 2 . This system is solved by using the Newton method. We obtain the following solution a 0 = 321 / 6281 , a 1 = - 160 / 463 , a 2 = - 520 / 2191 , b 0 = 155 / 3403 , b 1 = 849 / 3166 , b 2 = 93 / 14320 , c 0 = 311 / 989 , c 1 = 721 / 2197 , c 2 = - 419 / 1566 . It should be noted that already after two steps of VIM calculation, 14th degree polynomials result. The expression of U 2 is given in the following fourth order and we deny the rest.
(17)
U 2 ( x ) = - 242 x 4 19403 - 403 x 3 1799 - 520 x 2 2191 + 323 x 2502 + 243 1525 , - 1 2 x < - 1 2 , - 207 x 4 13696 - 247 x 3 6889 + 113 x 2 2871 + 409 x 1538 + 271 1489 , - 1 2 x < - 1 2 , - 133 x 4 11509 - 299 x 3 1230 + 415 x 2 1166 + 547 x 5163 671 3213 , 1 2 x 1 .

Fig. 3 shows that the curve of the Adomian solution merges with that of the VIM solution. It should be noted, however, that we have used the Adomian method for comparison purposes. This allows us to draw the following conclusion: The VIM and Adomian method give almost the same precision for this nonlinear problem of the obstacle.

Comparing the two-iteration VIM solution in straight-line (blue), with the Adomian solution in dashed-line (red).
Fig. 3
Comparing the two-iteration VIM solution in straight-line (blue), with the Adomian solution in dashed-line (red).

5

5 Conclusion

The differential inequalities which describe the obstacle problem are transformed into the differential equations thanks to the penalization method. The equations thus obtained were processed by the variational iteration method. The discussed examples of a beam with an elastic obstacle show some the major benefits: It leaves freedom of choice, on various loads, to an arbitrary point or region on the beam, on the boundary conditions at the ends of the beam; and the VIM is inexpensive and simple to implement and therefore the required programming skills are not necessary. We conclude the effectiveness and reliability of this method for solving certain type of these problems.

Acknowledgements

This work was funded by the University of Jeddah, Saudi Arabia, under Grant No. (UJ-20-DR-100). The authors, therefore, acknowledge with thanks the University technical and financial support changes.

Declaration of Competing Interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

References

  1. , , , . Modified Adomian Decomposition Method to Solve Generalized Emden- Fowler Systems for Singular IVP. Math. Probl. Eng. 2019:6.
    [Google Scholar]
  2. , , , . Finite difference scheme for variational inequalities. J. Optim. Theory Appl.. 1996;89(2):453-459.
    [Google Scholar]
  3. , , . Financial Calculus: An Introduction to Derivative Pricing. Cambridge, UK: Cambridge University Press; .
  4. , , , . Error estimates for the finite element solution of variational inequalities. Part II. Mixed methods. Numer. Math.. 1978;31:1-16.
    [Google Scholar]
  5. , . The obstacle problem revisited. J. Fourier Anal. Appl.. 1998;4:383-402.
    [Google Scholar]
  6. Caffarelli, Luis, Figalli, Alessio, 2013. Regularity of solutions to the parabolic fractional obstacle problem. Journal für die reine und angewandte Mathematik (Crelles Journal). Volume 2013, Issue 680, Pages 191–233, ISSN (Online) 1435–5345, ISSN (Print) 0075–4102.
  7. , . Non-linear stability criterion in numerical approximation of hyperelastic rods Universal. J. Eng. Mech.. 2015;3:45-52.
    [Google Scholar]
  8. , , . Explicit solution for some generalized fuids in laminar fow with slip boundary conditions. J. Math. Comput. Sci.. 2018;18:272-281.
    [Google Scholar]
  9. , , , . Stability of elastic rods with self-contact. Comput. Methods Appl. Mech. Eng.. 2014;279:227-246.
    [Google Scholar]
  10. Chamekh, M., Latrach, M.A. Renard, Y., 2020. Frictional self-contact problem of elastic rods. Journal of King Saud University-Science. Elsevier BV. 32, 828–835.
  11. Chamekh, M., Elzaki, T.M., Brik, N., 2020. Semi–analytical solution for some proportional delay diferential equations, SN Appl. Sci., 148 (2019), 6 pages 1.
  12. , , . Solving nonlinear fractional differential equations using a new decomposition method. Univ. J. Appl. Math. Comput.. 2018;6:27-35.
    [Google Scholar]
  13. , , . On the fine structure of the free boundary for the classical obstacle problem. Invent. Math.. 2019;215:311-366.
    [Google Scholar]
  14. , . The Classical Stefan Problem: Basic Concepts, Modelling and Analysis. Amsterdam: Elsevier; .
  15. , . Variational iteration method a kind of nonlinear analytical technique: some examples. Int. J. Nonlinear Mech.. 1999;34:699-708.
    [Google Scholar]
  16. , , . On the regularity of the solution of a variational inequality. Commun. Pure Appl. Math.. 1969;22(2):153-188.
    [Google Scholar]
  17. , . A modified variational iteration method for the analysis of viscoelastic beams. Appl. Math. Model.. 2016;40(17–18):7988-7995.
    [Google Scholar]
Show Sections