Fourth Order Legendre Polynomial Solution Using Matrices

Math Sci (2015) 9:93-102

DOI 10.1007/s40096-015-0155-8 CrossMark

ORIGINAL RESEARCH

A novel operational matrix method based on shifted Legendre polynomials for solving second-order boundary value problems involving singular, singularly perturbed and Bratu-type equations

W. M. Abd-Elhameed1,2 • Y. H. Youssri2 • E. H. Doha2

Received: 31 July 2014/Accepted: 23 May 2015/Published online: 11 June 2015 © The Author(s) 2015. This article is published with open access at Springerlink.com

Abstract In this article, a new operational matrix method based on shifted Legendre polynomials is presented and analyzed for obtaining numerical spectral solutions of linear and nonlinear second-order boundary value problems. The method is novel and essentially based on reducing the differential equations with their boundary conditions to systems of linear or nonlinear algebraic equations in the expansion coefficients of the sought-for spectral solutions. Linear differential equations are treated by applying the Petrov-Galerkin method, while the nonlinear equations are treated by applying the collocation method. Convergence analysis and some specific illustrative examples include singular, singularly perturbed and Bratu-type equations are considered to ascertain the validity, wide applicability and efficiency of the proposed method. The obtained numerical results are compared favorably with the analytical solutions and are more accurate than those discussed by some other existing techniques in the literature.

Keywords Shifted Legendre polynomials • Second-order equations • Singular and singularly perturbed • Bratu equation • Petrov-Galerkin method • Collocation method

Mathematics Subject Classification

35C10 • 42C10

65M70 • 65N35 •

& Y. H. Youssri

youssri@sci.cu.edu.eg

1 Department of Mathematics, Faculty of Science, University of Jeddah, Jeddah, Saudi Arabia

2 Department of Mathematics, Faculty of Science, Cairo University, Giza, Egypt

Introduction

Spectral methods (see, for instance [1-6]) are one of the principal methods of discretization for the numerical solution of differential equations. The main advantage of these methods lies in their accuracy for a given number of unknowns. For smooth problems in simple geometries, they offer exponential rates of convergence/spectral accuracy. In contrast, finite difference and finite-element methods yield only algebraic convergence rates. The three spectral methods, namely, the Galerkin, collocation, and tau methods are used extensively in the literature. Collocation methods [7, 8] have become increasingly popular for solving differential equations, since they are very useful in providing highly accurate solutions to nonlinear differential equations. Petrov-Galerkin method is widely used for solving ordinary and partial differential equations; see for example [9-13]. The Petrov-Galerkin methods [14] have generally come to be known as "stablized" formulations, because they prevent the spatial oscillations and sometimes yield nodally exact solutions where the classical Galerkin method would fail badly. The difference between Galerkin and Petrov-Galerkin methods is that the test and trial functions in Galerkin method are the same, while in Pet-rov-Galerkin method, they are not.

The subject of nonlinear differential equations is a well-established part of mathematics and its systematic development goes back to the early days of the development of calculus. Many recent advances in mathematics, paralleled by a renewed and flourishing interaction between mathematics, the sciences, and engineering, have again shown that many phenomena in applied sciences, modeled by differential equations, will yield some mathematical explanation of these phenomena (at least in some approximate sense).

Even order differential equations have been extensively discussed by a large number of authors due to their great importance in various applications in many fields. For example, in the sequence of papers [12, 15-17], the authors dealt with such equations by the Galerkin method. They constructed suitable basis functions which satisfy the boundary conditions of the given differential equation. For this purpose, they used compact combinations of various orthogonal polynomials. The suggested algorithms in these articles are suitable for handling one- and two-dimensional linear high even-order boundary value problems. In this paper, we aim to give some algorithms for handling both of linear and nonlinear second-order boundary value problems based on introducing a new operational matrix of derivatives, and then applying Petrov-Galerkin method on linear equations and collocation method on nonlinear equations.

Of the important high-order differential equations are the singular and singular perturbed problems (SPPs) which arise in several branches of applied mathematics, such as quantum mechanics, fluid dynamics, elasticity, chemical reactor theory, and gas porous electrodes theory. The presence of a small parameter in these problems prevents one from obtaining satisfactory numerical solutions. It is a well-known fact that the solutions of SPPs have a multi-scale character, that is, there are thin layer(s) where the solution varies very rapidly, while away from the layer(s) the solution behaves regularly and varies slowly.

