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
31 (
4
); 822-826
doi:
10.1016/j.jksus.2018.05.002

Solving directly third-order ODEs using operational matrices of Bernstein polynomials method with applications to fluid flow equations

School of Mathematical Sciences, Faculty of Science & Technology, Universiti Kebangsaan Malaysia, 43600 UKM Bangi, Selangor, Malaysia
Faculty of Art & Sciences, Abu Dhabi University, Abu Dhabi, United Arab Emirates

⁎Corresponding author. sanaakh153@gmail.com (Sana’a Nazmi Khataybeh)

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

In this paper, we adapt for the first time the operational matrices of Bernstein polynomials method for solving directly a class of third-order ordinary differential equations (ODEs). This method gives a numerical solution by converting the equation into a system of algebraic equations which is solved directly. Applications of the present method to the famous Blasius equation describing a boundary layer flow over a flat plate and third-order ODE for thin film flow are presented. Some numerical examples are also given to show the applicability of the method.

Keywords

ODEs
Bernstein polynomials
Approximation
Fluid flow
1

1 Introduction

The mathematical formulations of physical phenomena and engineering often lead to ordinary differential equations (ODEs). Finding an approximate analytical solution to an equation has attracted the attention of many researchers (see for example Zhang et al., 2016; Singh et al., 2017; Kumar et al., 2017). There are currently many methods that can provide approximate solutions, and most of these methods first convert the ODEs to a system of lower degree, usually the first-order.

In recent years, several authors have introduced direct methods for solving higher-order ODEs. Majid et al. (2009) used Jocobi iteration and direct methods with a variable step size for solving second-order ODEs. Awoyemi and Idowu (2005) proposed a class of hybrid collocation direct method to solve third-order ODEs. A part from that, power series collocation and interpolation was implemented to derive a 3-step block method for solving ODEs of the third-order by Olabode and Yusuph (2009). Waeleh et al. (2011) developed a block method based on numerical integration and interpolation in order to solve higher-order ODEs where they presented approximation solutions of the fourth- and fifth-orders. Olabode and Alabi (2013) introduced a linear multistep method using interpolation and collocation of power series approximation solution to solve the fourth-order ODEs.

There have been quite a number of papers on applying Bernstein polynomials for solving differential equations. Bernstein polynomials were introduced by Sergi Bernstein in 1912 (see Lorentz, 2012). Yousefi and Behroozifar (2010) employed operational matrices of Bernstein polynomials for solving differential equations. Pandey and Kumar (2012) used Bernstein operational matrices to solve Emden type equations. Alshbool et al. (2015) introduced approximation solutions for singular differential equations using Bernstein polynomials. A numerical solution for the variable order linear cable equation using Bernstein polynomials was presented by Chen et al. (2014). Bellucci (2014) introduced the orthonormal Bernstein polynomials which can be used in a generalized Fourier series to approximate surfaces and curves. Mirkov and Rašuo (2013),Mirkov et al., 2012 used Bernstein polynomials to solve elliptic boundary value problems, in particular, the Poisson and Helmholtz equations on a square domain. Further capabilities of operational matrices of Bernstein polynomials were demonstrated very recently by Asgari and Ezzati (2017) who solved two-dimensional integral equations of fractional order by operational matrix of two-dimensional Bernstein polynomials and Alshbool et al. (2017) who solved fractional-order differential equations. Very recently, Loh et al. (2017) introduced a new operational matrix based on Genocchi polynomials for solving fractional integro-differential equations.

In this paper, we introduce for the first time an approximate method based on Bernstein polynomials for solving directly third-order ODEs of the form

(1)
y = f ( x , y , y , y ) subject to y ( 0 ) = a 0 , y ( 0 ) = b 0 , y = c 0 , where a 0 , b 0 , c 0 are given constants and x [ 0 , 1 ] . While all others methods as introduced in Zhang et al. (2016), Singh et al. (2017), Kumar et al. (2017), Majid et al. (2009), Awoyemi and Idowu (2005)) solved Eq. (1) by reducing it to systems of lower degree of ODEs, the present method converts Eq. (1) to a system of algebraic equations which can be solved easily. The capability of the method shall be tested on a linear and nonlinear third-order ODEs.

