- Research Article
- Open Access
On the Derivatives of Bernstein Polynomials: An Application for the Solution of High Even-Order Differential Equations
© E. H. Doha et al. 2011
- Received: 31 October 2010
- Accepted: 6 March 2011
- Published: 15 March 2011
A new formula expressing explicitly the derivatives of Bernstein polynomials of any degree and for any order in terms of Bernstein polynomials themselves is proved, and a formula expressing the Bernstein coefficients of the general-order derivative of a differentiable function in terms of its Bernstein coefficients is deduced. An application of how to use Bernstein polynomials for solving high even-order differential equations by Bernstein Galerkin and Bernstein Petrov-Galerkin methods is described. These two methods are then tested on examples and compared with other methods. It is shown that the presented methods yield better results.
- Polynomial Basis
- Bernstein Polynomial
- Maximum Absolute Error
- Bernstein Function
- Bernstein Basis
Bernstein polynomials  have many useful properties, such as, the positivity, the continuity, and unity partition of the basis set over the interval . The Bernstein polynomial bases vanish except the first polynomial at , which is equal to 1 and the last polynomial at , which is also equal to 1 over the interval . This provides greater flexibility in imposing boundary conditions at the end points of the interval. The moments is nothing but Bernstein polynomial itself. With the advent of computer graphics, Bernstein polynomial restricted to the interval becomes important in the form of Bezier curves . Many properties of the Bézier curves and surfaces come from the properties of the Bernstein polynomials. Moreover, Bernstein polynomials have been recently used for the solution of differential equations, (see, e.g., ).
The Bernstein polynomials are not orthogonal; so their uses in the least square approximations are limited. To overcome this difficulty, two approaches are used. The first approach is the basis transformation, for the transformation matrix between Bernstein polynomial basis and Legendre polynomial basis , between Bernstein polynomial basis and Chebyshev polynomial basis , and between Bernstein polynomial basis and Jacobi polynomial basis . The second approach is the dual basis functions for Bernstein polynomials (see Jüttler ). Jüttler  derived an explicit formula for the dual basis function of Bernstein polynomials. The construction of the dual basis must be repeated at each time the approximation polynomial increased.
For spectral methods [8, 9], explicit formulae for the expansion coefficients of a general-order derivative of an infinitely differentiable function in terms of those of the original expansion coefficients of the function itself are needed. Such formulae are available for expansions in Chebyshev , Legendre , ultraspherical , Hermite , Jacobi , and Laguerre  polynomials. These polynomials have been used in both the solution of boundary value problems [16–19] and in computational fluid dynamics . In most of these applications, use is made of formulae relating the expansion coefficients of derivatives appearing in the differential equation to those of the function itself, (see, e.g., [16–19]). This process results in an algebraic system or a system of differential equations for the expansion coefficients of the solution which then must be solved.
Due to the increasing interest on Bernstein polynomials, the question arises of how to describe their properties in terms of their coefficients when they are given in the Bernstein basis. Up to now, and to the best of our Knowledge, many formulae corresponding to those mentioned previously are unknown and are traceless in the literature for Bernstein polynomials. This partially motivates our interest in such polynomials.
Another motivation is concerned with the direct solution techniques for solving high even-order differential equations, using the Bernstein Galerkin approximation. Also, we use Bernstein Petrov-Galerkin approximation; we choose the trial functions to satisfy the underlying boundary conditions of the differential equations, and the test functions to be dual Bernstein polynomials which satisfy the orthogonality condition. The method leads to linear systems which are sparse for problems with constant coefficients. Numerical results are presented in which the usual exponential convergence behavior of spectral approximations is exhibited.
The remainder of this paper is organized as follows. In Section 2, we give an overview of Bernstein polynomials and the relevant properties needed in the sequel, and in Section 3, we prove the main results of the paper which are: (i) an explicit expression for the derivatives of Bernstein polynomials of any degree and for any order in terms of the Bernstein polynomials themselves and (ii) an explicit formula for the expansion coefficient of the derivatives of an infinitely differentiable function in terms of those of the original expansion coefficients of the functions itself. In Section 4, we discuss separately Bernstein Galerkin and Bernstein Petrov-Galerkin methods and describe how they are used to solve high even-order differential equations. Finally, Section 5 gives some numerical results exhibiting the accuracy and efficiency of our proposed numerical algorithms.
where the binomial coefficients are given by .
The main objective of this section is to prove the following two theorems for the derivatives of and Bernstein coefficients of the th derivative of .
For , (3.1) leads us to go back to (2.2).
which completes the induction and proves the theorem.
We can express the Bernstein polynomial of any degree in terms of any higher degree basis using the following lemma.
For proof, see, Farouki and Rajan .
Then, we can state and prove the following theorem.
and this completes the proof of Theorem 3.3.
The following two corollaries will be of fundamental importance in what follows.
4.1. Bernstein Galerkin Method
where is the inner product in , and its norm will be denoted by .
It is of fundamental importance to note here that the crucial task in applying the Galerkin-spectral Bernstein approximations is how to choose an appropriate basis for such that the linear system resulting from the Bernstein-Galerkin approximation to (4.4) is as simple as possible.
where for all . The boundary conditions lead to the first and the last expansion coefficients to be zero.
4.2. Bernstein Petrov-Galerkin Method
where and , for all . The boundary conditions lead to the first and the last expansion coefficients to be zero.
4.3. Using Coefficients of Differentiated Expansions
Thus, there are equations for the unknowns , in order to obtain a solution; it is only necessary to solve (4.23) with the help of (4.21) for the unknowns coefficients , .
We solve in this section several numerical examples by using the algorithms presented in the previous section. Comparisons between Bernstein Galerkin method (BGM), Bernstein Petrov-Galerkin method (BPGM), and other methods proposed in [21–24] are made. We consider the following examples.
subject to the boundary conditions , with the exact solution .
and for .
with the analytical solution .
and for .
with the exact solution .
and for .
- Lorentz GG: Bernstein Polynomials, Mathematical Expositions, no. 8. University of Toronto Press, Toronto, Canada; 1953:x+130.Google Scholar
- Farin G: Curves and Surfaces for Computer Aided Geometric Design. Academic Press, Boston, Mass, USA; 1996.Google Scholar
- Bhatti MI, Bracken P: Solutions of differential equations in a Bernstein polynomial basis. Journal of Computational and Applied Mathematics 2007, 205(1):272–280. 10.1016/j.cam.2006.05.002View ArticleMathSciNetMATHGoogle Scholar
- Boyd JP: Exploiting parity in converting to and from Bernstein polynomials and orthogonal polynomials. Applied Mathematics and Computation 2008, 198(2):925–929.View ArticleMathSciNetMATHGoogle Scholar
- Rababah A: Transformation of Chebyshev-Bernstein polynomial basis. Computational Methods in Applied Mathematics 2003, 3(4):608–622.View ArticleMathSciNetMATHGoogle Scholar
- Rababah A: Jacobi-Bernstein basis transformation. Computational Methods in Applied Mathematics 2004, 4(2):206–214.View ArticleMathSciNetMATHGoogle Scholar
- Jüttler B: The dual basis functions for the Bernstein polynomials. Advances in Computational Mathematics 1998, 8(4):345–352. 10.1023/A:1018912801267View ArticleMathSciNetMATHGoogle Scholar
- Canuto C, Hussaini MY, Quarteroni A, Zang TA: Spectral Methods in Fluid Mechanics, Scientific Computation. Springer, Berlin, Germany; 1988:xxii+563.Google Scholar
- Livermore PW: Orthogonal Galerkin polynomials. Journal of Computational Physics 2010, 229(6):2046–2060. 10.1016/j.jcp.2009.11.022View ArticleMathSciNetMATHGoogle Scholar
- Karageorghis A: A note on the Chebyshev coefficients of the general order derivative of an infinitely differentiable function. Journal of Computational and Applied Mathematics 1988, 21(1):129–132. 10.1016/0377-0427(88)90396-2View ArticleMathSciNetMATHGoogle Scholar
- Phillips TN: On the Legendre coefficients of a general-order derivative of an infinitely differentiable function. IMA Journal of Numerical Analysis 1988, 8(4):455–459. 10.1093/imanum/8.4.455View ArticleMathSciNetMATHGoogle Scholar
- Karageorghis A, Phillips TN: On the coefficients of differentiated expansions of ultraspherical polynomials. Applied Numerical Mathematics 1992, 9(2):133–141. 10.1016/0168-9274(92)90010-BView ArticleMathSciNetMATHGoogle Scholar
- Doha EH: On the connection coefficients and recurrence relations arising from expansions in series of Hermite polynomials. Integral Transforms and Special Functions 2004, 15(1):13–29. 10.1080/10652460310001600618View ArticleMathSciNetMATHGoogle Scholar
- Doha EH: On the construction of recurrence relations for the expansion and connection coefficients in series of Jacobi polynomials. Journal of Physics. A 2004, 37(3):657–675. 10.1088/0305-4470/37/3/010View ArticleMathSciNetMATHGoogle Scholar
- Doha EH: On the connection coefficients and recurrence relations arising from expansions in series of Laguerre polynomials. Journal of Physics. A 2003, 36(20):5449–5462. 10.1088/0305-4470/36/20/307View ArticleMathSciNetMATHGoogle Scholar
- Doha EH, Bhrawy AH: Efficient spectral-Galerkin algorithms for direct solution for second-order differential equations using Jacobi polynomials. Numerical Algorithms 2006, 42(2):137–164. 10.1007/s11075-006-9034-6View ArticleMathSciNetMATHGoogle Scholar
- Doha EH, Bhrawy AH: Efficient spectral-Galerkin algorithms for direct solution of fourth-order differential equations using Jacobi polynomials. Applied Numerical Mathematics 2008, 58(8):1224–1244. 10.1016/j.apnum.2007.07.001View ArticleMathSciNetMATHGoogle Scholar
- Doha EH, Bhrawy AH: A Jacobi spectral Galerkin method for the integrated forms of fourth-order elliptic differential equations. Numerical Methods for Partial Differential Equations 2009, 25(3):712–739. 10.1002/num.20369View ArticleMathSciNetMATHGoogle Scholar
- Doha EH, Bhrawy AH, Abd-Elhameed WM: Jacobi spectral Galerkin method for elliptic Neumann problems. Numerical Algorithms 2009, 50(1):67–91. 10.1007/s11075-008-9216-5View ArticleMathSciNetMATHGoogle Scholar
- Farouki RT, Rajan VT: Algorithms for polynomials in Bernstein form. Computer Aided Geometric Design 1988, 5(1):1–26. 10.1016/0167-8396(88)90016-7View ArticleMathSciNetMATHGoogle Scholar
- El-gamel M: A comparison between the sinc-Galerkin and the modified decomposition methods for solving two-point boundary-value problems. Journal of Computational Physics 2007, 223(1):369–383. 10.1016/j.jcp.2006.09.025View ArticleMathSciNetMATHGoogle Scholar
- Ramadan MA, Lashien IF, Zahra WK: High order accuracy nonpolynomial spline solutions for order two point boundary value problems. Applied Mathematics and Computation 2008, 204(2):920–927. 10.1016/j.amc.2008.07.038View ArticleMathSciNetMATHGoogle Scholar
- Siddiqi SS, Akram G: Septic spline solutions of sixth-order boundary value problems. Journal of Computational and Applied Mathematics 2008, 215(1):288–301. 10.1016/j.cam.2007.04.013View ArticleMathSciNetMATHGoogle Scholar
- Wazwaz A: The numerical solution of sixth-order boundary value problems by the modified decomposition method. Applied Mathematics and Computation 2001, 118(2–3):311–325. 10.1016/S0096-3003(99)00224-6View ArticleMathSciNetMATHGoogle Scholar
This article is published under license to BioMed Central Ltd. 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.