Also, among the second-order boundary value problems is the one-dimensional Bratu problem which has a long history. Bratu's own article appeared in 1914 [19]; generalizations are sometimes called the Liouville-Gelfand or Liouville-Gelfand-Bratu problem in honor of Gelfand [20] and the nineteenth century work of the great French mathematician Liouville. In recent years, it has been a popular testbed for numerical and perturbation methods [21-27].

Simplification of the solid fuel ignition model in thermal combustion theory yields an elliptic nonlinear partial differential equation, namely the Bratu problem. Also due to its use in a large variety of applications, many authors have contributed to the study of such problem. Some applications of Bratu problem are the model of thermal reaction process, the Chandrasekhar model of the expansion of the Universe, chemical reaction theory, nanotechnology and radiative heat transfer (see, [28-32]).

The Bratu problem is nonlinear (BVP) and extensively used as a benchmark problem to test the accuracy of many numerical methods. It is given by:

y"(x)+k ey(x)= 0; y(0)=y(1) = 0, 0 6 x 6 1,

where k > 0. The Bratu problem has the following analytical solution:

cosh(f (2x - 1)) cosh( 4)

where h is the solution of the nonlinear equation

e = pk cosh e.

Our main objectives in the present paper are:

• Introducing a new operational matrix of derivatives based on using shifted Legendre polynomials and harmonic numbers.

• Using Petrov-Galerkin matrix method (PGMM) to solve linear second-order BVPs.

• Using collocation matrix method (CMM) to solve a class of nonlinear second-order BVPs, including singular, singularly perturbed and Bratu-type equations.

The outlines of the paper is as follows. In ''Some properties and relations of Shifted Legendre polynomials and harmonic numbers'', some relevant properties of shifted Legendre polynomials are given. Some properties and relations of harmonic numbers are also given in this section. In ''A shifted Legendre matrix of derivatives'', and with the aid of shifted Legendre polynomials polynomials, a new operational matrix of derivatives is given in terms of harmonic numbers. In ''Solution of second-order linear two point BVPs'', we use the introduced operational matrix for reducing a linear or a nonlinear second-order boundary value problems to a system of algebraic equations based on the application of Petrov-Galerkin and collocation methods, and also we state and prove a theorem for convergence. Some numerical examples are presented in ''Numerical results and discussions'' to show the efficiency and the applicability of the suggested algorithms. Some concluding remarks are given in ''Concluding remarks''.

Some properties and relations of shifted Legendre polynomials and harmonic numbers

Shifted Legendre polynomials

The shifted Legendre polynomials Lk(x) are defined on [a, b] as:

t*( \ j (2x - a - b Lk(x)=Lk[

k = 0,1,...,

where Lk(x) are the classical Legendre polynomials. They may be generated by using the recurrence relation

(k + 1)Lk+1(x) = (2k + 1) f2x- b-^ Lk(x)-kLkk_1(x),

k = 1,2,...,

2x b a

with Lk(x) = 1, Lj(x) =—j-.These polynomials are

orthogonal on [a, b], i.e.,

b — a

l;(x) l;(x) dx = { 2nTT ' m = n

0, m = n.

The polynomials (x) are eigenfunctions of the following singular Sturm-Liouville equation:

—D[(x - a)(x - b) D /k(x)] + k(k + 1) /(x) = 0,

where D = -f.

Harmonic numbers

Any function y(x) e ¿0 [a, b] can be expanded as

y(x) = ci /i(x);

2i + 1

y(x) /i(x)

b — Wa (x — a)2(b — x)2

dx = y(x); /i(x)

If the series in Eq. (8) is approximated by the first (N + 1) terms, then

The nth harmonic number is the sum of the reciprocals of the first n natural numbers, i.e.,

Hn — Hn—1 =-, n = 1,2,...,

The numbers Hn satisfy the recurrence relation

and have the integral representation

f1 1 — xn

Hn = --dx.

./0 1 — x

The following Lemma is of fundamental importance in the sequel.

Lemma 1 The harmonic numbers satisfy the following three-term recurrence relation:

(2i — 1) H,—1 — (i — 1) H,—2 = ¿H,-, i > 2.

Proof The recurrence relation (6) can be easily proved with the aid of the relation (5). □.

A shifted Legendre matrix of derivatives

Consider the space (see, [33])

¿2[a, b] = {/(x) e L2[a, b] : /(a) = /(b) = 0},

and choose the following set of basis functions:

/i(x) = (x — a)(b — x) ¿(x), i = 0, 1, 2,.... (7)

It is not difficult to show that the set of polynomials {/k(x) : k = 0,1,2,...} are linearly independent and orthogonal in the complete Hilbert space ¿0[a, b], with

respect to the weight function w(x)

0, i = j

-2-2, i.e.,

(x — a) (b — x)

/i(x) /j(x) dx I ,

= < b — a

(x — a)2 (b — x)2

2 i + 1

y(x) ' yN(x) = ^ Ci /i(x) = CT U(x),

CT = [c0, c1;cn]; U(x) = [/0(x) ^1(x); (x)]T.

Now, we state and prove the basic theorem, from which a new operational matrix can be intoduced.

Theorem 1 Let /¿(x) be as chosen in (7). Then for all i > 1, one has

2 i—1

D /¿(x) = — £ (2 j + 1) (1 + 2 Hi — 2 Hj)

(i + j) odd

/j(x) + di(x), (11)

where ¿¿(x) is given by

a + b — 2x, i even, a — b, i odd.

Proof We proceed by induction on i. For i = 1, it is clear

that the left hand side of (11) is equal to its right-hand side,

6 (x — a)(b — x)

which is equal to: a — b H----. Assuming that

b — a

relation (11) is valid for (i — 2) and (i — 1), we want to prove its validity for i. If we multiply both sides of (3) by (x — a)(x — b) and make use of relation (7), we get

/i (x)=r^V2^ W 1(x)— — ^

1 b — a /i—2(x), i = 2 3, ...,

which immediately gives

2 i- 1 "

D/i(x)

i(b — a) i1

(2x — b — a)D/i—! (x) + 2 /i—! (x) D/i_2(x). (14)

Now, application of the induction step on d/,. j (x) and D/i—2(x) in (14), yields

D/(x) =

2(2 i — 1)(2x - b — a) i(b — a)2

E (2 j + 1) j = 0 (i + j) even

(1 + 2Hi—i — 2Hj) /j(x)

If-!! .S (2j + 1)(1 + 2Hi—2 — 2Hj) /j(x)

(i + j) odd

2(2i - 1) . ^

+ -777-T Pi—1 (x) + Ci'W;

i(b — a)

* i \ (2' — 1)(2x — b — a) c , n i — 1c /N

& (x)=--^-r-- di—i(x)--— di—2(x)

i(b — a) i

a + b — 2x,

= {(2 i — 1)(2x — b — a)2 i — 1

i even,

i(a — i

--:—(a — b), i odd.

Substitution of the recurrence relation (13) in the form

2x — a — b b — a

2j + 1

/j+1(x)+j"qrr /j—1(x)

into relation (15), and after performing some rather lenghthy algebraic manipulations, give

i—3 2(2i — 1) (x)= = mij /j (x)+ (b—a)

(i + j) odd 2(i — 1)

(Hi—1 — Hi—2)

(b — a)

2 (i — 1) 2(2i — 1) 3i — 2' Hi_ 2--(—-^ H,-_ 1 + —

/0(x) + ni(x);

2(2j + 1) (b — a)

! 2(2i — 1)j H , 2(i — 1) 1 — • , ^ 1 +--:-

i(2j + 1)

2(2i — 1)(/' + 1) i(2j + 1)

2(i — 1) H , 2(2i — 1) H

--:-Hi—2 +--:-Hi—1

1, i odd, 0, i even.

Now, the elements m- in (18) can be written in the alternative form

2(2j + 1) " (b — a)

1 + 2 {(2i — 1)Hi—1 — (i — 1)Hi—2}

2(2i — 1) , .„ , 2(i — 1) H — /(2/TTy <j H—1 + ( + + i H

which can be simplified with the aid of Lemma 1, to take the form

^ f—1 + 2H —

Repeated use of Lemma 1 in (17), and after performing some manipulation, leads to

D/(x) =

E (2j + 1) (1 + 2Hi — 2Hj) /j(x) j=0 (i + j) odd

2(2i— 1)

-c;(x — a)(b — x)

and by noting that

& (x)— "TT"-lУ ci(x — a)(b — x)= di(x),

i(b — a)

D/(x) =

E (2j + 1) (1 + 2Hi — 2Hj

j = 0 (i + j) odd

/j(x) + di(x), (21)

and this completes the proof of Theorem 1. □

Corollary 1 Let x e [-1,1] = [a, b], Wi(x) = (1 - x2) Li(x). Then for all i > 1, one has

DWi(x)= E (2j + 1) (1 + 2Hi - 2Hj) Wj(x)+ Ci(x), j=0 (i + j) odd

( —2x, i even,

Ci(x) =

2, i odd:

Now, and based on Theorem 1, it can be easily shown that the first derivative of the vector U(x) defined in (10) can be expressed in the matrix form:

dU(x) dx

M U(x) + d,

d = (do(x), di(x); . . ., ¿n(x)) , a + b — 2x, i even, a — b, i odd,

and M = (raj)0<. , is an (N + 1)x (N + 1) matrix whose nonzero elements can be given explicitly from relation (11) as:

= / ^ (2j + !) i1 + 2^ - 2Hj), i > j, (i + j) odd,

For example, for N = 5, we have

otherwise.

0 0 0 0 0 0

3 0 0 0 0 0

0 6 0 0 0 0

14 y 0 25 y 0 0 0

0 19 Y 0 21 y 0 0

167 \"30 0 77 "6" 0 63 y 0 A

Remark 1 The second derivative of the vector U(x) is given by

d2U(x)

dx2 where

:M2 U(x)+M d + d',

d' = (¿0; ¿m... ¿N)T , ¿i

i even, i odd.

Solution of second-order linear two-point BVPs

In this section, both of linear and nonlinear second-order two-point BVPs are handled. For linear equations, a Pet-rov-Galerkin method is applied, while for nonlinear equations, the typical collocation method is applied.

Linear second-order BVPs subject to homogenous boundary conditions

Consider the linear second-order boundary value problem /'(x)+/i (x) y (x)+/2(x) y(x) = g(x), x e(a, b),

subject to the homogenous boundary conditions

y(a) = y(b) = 0. (26)

If we approximate y(x) as in (9), making use of relations (23) and (24), we have the following approximations for y(x), y' (x) and y''(x):

y(x) ' CT U(x),

y (x)'CTM U(x) + CT d,

y''(x) ' CT M2 U(x) + CT M d + CT d'.

(28) (29)

If we substitute the relations (27), (28) and (29) into Eq. (25), then the residual R(x), of this equation is given by:

R(x) =CT M2U(x) + CT M d + CT d' + / (x)

(CTM U(x)+ CT d) (30)

+f2(x) (CT U(x)) — g(x).

The application of Petrov Galerkin method (see, [1]) yields the following (N + 1 ) linear equations in the unknown expansion coefficients, ci, namely,

[ R(x) L* (x) dx = 0, i = 0,1,..., N.

Thus, Eq. (31) generates a set of (N + 1) linear equations which can be solved for the unknown components of the vector C, and hence the approximate spectral solution yN (x) given in (9) can be obtained.

Linear second-order BVPs subject to nonhomogeneous boundary conditions

Consider the following one-dimensional second-order equation:

M''(x)+/1 (x) m'(x)+/2(x) m(x) = g1 (x), x e (a, b),

subject to the nonhomogeneous boundary conditions: w(a) = a, w(b) = b. (33)

It is clear that the transformation

a (b — x)+ b (x — a)

m(x) = y(x) + -

turns the nonhomogeneous boundary conditions (33) into the homogeneous boundary conditions:

y(a)=y(b) = 0.

Hence it suffices to solve the following modified one-dimensional second-order equation:

y'(x)+/1 (x) y (x)+/2(x) y(x) = g(x), x e(a, b),

subject to the homogeneous boundary conditions (34), where

Math Sci (2015) 9:93-102

, , , , b - a f , , a (b - x) + ^ (x - a)

g(x) = gi(x)- --fi(x)----/2(x).

b — a b — a

Solution of second-order nonlinear two-point BVPs

Consider the nonlinear differential equation

Z(X)=F(X, y(x); y (x)); (36)

subject to the homogenous conditions

y(a) = y(b) = 0.

If we follow the same procedure of ''Linear second-order BVPs subject to homogenous boundary conditions'', and approximate y(x) as in (27), then after making use of the two relations (23) and (24), then we get the following nonlinear equation in the unknown vector C

CTM2U(x)+ CT M d + CT d' = F(x, CT U(x),

CTM U(x)+CT d).

To find the numerical solution yN (x), we enforce (37) to be satisfied exactly at the first (N + 1) roots of the polynomial Lv+i(x). Thus a set of (N + 1) nonlinear equations is generated in the expansion coefficients, c,. With the aid of the well-known Newton's iterative method, this nonlinear system can be solved, and hence the approximate solution yN (x) can be obtained.

Remark 2 Following a similar procedure to that given in ''Linear second-order BVPs subject to nonhomogeneous boundary conditions'', the nonlinear second-order Eq. (36) subject to the nonhomogeneous boundary conditions given as in (33) can be tackled.

Convergence analysis

In this section, we state and prove a theorem for convergence of the proposed method.

Theorem 2 The series solutions of Eqs. (25) and (36) converge to the exact ones.

Proof Let

y(x) = E i=0

yM(x) = E ci/i(x), i=0 N

yN(x) = Y_I ci/i(x), i=0

be the exact and approximate solutions (partial sums) to Eqs. (25) and (36) with N > M. Then we have

y(x); yN(x) ) = ( y(x), E ci /i(x) )

' w(x) V i=0 ' w(x)

= E (y(x); /(x) )

i=0 V '

= E cici = Ejcil2. i=0 i=0

We show that yN (x) is a Cauchy sequence in the complete Hilbert space L0[a, b] and hence converges. Now,

llyN (x)-yM (x)|

E lei2.

From Bessel's inequality, we have ^^ |c,|2 is convergent,

which yields ||yN(x)—yM(x)||w(x) ! 0 as M, N and

hence yN(x) converges to say b(x). We prove that

b(x) =У(x),

(b(x)- y(x), ={ b(x), /i (x)) - fy(x), /i(x))

\ / w(x) \ / w(x) \ / w(x)

= ( Jim yN, /i(xn - ci

VN!1 /w(x)

= iim (yN, /i(x0 - ci =0.

This proves ^^ ^/¿(x) converges to y(x).

As the convergence has been proved, then consistency and stability can be easily deduced.

Numerical results and discussions

In this section, the presented algorithms in ''Solution of second-order linear two point BVPs'' are applied to solve regular, singular as well as singularly perturbed problems. As expected, the accuracy increases as the number of terms of the basis expansion increases.

Example 1 Consider the second-order nonlinear equation (see, [34]).

2 y''=(y + x + 1)3; 0<x<1, y(0) = y(1) = 0.

The exact solution of (38) is 2

y(x) =--x - 1.

Table 1 Maximum absolute n 6 10 14 18 22

error E for Example 1

1.371 x 10-6 1.037 x 10-9 5.715 x 10-13 7.140 x 10-16 5.312 x 10-17

In Table 1, the maximum absolute error E is listed for various values of N, while in Table 2 a comparison between the numerical solution of problem (38) obtained by the application of CMM with the two numerical solutions obtained by using a sinc-collocation and a sinc-Galerkin methods in [34] is given.

Example 2 Consider the second-order nonlinear singular equation (see, [34]).

(4 + xs)(xr y')'= sxr+s—2(sx*ey — r — s + 1), 0<x<1,

, Janine,,

with the exact solution

; = 3 - r, r e(0,1);

y(x) = — ln(4 + Xs).

In Table 3, the maximum absolute error E is listed for various values of r and N, while in Table 4 a comparison between the solution of Example 2 obtained by our method (CMM) with the two numerical solutions obtained in [34] is given for the case r = In addition, Fig. 1 illustrates the absolute error resulting from the application of CMM for the two cases corresponding to N = 10, r = 4 and N = 15, r:

Example 3 Consider the following singularly perturbed linear second-order BVP (see, [35])

e y' '(x)+y' (x)-y(x) = 0;

2e e1?

(e + 2e + 1)ee + e - 2e - 1

0<x< 1,

y(1) = 1,

where e = \J4e + 1, with the exact solution

Table 2 Comparison between different solutions for Example 1

Method CMM Sinc-collocation [34] Sinc-Galerkin [34]

N 22 130 130

E 5.312 x 10—17 9.159 x 10—16 9.992 x 10—16

y(x) =

(e+1)(1-x) (e + 2e + 1)exe + e - 2e - 1

e 2e 2_1_

" (e + 2e + 1)e« + e - 2e - 1

In Table 5, the maximum absolute error E is listed for various values of e and N, while in Table 6, we give a comparison between the solution of Example 3 obtained by our method (PGMM) with the solution obtained by the shooting method given in [35].

Example 4 Consider the following nonlinear second-order boundary value problem:

y"(x) — (y (x))2 + 16 y(x) = 2 — 16 x6; —1<x<1,

y(—1) = y(1) = 0,

with the exact solution y(x) = x2 — x4. Making use of (9) with N = 2 yields

yN (x)= CT U (x) = ( 1 — x2) (c0 L0 (x) + C1 L1 (x) + C2 L2 (x^.

Moreover, in this case the two matrices M and M2 take the forms

0 0 0 01 0 0 0 01 M = 3 0 0 , M2 ^ 0 0 0 . \0 6 0/ \ 18 0 0/

Now, with the aid of Eq. (37), we have

c0(2x2 — 1)+ c1 (6x3 — 5x) + c2(6x4 + 5x2 — 1)

+ ^ (2co x — C1 + 3 C1 x2 + 6 C2 x3 — 4c2 x) = 8x6 — 1.

We enforce (40) to be satisfied exactly at the roots of L3(x), namely, — ^/f, 0, y^. This immediately yields three nonlinear algebraic equations in the three unknowns, c0, cj and c2. Solving these equations, we get

Table 3 Maximum absolute error E for Example 2

5.844 x 10-9

15 ^ 7.338 x 10-10

1.164 x 10-

3.234 x 10-7 4.927 x 10-8 4.435 x 10-9

1.291 x 10-6 2.441 x 10-7 2.247 x 10-8

4.698 x 10-7 1900 1.416 x 10-7 1.229 x 10-8

Table 4 Comparison between different solutions for Example 2, Table 7 Maximum absolute error E for Example 5

Method CMM Sinc-collocation [34] Sinc-Galerkin [34]

N 20 100 100

E 4.435 x 10—9 1.552 x 10—6 1.552 x 10—6

1.2x10

0.2 0.4 0.6 0.8

Fig. 1 The absolute error of Example 2 for r = 4

Table 5 Maximum absolute error E for Example 3

N e E e E

4 4.527 x 10—5 2.942 x 10-5

5 1.091 x 10—5 7.974 x 10-7

6 10—3 9.202 x 10—6 10- -4 9.444 x 10-7

7 8.184 x 10—6 8.323 x 10-7

8 1.013 x 10—6 7.815 x 10-8

Table 6 Comparison between the best errors for Example 3

Method PGMM Shooting method [35]

Best error 7.815 x 10—8 3.677 x 10-5

co = 3 , ci = 0, C2 = 3,

and hence

y(x)=(1, 0, 3

( 1 - x2 \

x — x3

h 2x x 2 ^ 2 )

which is the exact solution.

Example 5 Consider the following Bratu Equation (see, [28-31]).

y"(x)+k e3^ = 0; y(0)=y(1)=0, 0 6 x 6 1.

N k E k E k E

2 7.065 x 10- 5 9.420 x 10- 4 4.904 x 10- 2

4 2.274 x 10- -7 7.828 x 10- 6 1.833 x 10- 3

6 2.102 x 10- 9 1.437 x 10- 7 7.008 x 10- 5

8 1.715 x 10- -11 2.758 x 10- 9 3.761 x 10- 6

10 1 2.217 x 10- -13 2 8.082 x 10- 11 3.51 3.740 x 10- 7

12 1.984 x 10- -15 1.461 x 10- -12 2.355 x 10- 8

14 2.983 x 10- -16 5.342 x 10- 14 2.410 x 10- 9

16 3.053 x 10- -16 1.644 x 10- 15 2.975 x 10- -10

18 2.983 x 10- 16 4.024 x 10- 16 2.747 x 10- 11

With the analytical solution

" cosh (h (2x - 1))

y(x) = —2ln

cosh( f)

where h is the solution of the nonlinear equation h = a/ZA cosh h. The presented algorithm in Section 4.3 is applied to numerically solve Eq. (41), for the three cases corresponding to A = 1, 2 and 3.51 which yield h = 1.51716, 2.35755 and 4.66781, respectively. In Table 7, the maximum absolute error E is listed for various values of N, and in Table 8, we give a comparison between the best errors obtained by various methods used to solve Example 5. This table shows that our method is more accurate compared with the methods developed in [28-31]. In addition, Fig. 2 illustrates a comparison between different solutions obtained by our algorithm (CMM) in case of A = 1 and N = 1,2, 3.

Concluding remarks

In this paper, a novel matrix algorithm for obtaining numerical spectral solutions for second-order boundary value problems is presented and analyzed. The derivation of this algorithm is essentially based on choosing a set of basis functions satisfying the boundary conditions of the given boundary value problem in terms of shifted Legendre polynomials. The two spectral methods, namely, Petrov-Galerkin and collocation methods, are used for handling linear second-order and nonlinear second-order boundary value problems, respectively. One of the main advantages of the presented algorithms is their availability for application on both linear and nonlinear second-order boundary value problems including some important singular perturbed equations and also a Bratu-type equation. Another advantage of the developed algorithms is that high accurate approximate solutions are achieved by using

Table 8 Comparis°n telwera Present error Error in [28] Error in [29] Error in [30] Error in [31] the best errors for Example 5 for _

k = 1 2.98 x 10—16 1.02 x 10—6 8.89 x 10—6 1.35 x 10—5 3.01 x 10—3

Fig. 2 Different solutions of Example 5

0.150 0.100 0.070 0.050

0.020 0.015

Exact N=1 N=2 N=3

a few number of terms of the suggested expansion. The obtained numerical results are comparing favorably with the analytical ones. We do believe that the proposed algorithms in this article can be extended to treat other types of problems including some two-dimensional problems.

Acknowledgments The author would like to thank the referee for carefully reading the paper and for his useful comments which have improved the paper.

Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://cre-ativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

References

1. Canuto, C., Hussaini, M.Y., Quarteroni, A., Zang, T.A.: Spectral methods in fluid dynamics. Springer, New York (1988)

2. Fornberg, B.: A practical guide to pseudospectral methods. Cambridge University Press, Cambridge (1998)

3. Peyret, R.: Spectral methods for incompressible viscous flow. Springer, New York (2002)

4. Trefethen, L.N.: Spectral methods in MATLAB. SIAM, Philadelphia (2000)

5. Gottlieb, D., Hesthaven, J.S.: Spectral methods for hyperbolic problems. Comp. Appl. Math. 128, 83-131 (2001)

6. Bhrawy, A.H.: An efficient Jacobi pseudospectral approximation for nonlinear complex generalized Zakharov system. Appl. Math. Comp. 247, 30-46 (2014)

7. Guo B.-Y., Yan J.-P.: Legendre-Gauss collocation method for initial value problems of second order ordinary differential equations. Appl. Numer. Math. 59, 1386-1408 (2009)

8. Bhrawy, A.H., Zaky, M.A.: A method based on the Jacobi tau approximation for solving multi-term timespace fractional partial differential equations. J. Comp. Phys. 281, 876-895 (2015)

9. Doha, E.H., Abd-Elhameed, W.M.: Effcient spectral ultraspher-ical-dual-PetrovGalerkin algorithms for the direct solution of (2n+1)th-order linear differential equations. Math. Comput. Simulat. 79, 3221-3242 (2009)

10. Doha, E.H., Abd-Elhameed, W.M., Youssri, Y.H.: Efficient spectral-Petrov-Galerkin methods for the integrated forms of third- and fifth-order elliptic differential equations using general parameters generalized Jacobi polynomials. Appl. Math. Comput. 218, 7727-7740 (2012)

11. Doha, E.H., Abd-Elhameed, W.M., Youssri, Y.H.: Efficient spectral-Petrov-Galerkin methods for third- and fifth-order differential equations using general parameters generalized Jacobi polynomials. Quaest. Math. 36, 15-38 (2013)

12. Doha, E.H., Abd-Elhameed, W.M., Bhrawy, A.H.: New spectral-Galerkin algorithms for direct solution of high even-order differential equations using symmetric generalized Jacobi polynomials. Collect. Math. 64(3), 373-394 (2013)

13. Abd-Elhameed W. M.: Some algorithms for solving third-order boundary value problems using novel operational matrices of generalized Jacobi polynomials. Abs. Appl. Anal., vol 2015, Article ID 672703, p. 10

14. Yu, C.C., Heinrich, J.C.: Petrov-Galerkin methods for the time dependent convective transport equation. Int. J. Num. Mech. Eng. 23, 883-901 (1986)

15. Doha, E.H., Abd-Elhameed, W.M.: Efficient spectral-Galerkin algorithms for direct solution of second-order equations using ultraspherical polynomials. SIAM J. Sci. Comput. 24, 548-571 (2006)

16. Doha, E.H., Abd-Elhameed, W.M., Bassuony, M.A.: New algorithms for solving high even-order differential equations using third and fourth Chebyshev-Galerkin methods. J. Comput. Phys. 236, 563-579 (2013)

17. Abd-Elhameed, W.M.: On solving linear and nonlinear sixth-order two point boundary value problems via an elegant harmonic numbers operational matrix of derivatives. CMES Comp. Model. Eng. Sci. 101(3), 159-185 (2014)

18. Doha, E.H., Abd-Elhameed, W.M., Bhrawy, A.H.: Efficient spectral ultraspherical-Galerkin algorithms for the direct solution

of 2nth-order linear differential equations. Appl. Math. Model. 33, 1982-1996 (2009)

19. Bratu, G.: Sur les quations intgrales non linaires. Bull. Soc. Math. France 43, 113-142 (1914)

20. Gelfand, I.M.: Some problems in the theory of quasi-linear equations. Trans. Amer. Math. Soc. Ser. 2, 295-381 (1963)

21. Aregbesola, Y.A.S.: Numerical solution of Bratu problem using the method of weighted residual. Electron. J. South. Afr. Math. Sci. 3, 1-7 (2003)

22. Hassan, I., Erturk, V.: Applying differential transformation method to the one-dimensional planar Bratu problem. Int. J. Contemp. Math. Sci. 2, 1493-1504 (2007)

23. He, J.H.: Some asymptotic methods for strongly nonlinear equations. Int. J. Mod. Phys. B 20, 1141-1199 (2006)

24. Li, S., Liao, S.: An analytic approach to solve multiple solutions of a strongly nonlinear problem. Appl. Math. Comput. 169, 854-865 (2005)

25. Mounim, A., de Dormale, B.: From the fitting techniques to accurate schemes for the Liouville-Bratu-Gelfand problem. Numer. Meth. Part. Diff. Eq. 22, 761-775 (2006)

26. Syam, M., Hamdan, A.: An efficient method for solving Bratu equations. Appl. Math. Comput. 176, 704-713 (2006)

27. Wazwaz, A.M.: Adomian decomposition method for a reliable treatment of the Bratu-type equations. Appl. Math. Comput. 166, 652-663 (2005)

28. Abbasbandy, S., Hashemi M.S., Liu C.-S.: The Lie-group shooting method for solving the Bratu equation. Appl. Math. Comput. 16, 4238-4249 (2011)

29. Caglar, H., Caglar, N., Ozer M., Valaristos A., Anagnostopoulos A.N.: B-spline method for solving Bratu's problem. Int. J. Comput. Math. 87(8), 1885-1891 (2010)

30. Khuri, S.A.: A new approach to Bratu's problem. Appl. Math. Comput. 147, 131-136 (2004)

31. Deeba, E., Khuri, S.A., Xie, S.: An algorithm for solving boundary value problems. J. Comput. Phys. 159, 125-138 (2000)

32. Boyd, P.J.: One-point pseudospectral collocation for the one-dimensional Bratu equation. Appl. Math. Comput. 217, 5553-5565 (2011)

33. Adams, R.A., Fournier, J.F.: Sobolev spaces, pure and applied mathematics series. Academic Press, New York (2003)

34. Mohsen, A., El-Gamel, M.: On the Galerkin and collocation methods for two-point boundary value problems using sinc bases. Comput. Math. Appl. 56, 930-941 (2008)

35. Natesan, S., Ramanujam, N.: Shooting method for the solution of singularly perturbed two-point boundary-value problems having less severe boundary layer. Appl. Math. Comput. 133, 623-641 (2002)

Fourth Order Legendre Polynomial Solution Using Matrices

Source: https://cyberleninka.org/article/n/1004341

Share this post