2

2 Description of method

The Bernstein polynomials of degree n are defined as

(2)
B v , n ( x ) = n v x v ( 1 - x ) n - v , where
(3)
n v = n ! v ! ( n - v ) ! , v = 0 , , n .

These polynomials form a complete basis for the vector space n of polynomials of degree at most n. For convenience, B v , n ( x ) = 0 if v < 0 , n < v . These polynomials have many properties which make them important and useful, like continuity and unity partition (see Farouki, 2012). As a result, any polynomial of degree n can be approximated in terms of linear combination of B v , n ( x ) = 0 , ( v = 0 , , n ) as given below,

(4)
y ( x ) = v = 1 n C v B v , n = C T Φ ( x ) , where C T = [ C 0 , C 1 , , C n ] and Φ ( x ) = [ B 0 , n , B 1 , n , , B n , n ] T .

Also, we can make the decomposition of the vector Φ ( x ) as a product of a square matrix of size ( n + 1 ) × ( n + 1 ) and a vector of size ( n + 1 ) × 1 , i.e. Φ ( x ) = AX , where

(5)
A = a 0 a 1 a 2 a n b 0 b 1 b 2 b n k 0 k 1 k 2 k n , X = 1 x x 2 x n .

Now, the derivative of the vector Φ ( x ) denoted by D is

(6)
d Φ ( x ) d x = D Φ ( x ) , where D is the ( n + 1 ) × ( n + 1 ) operational matrix of the derivative that given as D = A σ A - 1 , where
(7)
A = a 0 a 1 a 2 a n b 0 b 1 b 2 b n k 0 k 1 k 2 k n , σ = 0 0 0 0 0 1 0 0 0 0 1 0 .
for more illustration, (see Yousefi and Behroozifar, 2010). Eq. (6) can be generalised as follows
(8)
d 2 Φ ( x ) d x = ( D ) 2 Φ ( x ) , , d n Φ ( x ) d x = ( D ) n Φ ( x ) .
To use this operational matrix for solving an equation, we will approximate y ( x ) by Bernstein polynomials as y ( x ) = C T Φ ( x ) and we have
(9)
y ( x ) = C T D Φ ( x ) , y ( x ) = C T ( D ) 2 Φ ( x ) , y ( x ) = C T ( D ) 3 Φ ( x ) .
Then Eqn. (1) can be written in the form
(10)
C T ( D ) 3 Φ ( x ) = f ( x , C T Φ ( x ) , C T D Φ ( x ) , C T ( D ) 2 Φ ( x ) ) ,
(11)
C T Φ ( x 0 ) = a 0 , C T D Φ ( x 0 ) = b 0 , C T ( D ) 2 Φ ( x 0 ) = c 0 .
We substitute the collocation nodes 0 x 0 < x 1 < < x m 1 in (10) to get a system of algebraic equations which will be solved by a computer algebra system like Maple. We use the Chebyshev roots as the collocation nodes
(12)
x i = 1 2 + 1 2 cos ( ( 2 i + 1 ) π 2 n ) , i = 0 , 1 , , n - 2 .
A convergent analysis of the method was given by Yousefi et al. (2011) in their lemmas 3 and 4. For more details the readers is referred to Rivlin (2003).

3

3 Numerical tests

In this section, we present examples of third-order ODEs in order to illustrate the performance and effectiveness of our method. We apply the method with the number of Bernstein terms, n = 14 . All the algebraic manipulations were done in Maple 8 with the Digits set to 20.

3.1

3.1 Example 1

First we consider the following linear problem y - y + y - y = 0 , y ( 0 ) = 1 , y ( 0 ) = 0 , y ( 0 ) = - 1 , 0 x 1 , with the exact solution y ( x ) = cos x . Applying the method described above, the following 14-term approximate solution is obtained: y ( x ) - 9.64735391 × 10 - 12 x 14 - 9.3279316 × 10 - 12 x 13 + 2.111956063 × 10 - 9 x 12 - 4.022855 × 10 - 11 x 11 - 2.755270872610 - 7 x 10 - 3.7973510 - 11 x 9 + 0.248016101554 × 10 - 4 x 8 - 1.00854 × 10 - 11 x 7 - 0.13888888856464 × 10 - 2 x 6 - 7.443 × 10 - 13 x 5 + 0.4166666666678504 × 10 - 1 x 4 - 1.264 × 10 - 14 x 3 - 0.500000000000000001 x 2 + 0.99999999999999999999 . The absolute errors shown in Table 1 suggest that the present method is very accurate.

