Original articles
Direct integration of the third-order two point and multipoint Robin type boundary value problems

https://doi.org/10.1016/j.matcom.2020.10.028Get rights and content

Abstract

This numerical study exclusively focused on the direct two point diagonally multistep block method of order four (2DDM4) in the form of Adams-type formulas. The proposed predictor–corrector scheme was applied in this study to compute two equally spaced numerical solutions for the third-order two point and multipoint boundary value problems (BVPs) subject to Robin boundary conditions concurrently at each step. The optimization of the computational costs was taken into consideration by not resolving the equation into a set of first-order differential equations. Instead, its implementation involved the use of shooting technique, which included the Newton divided difference formula employed for the iterative part, for the estimation of the initial guess. Apart from studying the local truncation error, the study also included the method analysis, including the order, stability, and convergence. The results of eight numerical problems demonstrated and highlighted competitive computational cost attained by the scheme, as compared to the existing method.

Introduction

A wide range of applications in science and engineering leads to the mathematical formulation of higher order differential equations mainly applied to model a physical phenomenon. In fluid flow studies, as discussed in [21] and [17], these differential equations have commonly occurred. Concerning that, the third-order differential equation was emphasized in the current study given by y(x)=f(x,y,y,y),a1xa3

subject to the set of three Robin type boundary conditions c1,1y(a1)+c1,2y(a1)+c1,3y(a1)=B1,c2,1y(a2)+c2,2y(a2)+c2,3y(a2)=B2,c3,1y(a3)+c3,2y(a3)+c3,3y(a3)=B3, where a1a2a3, a1<a3; the coefficients of c1,i, c2,i, c3,i, ai and Bi for i=1,2,3 are all real constants. The theory on existence and uniqueness for a solution on (1)–(4) is referred based on the discussion in [16] and [23] in order to verify the Lipschitz conditions and to assure the function f is continuous in [a1,a3]×R3.

For variables u,v=(y,y,y), the function, f satisfy the hypothesis on Lipschitz conditions which guarantees that there exists a positive constant Mk, k=0,,2 such that |f(x,u)f(x,v)|k=02Mk|u(k)v(k)|for any u,vR3. It is worthwhile to mention here that the proposed method presented in this study will give a special attention on solving problems correspond to scalar form of (1)–(4).

Accordingly, a well-known conventional method to solve Eq. (1) involves resolving the equations into an equivalent first-order system. Although this conventional method is typically recommended given its capability of computing good numerical solutions, its process involves additional human and machine efforts. Nonetheless, there are various methods of solving (1) with non-Robin boundary conditions, which were applied in numerous past studies. For examples quartic nonpolynomial spline [10], homotopy analysis method [19], differential transformation method [4] and a combination of fixed iterative method and Green’s functions [2].

Meanwhile, recent studies focused on computing the approximate solution for Robin-type, mainly on the second-order problems. For instance, Anakira et al. [5] used the strategy of partitioning the domain into several subdomains using multistage optimal homotopy analysis method (MOHAM) to compute the particular solution. On the other hand, several other studies examined the multistep block method with a predictor–corrector scheme [24] and a new Falkner-type block method with the third derivative [28] to facilitate the direct approximate solution of second-order BVPs with Robin boundary conditions. To date, the most recent study attempted to solve (1) with two point and multipoint Robin boundary conditions using the Adomian decomposition approach [27]. Meanwhile, [13] and [14] constructed a continuous linear multistep method (LMM) for solving third-order boundary value problems associated with mixed boundary conditions including Robin type.

Alternatively, several studies successfully proved that the direct method improves many computational element costs as well as the aspects of accuracy, efficiency and timing. Focusing on solving (1) with initial value problems (IVPs), the advantages of the direct method were further supported by several recent studies by Mehrkanoon [22] (using the three-step block method) and Majid et al. [20] (using the two-point block method), in the form of Adams-type formula. Besides that, the two-point fully implicit block method of order four in predictor–corrector scheme was also found to be applicable in solving (1), subject to the Dirichlet and Neumann boundary conditions [1]. Omar et al. [25] also employed the predictor–corrector block method with Taylor series to directly handle the third-order differential equations. Furthermore, Awoyemi [7] developed a continuous multistep collocation method using power series to solve the third-order IVPs. Apart from that, Pandey [26] presented a finite difference method to solve the third-order BVPs. Meanwhile, several other studies [12] and [15] applied the hybrid block methods to directly solve special type of third-order differential equations.

