![MathJax Logo](/templates/jsp/_style2/_tandf/pb2/images/math-jax.gif)
Abstract
This note deals with a new computational method for solving a class of singular boundary value problems. The method is based upon Bernstein Polynomials. The properties of Bernstein Polynomials, together with Bernstein operational matrix for differentiation formula, are presented and utilized to reduce the given singular boundary value problems to the set of algebraic equations. The proposed method is applied to solve some test problems with the comparison between the computational solutions and the exact solutions. The results indicate that the proposed algorithm provides high reliability and good accuracy.
1 Introduction
In this paper, we consider the class of singular boundary value problems (SBVPs) of the form(1)
(1) with the boundary conditions
(2)
(2) where
and
are analytic in
and
and
are finite constants. Problem (1) has singularity at the initial point
. We note that the main difficulty arises in the singularity of the equations at
.
The numerical treatment of singular boundary value problems has always been a difficult and challenging task due to the singular behavior that occurs at a point.
In recent years, strenuous action and interest have been investigating singular boundary value problems (SBVPs) and a number of methods have been proposed. The singular boundary value problems arise frequently in many branches of applied mathematics, mechanics, nuclear physics, atomic theory and chemical sciences. Hence, the singular boundary value problems have attracted much attention and have been investigated by many researchers. Kadalbajoo and Agarwal treated the homogeneous equation using Chebyshev polynomial and B-spline [Citation1]. Kanth and Reddy solved a particular singular boundary value problem by applying higher order finite difference method [Citation2].The same authors investigated by using the cubic spline [Citation3] method. Mohanty et al. [Citation4] introduced accurate cubic spline method for solving the singular boundary value problems. Variational iteration method (VIM) was introduced by Wazwaz [Citation5] for solving nonlinear singular boundary value problems.
The authors [Citation6,Citation7] elaborately discussed singular boundary value problems and solved by the methods based on reproducing kernel space. Galerkin and Collocation methods are presented for solving two-point boundary value problems by Mohsen and El-Gamel [Citation8]. Secer and Kurulay [Citation9] described the Sinc-Galerkin method for singular Dirichlet-type boundary value problems. Rashidinia et al. [Citation10] proposed a reliable parametric spline method.
The purpose of this note is to develop a reliable operational matrix method for singular boundary value problems. The aim of the present paper is to apply Bernstein operational matrix of differentiation to propose a reliable numerical technique for solving SBVPs.
With the advent of computer graphics, Bernstein polynomial restricted to the interval becomes important in the form of Bezier curves [Citation11,Citation12]. Bernstein polynomials have many constructive properties such as the positivity, the continuity, recursive relation, symmetry and unity partition of the basis set over the interval. For this reason, Bernstein operational matrix method is a new and rising area in applied mathematical research which has gained considerable attention in dealing with differential equations. Optimal stability of the Bernstein basis was discussed by Farouki and Goodman [Citation13]. Bhatta and Bhatti [Citation14] have been used modified Bernstein polynomials for solving Korteweg-de Vries (KdV) equation. Chakrabarti and Martha [Citation15] described a method for Fredholm integral equations. Bhattacharya and Mandal [Citation16] presented Bernstein polynomials method for Volterra integral equations. Yousefi and Behroozifar [Citation17] found the operational matrices of integration and product of B-polynomials. The same authors [Citation18] introduced the Bernstein operational matrix method (BOMM) for solving the parabolic type partial differential equations (PDEs). Isik et al. [Citation19] have demonstrated a new method to solve high order linear differential equations with initial and boundary conditions. Ordokhani et al. [Citation20] introduced Bernstein polynomial for solving differential equations. Singh et al. [Citation21] established the Bernstein operational matrix of integration for solving differential equations. Doha et al. [Citation22,Citation23] have implemented and proved new formulas about derivatives and integrals of Bernstein polynomials and solving high even-order differential equations by Bernstein polynomial based method. Yousefi et al. [Citation24] described the Ritz-Galerkin method for solving an initial boundary value problem that combines Neumann and integral condition for the wave equation. Bhattacharya et al. [Citation25] implemented the algorithm for integro differential equations. Shen et al. [Citation26] suggested a boundary knot method (BKM) to solve Helmholtz problems with boundary singularities. Lin et al. [Citation27] used the efficient boundary knot method to obtain the solution of axisymmetric Helmholtz problems. Recently, Pirabaharan et al. [Citation28] introduced a Bernstein operational matrix method for boundary value problems.
The objective of this paper is to give the computational method based on the Bernstein operational matrix for differentiation for the class of singular boundary value problems (SBVPs). The proposed algorithm converted to the given SBVP to the system of algebraic equations with unknown coefficients and are solved easily by using mathematical tool like MATLAB.
The outline of the paper is as follows. In section 2, we review the basic properties of Bernstein polynomials and we develop the Bernstein operational matrix for derivative. Section 3 implemented and presented the methods of solution for the singular boundary value problems. In Section 4, some numerical examples are presented to show the efficiency and the applicability of the suggested algorithm. Conclusion is given in Section 5.
2 Properties of Bernstein polynomials [Citation29]
The Bernstein basis polynomials of degree n are defined in the interval (0, 1) as [Citation17,Citation18](3)
(3)
These Bernstein polynomials form a complete basis on the interval (0, 1). Using the recursive definition to generate these polynomialswhere
and
.
Since the power basis forms a basis for the space of polynomials of degree less than or equal to n, any nth degree Bernstein polynomial can be expressed in terms of the power basis. This can be computed by using the binomial expansion,(4)
(4)
By using the property, the dual basis is defined as follows:
A function, square integrable in the interval [0, 1], may be written in terms of Bernstein basis [Citation17,Citation18].
Practically, only the first (n + 1) term Bernstein polynomials are considered.
Therefore, we can write(5)
(5) where the Bernstein coefficient vector
and the Bernstein vector
is Bernstein vector are given by
(6)
(6) then
Jutler [Citation30] has derived explicit representations,for the dual basis functions, defined by the coefficients
(7)
(7)
The Bernstein polynomials are useful for practical computations on account of its essential numerical stability [Citation13]. One of the valuable property of Bernstein basis polynomials is that they all disappear at boundaries of the interval, except the first and the last one, which are equal to one at and
respectively. This gives greater flexibility which imposes boundary conditions at the end points of the interval [Citation31]. Also, Bernstein polynomials have two most important properties:
(i) | Unity partition property |
(ii) | Positivity property |
2.1 The operational matrix of the derivative [Citation29]
The derivative of the vector B(x) can be written as(8)
(8) where
is the operational matrix of derivative of
order and is specified in Ref. [Citation17] as
(9)
(9)
where
is the
row of
for
(10)
(10)
Therefore, we have the operational matrix of differentiation as .
2.1.1 Generalized Bernstein operational matrix of differentiation
The generalized nth order operational matrix of differentiation can be expressed aswhere
and
.
For example, if, we get
Similarly, we can define for any value of
,
Here, ,
is the
operational matrix where
is the
matrix,
is the
matrix,
is
matrix.
For example, if ,
Therefore, by using .
Similarly, we can find for any value of
.
By equation , it is clear that
(11)
(11) where
and the superscript in
denotes matrix powers.
Thus,(12)
(12)
3 Function approximation
In this section, we solve singular boundary value problems of Eq. Equation(1)(1)
(1) with the boundary conditions of Eq. Equation(2)
(2)
(2) by using Bernstein operational matrix method.
First, we approximate function y(x) by Bernstein polynomial as(13)
(13) where the vector
is an unknown vector and
.
Using Eqs. Equation(12)(12)
(12) and Equation(13)
(13)
(13) , we have the residual R(x)
,
.
By substituting these equations in Eq. Equation(1)(1)
(1) , we obtain the following:
(14)
(14)
Similarly, by substituting Eq. Equation(13)(13)
(13) in Eq. Equation(2)
(2)
(2) , it yields
(15)
(15)
To find the solution , we first collocate Eq. Equation(14)
(14)
(14) at
suitable points
These equations jointly with Eq. Equation(15)(15)
(15) produce
algebraic equations which can be solved to find unidentified coefficients
Consequently, the unknown function
given in Eq. Equation(13)
(13)
(13) can be computed.
Lemma 3.1
[Citation32]
Suppose the function is
times continuously differentiable
, and
. If
be the best approximation
out of
, then
, where
.
Proof
It is known that set is a basis for the polynomial space of degree
. Therefore, we define the function
From the Taylor expansion, we have(16)
(16) where
. Since
is the finest estimation of
out of
,
and from Eq. Equation(16)
(16)
(16) we have
Then by taking square roots on both sides, the proof is complete.
Note 3.1
The previous lemma demonstrates that the error vanishes as .
4 Numerical examples
To exhibit the effectiveness and power of the Bernstein operational matrix method, we have tested several singular boundary value problems. These problems have been preferred because they are commonly discussed in literature.
Example 4.1
Consider the linear singular two-point boundary value problem [Citation33](17)
(17) with boundary conditions
(18)
(18)
Eq. Equation(17)(17)
(17) has the exact solution of the boundary value problem and it is
.
Applying the method developed in sections 2 and 3 for , where n is the order of the Bernstein polynomial.
We have .
Here we have,
,
.
Using these values in Eq. Equation(17)(17)
(17) , we obtain the following:
(19)
(19)
From Eq. Equation(12)(12)
(12) , we have
By collocating Eq. Equation(19)(19)
(19) , choosing the suitable collocation point
, we obtain
(20)
(20)
Applying the boundary conditions from Eq. Equation(18)(18)
(18) , we get
(21)
(21)
(22)
(22)
Substitute the values in Eq. Equation(20)
(20)
(20) , we obtain
.
Therefore, ,
,
.
Consequently, we get
In , the values of the exact solution and the proposed algorithm solution with are listed for various values of x. It also shows the absolute errors computed by using the proposed algorithm solution. This shows that the present approach is not only more accurate but also it is used in easier way.
Table 1 Computed values and comparison to the exact solutions for Example 4.1.
Comparison between the curves of exact solutions and the Bernstein operational matrix (BOM) solutions in case of is shown in Fig. 1. From this figure, it can be noted that the results of the present technique are an excellent agreement with the exact solution, they are more applicable and efficient for solving singular boundary value problem.
Example 4.2
Next we consider the following singular BVP [Citation34] as(23)
(23)
(24)
(24)
Eq. Equation(23)(23)
(23) has the exact solution of the boundary value problem and it is
. As described in sections 2 and 3, Bernstein operational matrix technique leads to the system of algebraic equations, by solving them, the unknown coefficients of the vector
calculated by using the following values
Thus, is the exact solution of the given in Example 4.2
It is understandable that in Example 4.2, the proposed algorithm is speedily converged in to the true solution results. For a small value of , the exact solution is reached. This proves the efficiency of the proposed BOM method.
The results obtained by BOM for are compared with the exact solution, and B-Spline results given in Ref. [Citation3] are listed in . The absolute errors among exact, BOM and B-Spline methods are calculated. E1 indicates the absolute errors between exact and BOM, whereas E2 indicates the absolute errors between exact and B-Spline methods. shows that the proposed method has high accuracy and has better results than the B-Spline method for all points of x. It is also clear that the proposed algorithm attains the exact solution by using very few calculations.
Example 4.3
Consider the Bessel's equation of order zero [Citation35](25)
(25) with boundary conditions
(26)
(26)
Table 2 Errors of the present method compared with B-Spline results for the Example 4.2.
The exact solution is .
By applying the method described in the sections 2 and 3 with ,
Eq. Equation(25)(25)
(25) converted to the following equation:
(27)
(27)
Applying Eq. Equation(15)(15)
(15) in the boundary conditions (26), we obtain
(28)
(28)
(29)
(29)
Solving the Eqs. (27)–(29), we get
Consequently, we obtain
The numerical results are presented in the .
Table 3 Computed values and comparison to the exact solutions for the Example 4.3.
The proposed algorithm is applied to the well known Bessel's equation of order zero. The exact solution and BOM with solution are displayed in . The maximum absolute errors between BOM and exact solution for various choices of x are also shown in . It is clearly noted that the errors are very close to zero. This proves the efficiency of the proposed algorithm.
Example 4.4
Next we consider the following singular boundary value problem [Citation35](30)
(30)
(31)
(31)
This problem is solved by applying the method described in Sections 2 and 3.
Applying Bernstein operational matrices of derivatives with in Eq. Equation(30)
(30)
(30) and using the boundary conditions, the unknown coefficient values
(32)
(32)
The numerical results are presented in the .
Table 4 Computed values and comparison to the exact solutions for the Example 4.4.
Maximum absolute errors for this problem have been displayed for in , which shows the accuracy of proposed method. From the exhibited results for this example in 4.4 show the advantage of this method.
Fig. 2 illustrates a comparison between the curves of exact solutions and the approximate solutions. It can be concluded from Fig. 2 that the Bernstein operational matrix method solutions converge rapidly to the exact solution.
Example 4.5
Now, the general Lane-Emden type differential equation discussed by Rafiq et al. [Citation36] is considered(33)
(33) with boundary conditions
(34)
(34)
For the case , Eq. Equation(33)
(33)
(33) has the exact solution of the boundary value problem and it is
.
As done before, the Lane-Emden type differential equation is solved. Applying the boundary conditions of Eq. Equation(34)(34)
(34) in Eq. Equation(33)
(33)
(33) and by following the same procedure given in Example 4.1 for the case corresponds to
.
Thus, Eq. Equation(33)(33)
(33) and Eq. Equation(34)
(34)
(34) are transformed into a system of algebraic equations. Solving the system of algebraic equations,
are obtained.
Then, is the exact solution.
The exact solution of y(x), the approximate solutions of BOM and Homotopy Perturbation Method (HPM) are plotted in Fig. 3, Comparison between the solution obtained by using the proposed algorithm, HPM used by Rafiq et al. [Citation36] and the exact solution are exhibited. It is observed from Fig. 3 that the present solution converges rapidly to the exact solution for small size of operational matrix and it is more accurate than the solution in Rafiq et al. [Citation36]. The efficiency and power of the proposed algorithm are proved.
Example 4.6
Finally, consider the following initial value problem(35)
(35) with boundary conditions
(36)
(36) which has the exact solution
.
We solve problem Eq. Equation(35)(35)
(35) by applying the method described in Sections 2 and 3, using Bernstein operational matrices of derivatives with
we have
Results in show the comparison between the exact solutions and the BOM solutions for various values of x and . The absolute errors are also given in . As seen from the table, it is evident that the overall errors are near to zero. This shows that the proposed approach is not only more accurate but also more simple and direct.
Table 5 Computed values and comparison to the exact solutions for the Example 4.6.
The curves of exact solutions and approximate solutions obtained by the proposed method for are shown in Fig. 4. In the figure, the exact and approximate solutions completely coincide. It is clear from this figure that the proposed solutions converge rapidly to the exact solution.
5 Conclusion
In this work, a new spectral method is constructed for a numerical solution of the singular boundary value problems. Based on the Bernstein polynomials, the operational matrix derivatives are used together with the properties of Bernstein polynomials to reduce the given singular boundary value problems to a system of algebraic equations and it simplifies the problem. The main advantage of the proposed algorithm is adding few terms of the Bernstein polynomials, and a good approximation of the exact solution of the problem is achieved. The accuracy of the proposed BOM method has been demonstrated by solving widely applicable singular boundary value test problems.
Moreover, the proposed technique provides a reliable method which requires less work compared to the traditional techniques such as B-spline and standard HPM. The approach has been tested on some existing problems from the literature. From the comparison of the results made with some exact solutions, it can be concluded that the proposed approach is effective and viable to broad range of nonlinear singular boundary value problems. The results show that BOM method values match very effectively with the exact solution with very few calculations. By comparing the results with other existing methods, it has been proved that the proposed method provides more realistic solutions that convey very rapid convergence toward the exact solution.
Acknowledgment
The authors would like to thank the referee for his valuable comments and suggestions which improved the manuscript in its present form.
References
- M.K.KadalbajooV.K.AggarwalNumerical solution of singular boundary value problems via Chebyshev polynomial and B-splineAppl Math Comput1602005851863
- A.S.V.R.KanthY.N.ReddHigher order finite difference method for a class of singular boundary value problemsAppl Math Comput1552004249258
- A.S.V.R.KanthY.N.ReddyCubic spline for a class of singular boundary value problemsAppl Math Comput1702005733740
- R.K.MohantyP.L.SachderN.JhaAn O(h4) accurate cubic spline TAGE method for nonlinear singular two point boundary value problemAppl Math Comput1582004853868
- A.M.WazwazThe variational iteration method for solving nonlinear singular boundary value problems arising in various physical modelsCommun Nonlin Sci Num Simult16201138813886
- GengF.Z.CuiM.G.Solving singular nonlinear second-order periodic boundary value problems in the reproducing kernel spaceAppl Math Comput1922007389398
- LiZ.Y.WangY.L.TanF.G.WanX.H.NieT.F.The solution of a class of singularly perturbed two-point boundary value problems by the iterative reproducing kernel methodAbstr Appl Anal201217
- A.MohsenM.El-GamelOn the Galerkin and collocation methods for two-point boundary value problems using sinc basesComput Math Appl62008930941
- A.SecerM.KurulayThe sinc-Galerkin method and its applications on singular Dirichlet-type boundary value problemsBoundary Value Probl1262012114
- J.RashidiniaZ.MahmoodiM.GhasemiParametric spline method for a class of singular two-point boundary value problemsAppl Math Comput18820075863
- C.DisibuyukH.OrucA generalization of rational Bernstein–Bezier curvesBIT472007313323
- G.FarinCurves and surfaces for computer aided geometric design1996Academic PressBoston
- R.T.FaroukiT.N.T.GoodmanOn the optimal stability of the Bernstein basisMath Comput64199615531566
- D.D.BhattaM.I.BhattiNumerical solution of KdV equation using modified Bernstein polynomialsAppl Math Comput174200612551268
- A.ChakrabartiS.C.MarthaApproximate solutions of Fredholm integral equations of the second kindAppl Math Comput2112009459466
- S.BhattacharyaB.N.MandalUse of Bernstein polynomials in numerical solutions of Volterra integral equationsAppl Math Sci36200817731787
- S.A.YousefiM.BehroozifarOperational matrices of Bernstein polynomials and their applicationsInt J Syst Sci62010709716
- S.A.YousefiM.BehroozifarM.DehghanThe operational matrices of Bernstein polynomials for solving the parabolic equation subject to specification of the massJ Comput Appl Math235201152725283
- O.R.IsikM.SezerZ.GuneyA rational approximation based on Bernstein polynomials for high order initial and boundary value problemsAppl Math Comput217201194389450
- Y.OrdokhaniS.DavaeifarApproximate solutions of differential equations by using the Bernstein polynomials, International Scholarly Research Network ISRN Applied Mathematics2011115
- A.K.SinghV.K.SinghO.P.SinghThe Bernstein operational matrix of integrationAppl Math Sci3200924272436
- E.H.DohaA.H.BhrawyM.A.SakerOn the derivatives of Bernstein polynomials: an application for the solution of high even-order differential equationsBoundary Value Probl2011116
- E.H.DohaA.H.BhrawyM.A.SakerIntegrals of Bernstein polynomials: an application for the solution of high even-order differential equationsAppl Math Lett242011559565
- S.A.YousefiZ.BarikbinM.DehghanBernstein Ritz-Galerkin method for solving an initial boundary value problem that combines Neumann and integral condition for the wave equationNumer Methods Partial Diff Eq26201012361246
- S.BhattacharyaB.N.MandalNumerical solution of a singular integro-differential equationAppl Math Comput1952008346350
- ShenD.J.LinJ.ChenW.Boundary knot method solution of Helmholtz problems with boundary singularitiesJ Mar Sci Technol222014440449
- LinJ.ChenW.ChenC.S.JiangX.R.Fast boundary knot method for solving axisymmetric Helmholtz problems with high wave-numberCMES942013485505
- P.PirabaharanR.David ChandrakumarG.HariharanAn efficient Bernstein operational matrix based algorithm for a few boundary value problemsInt J Appl Eng Res1020151869118708
- A.SaadatmandiBernstein operational matrix of fractional derivatives and its applicationsAppl Math Model38201413651372
- B.JuttlerThe dual basis functions for the Bernstein polynomialsAdv Comput Math81998345352
- M.I.BhattiP.BrackenSolutions of differential equations in a Bernstein polynomial basisJ Comput Appl Math2052007272280
- M.AlipourD.RostamyBernstein polynomials for solving Abel's integral equationJ Math Comput Sci32011403412
- A.Sami BatainehA.K.AlomariI.HashimApproximate solutions of singular two-point BVP's using Legendre operational matrix of differentiationJ Appl Math2013 Article ID 547502
- M.UsmanS.T.Mohjud-DinPhysicists Hermite wavelet method for singular differential equationsInt J Adv Appl Math Mech120131629
- A.Ravi KanthY.ReddyCubic spline for a class of singular two-point boundary value problemAppl Math Comput1702005733740
- A.RafiqS.HussainM.AhmedGeneral homotopy method for Lane-Emden type differential equationsInt J Appl Math Mech520097583