Table 1 Absolute errors for Example 1.
x Exact solution Bernstein solution Error
0.1 0.99500416527802576610 0.99500416527802576026 5.84 × 10 - 18
0.2 0.98006657784124163112 0.98006657784124160265 2.85 × 10 - 17
0.3 0.95533648912560601964 0.95533648912560595103 6.86 × 10 - 17
0.4 0.92106099400288508280 0.92106099400288495944 1.23 × 10 - 16
0.5 0.87758256189037271612 0.87758256189037253350 1.83 × 10 - 16
0.6 0.82533561490967829724 0.82533561490967807361 2.24 × 10 - 16
0.7 0.76484218728448842626 0.76484218728448822968 1.97 × 10 - 16
0.8 0.69670670934716542092 0.69670670934716545101 3.01 × 10 - 17
0.9 0.62160996827066445648 0.62160996827066530979 8.53 × 10 - 16
1.0 0.54030230586813971740 0.54030230586814316648 3.45 × 10 - 15

3.2

3.2 Example 2

Next consider the following problem Fig. 1 y + 5 y + 7 y + 3 y = 0 , y ( 0 ) = 1 , y ( 0 ) = 0 , y ( 0 ) = - 1 , 0 x 1 . The exact solution is y ( x ) = e - x + x e - x . The operational matrices of Bernstein polynomials method yields y ( x ) - 8.023524662 × 10 - 11 x 14 + 1.683945475 × 10 - 9 x 13 - 2.2420566212 × 10 - 8 x 12 + 2.4968885757 × 10 - 7 x 11 - 0.247924992485 × 10 - 5 x 10 + 0.220451309070 × 10 - 4 x 9 - 0.1736106853770 × 10 - 3 x 8 + 0.11904760061469 × 10 - 2 x 7 - 0.69444443862206 × 10 - 2 x 6 + 0.333333333201911 × 10 - 1 x 5 - 0.12499999999796276 x 4 + 0.33333333333314344 x 3 - 0.500000000000000001 x 2 + 0.99999999999999999999 .

Approximation solution for example 1 using Bernstein polynomials with exact solution.
Fig. 1
Approximation solution for example 1 using Bernstein polynomials with exact solution.

Table 2 clearly shows the accuracy of the present method.

Table 2 Absolute errors for Example 2.
Error Error
x Exact solution Bernstein solution Present method Ref. (Mohammed and Adeniyi, 2014)
0.1 0.99532115983955553048 0.99532115983955545628 7.42 × 10 - 17 1.00 × 10 - 10
0.2 0.98247690369357823040 0.98247690369357792919 3.01 × 10 - 16 3.00 × 10 - 10
0.3 0.96306368688623322589 0.96306368688623261523 6.11 × 10 - 16 7.00 × 10 - 10
0.4 0.93844806444989502104 0.93844806444989407304 9.48 × 10 - 16 7.00 × 10 - 10
0.5 0.90979598956895013540 0.90979598956894887800 1.26 × 10 - 15 6.00 × 10 - 10
0.6 0.87809861775044229221 0.87809861775044086917 1.42 × 10 - 15 2.00 × 10 - 10
0.7 0.84419501644539617499 0.84419501644539506014 1.11 × 10 - 15 9.00 × 10 - 10
0.8 0.80879213541099886457 0.80879213541099944217 5.78 × 10 - 16 2.80 × 10 - 9
0.9 0.77248235350713831257 0.77248235350714424660 5.93 × 10 - 15 5.40 × 10 - 9
1.0 0.73575888234288464320 0.73575888234290481537 2.02 × 10 - 14 3.50 × 10 - 9

3.3

3.3 Example 3