Hence, the significant findings of previous studies propelled this study to provide direct solutions for (1) with Robin boundary conditions through the incorporation of two-point diagonally multistep block method via shooting technique. In this study, the Newton divided difference interpolation approach was employed to re-adjust the initial guesses of the shooting technique.

Section snippets

Derivation of the method

This section focuses on the application of two-point diagonally multistep block method to numerically evaluate the solution of the BVPs in (1) at two points concurrently. As shown in Fig. 1, two numerical solutions, which consist of the first point, yn+1 at xn+1 and the second point, yn+2 at xn+2, were computed in the ith block using available results at grid points of xn2,xn1, and xn. For this study, each respective xn+i was obtained using the sequential progression from the initial xn with

Analysis of the block method

In this section, we will discuss on order, error constant, local truncation error, consistency, stability and convergence of the 2DDM4 method. Following the theoretical explanation in [18] and [11], the developed 2DDM4 formulas can be classified as a member of the linear multistep method (LMM) generally represented as follows: j=0mαjyn+j=hj=0mβjyn+j+h2j=0mγjyn+j+h3j=0mσjf(xn+j,yn+j,yn+j,yn+j(2)).

The linear difference operator associated with (13) are given as follows: L[y(xn),h]=j=0m(αjy

Implementation

In this study, we are interested on solving (1) via the shooting technique and combining with 2DDM4 method. The underlying shooting strategy applied in this study mimic a similar approach, as the iterative procedure discussed in [24], but with an extension in order to handle the third-order BVPs. The procedure begins by setting the first initial guess for y1(a1)=S1.

Then, the initial guesses for y1(a1) and y1(a1) are defined explicitly either from (2) or (3), provided that the Robin conditions

Numerical results and discussion

In this section, we consider eight numerical tested problems to give a clear view regarding the practical usefulness of the 2DDM4 method. The numerical results provided by 2DDM4 when solving Problems 1 to 5 are compared with the fourth-order block method, FOBM formula derived in [1], the classical Runge–Kutta of order four (RK4) method and the MATLAB solver, bvp4c. The 2DDM4 and FOBM solved the third-order problems directly, while RK4 and bvp4c method implemented the conventional approach. In

Conclusion

We conclude that the proposed two-point diagonally multistep block method of order four with constant step size accomplishes efficiently in solving numerical tested problems with economically in computational cost. The 2DDM4 is also reliable in measuring approximate solutions for the third-order boundary value problems associated with two point and multipoint Robin boundary conditions by solving those problems directly.

Acknowledgments

This work was supported by the Putra Grant [Project Code: GP-IPS/2018/9625100], Universiti Putra Malaysia (UPM). The main author also would like to acknowledge Universiti Malaysia Pahang (UMP) and Ministry of Higher Education (Malaysia) for the financial support through a UMP-SLAB scholarship.

The authors greatly appreciate the constructive comments and suggestions made by the referees and journal editor to improve the quality of the paper.

References (30)

  • CaglarH.N. et al.

    The numerical solution of third-order boundary-value problems with fourth-degree & B-spline functions

    Int. J. Comput. Math.

    (1999)
  • El-SalamF.A. et al.

    The numerical solution of linear third order boundary value problems using nonpolynomial spline technique

    J. Am. Sci.

    (2010)
  • FatunlaS.O.

    Block methods for second order odes

    Int. J. Comput. Math.

    (1991)
  • HijaziM. et al.

    The numerical computation of three step hybrid block method for directly solving third order ordinary differential equations

    Glob. J. Pure Appl. Math.

    (2017)
  • JatorS.

    Novel finite difference schemes for third order boundary value problems

    Int. J. Pure Appl. Math.

    (2009)
  • Cited by (4)

    View full text