y = 3 sin x , y ( 0 ) = 1 , y ( 0 ) = 0 , y ( 0 ) = - 2 , 0 x 1 . The exact solution of this problem is y ( x ) = 3 cos x + ( x 2 / 2 ) - 2 and the approximate solution of the present method is y ( x ) - 2.374911736 × 10 - 11 x 14 - 6.86371074 × 10 - 11 x 13 + 6.478659491 × 10 - 9 x 12 - 4.1795110 × 10 - 10 x 11 - 8.2617332888 × 10 - 7 x 10 - 5.023725 × 10 - 10 x 9 + 0.744050936033 × 10 - 4 x 8 - 1.581103 × 10 - 10 x 7 - 0.41666666125723 × 10 - 2 x 6 - 1.30540 × 10 - 11 x 5 + 0.12500000000215427 x 4 - 2.3127 × 10 - 13 x 3 - 1.000000000000000001 x 2 + 0.99999999999999999999 .

Again the errors depicted in Table 3 show the accuracy of the present method. Figs. 2 and 3.

Table 3 Absolute errors for Example 3.
x Exact solution Bernstein solution Error
0.1 0.9900124958340772983 0.9900124958340771930 1.05 × 10 - 16
0.2 0.9601997335237248934 0.96019973352372439108 5.02 × 10 - 16
0.3 0.9110094673768180589 0.91100946737681686283 1.20 × 10 - 15
0.4 0.8431829820086552484 0.93844806444989407304 2.18 × 10 - 15
0.5 0.7577476856711181484 0.84318298200865306768 3.43 × 10 - 15
0.6 0.6560068447290348917 0.65600684472902999918 4.89 × 10 - 15
0.7 0.5395265618534652788 0.53952656185345885671 6.42 × 10 - 15
0.8 0.4101201280414962628 0.41012012804148848222 7.78 × 10 - 15
0.9 0.2698299048119933694 0.26982990481198474225 8.63 × 10 - 15
1.0 0.1209069176044191522 0.12090691760441048523 8.67 × 10 - 15
Approximation solution for example 2 using Bernstein polynomials with exact solution.
Fig. 2
Approximation solution for example 2 using Bernstein polynomials with exact solution.
Approximation solution for example 3 using Bernstein polynomials with exact solution.
Fig. 3
Approximation solution for example 3 using Bernstein polynomials with exact solution.

4

4 Applications to equations of fluid flow

4.1

4.1 Boundary layer flow

Now consider the nonlinear boundary layer equation

(13)
2 y + yy = 0 , y ( 0 ) = 0 , y ( 0 ) = 0 , y ( 0 ) = 1 . This equation is famously known as the Blasius equation. The aim of solving Blasius equation to get the value y ( 0 ) to evaluate the shear stress at the plate. Blasius equation has been solved using different methods like series expansions, Runge Kutta, differential transformation and others. The interested readers can also see Lien-Tsai and Cha’o-Kuang (1998) and Schlichting et al. (1955). y ( x ) 1.12610441 × 10 - 7 x 14 - 7.7621579 × 10 - 7 x 13 + 0.27970246 × 10 - 5 x 12 - 0.7042654 × 10 - 5 x 11 + 0.8050211 × 10 - 5 x 10 - 0.7633041 × 10 - 5 x 9 + 0.73343596 × 10 - 4 x 8 - 0.2480836 × 10 - 5 x 7 + 8.55631 × 10 - 7 x 6 - 0.4166874207 × 10 - 2 x 5 + 3.43594 × 10 - 8 x 4 - 3.69550 × 10 - 9 x 3 + 0.5 x 2 . Comparison with the results from a hybrid block method of Adesanya et al. (2013) shows a good agreement (see Table 4).
Table 4 Comparison with hybrid block method of Adesanya et al. (2013).
x Ref. (Adesanya et al., 2013) Present method
0.1 0.00499997916611 0.0049999583341723
0.2 0.01999866666859 0.0199986668419935
0.3 0.044998481293978 0.0449898794745896
0.4 0.079991467388617 0.0799573779857994
0.5 0.124967454367055 0.1248700575229549
0.6 0.179902837409194 0.179677141245484
0.7 0.244755067600357 0.244303616982151
0.8 0.319454500640289 0.318646009310246
0.9 0.403894871267148 0.402568620552525
1.0 0.49792248311043 0.495900382783151

4.2

4.2 Thin film flow

The motion of the contact line for a thin oil drop spreading on a horizontal surface can be modelled by

(14)
y = y - 2 . This equation describes the dynamic balance between surface tension and viscous forces in the absence of gravity in a thin fluid layer. Duffy and Wilson (1997) introduced a parametric representation for the exact solution of Eq. (14) as x = 2 1 3 π A i ( s ) B i ( s 0 ) - A i ( s 0 ) B i ( s ) [ aA i ( s 0 ) + bB i ( s 0 ) ] [ aA i ( s ) + bB i ( s ) ] , y = 1 [ aA i ( s ) + bB i ( s ) ] 2 , where A i ( . ) , B i ( . ) are the Airy functions, and a , b and s 0 are constants determined by the initial conditions. This equation was also solved by Mechee et al. (2013) and Momoniat and Mahomed (2010). For the initial conditions y ( 0 ) = y ( 0 ) = y ( 0 ) = 1 , Momoniat and Mahomed (2010) obtained
(15)
a = 0.676482 , b = 1.60629 , s 0 = - 0.39685 .
We apply our method on this problem with n = 14 and Chebyshev roots as a collocation nodes. Applying the present method gives y ( x ) - 0.45984700218196 × 10 - 5 x 14 + 0.48584303974767 × 10 - 4 x 13 - 0.24134233269265 × 10 - 3 x 12 + 0.74592504943532 × 10 - 3 x 11 - 0.15918744859666 × 10 - 2 x 10 + 0.24661462173050 × 10 - 2 x 9 - 0.30219812091711 × 10 - 2 x 8 + 0.43032528580877 × 10 - 2 x 7 - 0.110923450695375 × 10 - 1 x 6 + 0.333291876770568 × 10 - 1 x 5 - 0.833326916924882 × 10 - 1 x 4 + 0.16666660079020539 x 3 + 0.49999999999999999 x 2 + x + 1 . Comparison in Table 5 shows that our present method yields numerical results which are correct to five decimal places.
Table 5 Solutions of the present method as compared with the exact solution and Runge-Kutta type solution.
x Exact solution Ref. (Mechee et al., 2013) Present method
Ref. (Duffy and Wilson, 1997)
0.0 1.000000000 1.0000000000 1.0000000000
0.2 1.221211030 1.2212100045 1.2212100043
0.4 1.488834893 1.4888347799 1.4888347792
0.6 1.807361404 1.8073613977 1.8073613962
0.8 2.179819234 2.1798192339 2.1798192314
1 2.608275822 2.6082748676 2.6082748636

5

5 Conclusion

In this paper, we have modified for the first time the classical operational matrices of Bernstein polynomials method to solve directly a class of third-order ODEs. The method presented in this work avoids the need to transform the ODEs to a system of lower (or first)-order ODEs. The approximate solutions obtained are in the form of series whose terms can be easily computed. The procedure of the method can be programmed symbolically softwares like Maple or Mathematica. The method has also been shown to perform reasonably well for all the test problems.

References

  1. , , , . A new hybrid block method for the solution of general third order initial value problems of ordinary differential equations. Int. J. Pure Appl. Math.. 2013;86:365-375.
    [Google Scholar]
  2. , , , , . Approximate solutions of singular differential equations with estimation error by using Bernstein polynomials. Int J Pure Appl Math.. 2015;100:109-125.
    [Google Scholar]
  3. , , , , . Solution of fractional-order differential equations based on the operational matrices of new fractional Bernstein functions. J. King Saud. Univ. Sci.. 2017;29:1-18.
    [Google Scholar]
  4. , , . Using operational matrix of two-dimensional Bernstein polynomials for solving two-dimensional integral equations of fractional order. Appl. Math. Comput.. 2017;307:290-298.
    [Google Scholar]
  5. , , . A class of hybrid collocation methods for third-order ordinary differential equations. Int. J. Comput. Math.. 2005;82:1287-1293.
    [Google Scholar]
  6. Bellucci, M.A., 2014. On the explicit representation of orthonormal Bernstein polynomials. arXiv preprint arXiv:1404.2293. Bibliographic Code: arXiv:1404.2293 [math.CA], Cornell University Library. 13 pages.
  7. , , , , . Numerical solution for the variable order linear cable equation with Bernstein polynomials. Appl. Math. Comput.. 2014;238:329-341.
    [Google Scholar]
  8. , , . A third-order differential equation arising in thin-film flows and relevant to Tanner’s law. Appl. Math. Lett.. 1997;10:63-68.
    [Google Scholar]
  9. , . The Bernstein polynomial basis: a centennial retrospective. Comput. Aided Geom. Des.. 2012;29:379-419.
    [Google Scholar]
  10. , , , . A nonlinear fractional model to describe the population dynamics of two interacting species. Math. Methods Appl. Sci.. 2017;40:4134-4148.
    [Google Scholar]
  11. , , . The solution of the Blasius equation by the differential transformation method. Math. Comput. Model.. 1998;28:101-111.
    [Google Scholar]
  12. , , , . New operational matrix via Genocchi polynomials for solving Fredholm-Volterra fractional integro-differential equations. Adv. Math. Phys. 2017 Article ID 3821870
    [Google Scholar]
  13. , . Bernstein polynomials. New York: Amer. Math. Soc; .
  14. , , , . Solving second order ordinary differential equations using two point four step direct implicit block method. Eur. J. Sci. Res.. 2009;31:29-36.
    [Google Scholar]
  15. , , , , , . A three-stage fifth-order Runge-Kutta method for directly solving special third-order differential equation with application to thin film flow problem. Math. Probl. Eng.. 2013;2013 Article ID 795397
    [Google Scholar]
  16. , , . Bernstein polynomial collocation method for elliptic boundary value problems. PAMM. 2013;13:421-422.
    [Google Scholar]
  17. Mirkov, N., Rasuo, B., 2012. A bernstein polynomial collocation method for the solution of elliptic boundary value problems. arXiv preprint arXiv:1211.3567. Bibliographic Code: 2012arXiv1211.3567M, Cornell University Library. 21 pages.
  18. , , . A three step implicit hybrid linear multistep method for the solution of third order ordinary differential equations. Gen. Math. Notes.. 2014;25:62-74.
    [Google Scholar]
  19. , , . Symmetry reduction and numerical solution of a third-order ode from thin film flow. Math. Comput. Appl.. 2010;15:709-719.
    [Google Scholar]
  20. , , . Direct block predictor-corrector method for the solution of general fourth order odes. J. Math. Res.. 2013;5:26-33.
    [Google Scholar]
  21. , , . A new block method for special third order ordinary differential equations. J. Math. Stat.. 2009;5:167-170.
    [Google Scholar]
  22. , , . Solution of Lane-Emden type equations using Bernstein operational matrix of differentiation. New Astron.. 2012;17:303-308.
    [Google Scholar]
  23. , . An Introduction to the Approximation of Functions. New York: Courier Corporation; .
  24. , , , , . Boundary-Layer Theory. Vol volume 7. New York: Springer; .
  25. , , , , . An efficient computational approach for time-fractional Rosenau-Hyman equation. Neural Comput. Appl. 2017:1-8.
    [CrossRef] [Google Scholar]
  26. , , , , . Numerical solution of higher order ordinary differential equations by direct block code. J. Math. Stat.. 2011;8:77-81.
    [Google Scholar]
  27. , , . Operational matrices of Bernstein polynomials and their applications. Int. J. Syst. Sci.. 2010;41:709-716.
    [Google Scholar]
  28. , , , . The operational matrices of Bernstein polynomials for solving the parabolic equation subject to specification of the mass. J. Comput. Appl. Math.. 2011;235:5272-5283.
    [Google Scholar]
  29. , , , , , . Residual power series method for time-fractional Schrödinger equations. J. Nonlinear Sci. Appl.. 2016;9:5821-5829.
    [Google Scholar]
Show Sections