Second Kind Shifted Chebyshev Polynomials for Solving the Model Nonlinear ODEs
Abstract: In this paper, we build the integral collocation method by using the second shifted Chebyshev polynomials. The numerical method solving the model non-linear such as Riccati differential equation, Logistic differential equation and Multi-order ODEs. The properties of shifted Chebyshev polynomials of the second kind are presented. The finite difference method is used to solve this system of equations. Several numerical examples are provided to confirm the reliability and effectiveness of the proposed method.

1. Introduction

In recent years, Chebyshev polynomials (family of orthogonal polynomials on the interval [−1, 1]) have become increasingly important in numerical analysis, from both theoretical and practical points of view. They have strong links with Fourier and Laurent series, with minimality properties in approximation theory and with discrete and continuous orthogonality in function spaces  . These links have led to important applications, especially in spectral methods for ordinary and partial differential equations. There are four kinds of Chebyshev polynomials as in  . The majority of books dealing with Chebyshev polynomials, contain mainly results of Chebyshev polynomials of all kinds ${T}_{n}\left(x\right),{U}_{n}\left(x\right),{V}_{n}\left(x\right)$ and ${W}_{n}\left(x\right)$ and their numerous uses in different applications and research papers dealing with some types of these polynomials (  -  ) and other publications as (      ). However, there are only a limited researches of literature on shifted Chebyshev polynomials of the second kind ${U}_{n}^{\ast }\left(x\right)$ , either from theoretical or practical points of view it uses in various applications.

2. Some Properties of Chebyshev Polynomials of the Second Kind

2.1. Chebyshev Polynomials of the Second Kind (   )

The Chebyshev polynomials ${U}_{n}\left(x\right)$ of the second kind  are orthogonal polynomials of degree n in x defined on the [−1, 1]

${U}_{n}\left(x\right)=\frac{\mathrm{sin}\left(n+1\right)\theta }{\mathrm{sin}\theta }$

where $x=\mathrm{cos}\theta$ and $\theta \in \left[0,\text{π}\right]$ . The polynomials ${U}_{n}\left(x\right)$ are orthogonal on $\left[-1,1\right]$ with respect to the inner products

$\left({U}_{n}\left(x\right),{U}_{m}\left(x\right)\right)={\int }_{-1}^{1}\sqrt{1-{x}^{2}}{U}_{n}\left(x\right){U}_{m}\left(x\right)\text{d}x=\left\{\begin{array}{l}0,\text{ }n\ne m\\ \frac{\text{π}}{2},\text{ }n=m\end{array}$ (1)

where $\sqrt{1-{x}^{2}}$ is weight function.

${U}_{n}\left(x\right)$ may be generated by using the recurrence relations

${U}_{n}\left(x\right)=2x{U}_{n-1}\left(x\right)-{U}_{n-2}\left(x\right),\text{\hspace{0.17em}}\text{\hspace{0.17em}}n=2,3,\cdots$

with ${U}_{0}\left(x\right)=1$ , ${U}_{1}\left(x\right)=2x$ .

The analytical form of the Chebyshev polynomials of the second kind ${U}_{n}\left(x\right)$ of degree n is given by:

${U}_{n}\left(x\right)=\underset{i=0}{\overset{⌈\frac{\text{π}}{2}⌉}{\sum }}{\left(-1\right)}^{i}\left(\begin{array}{c}n-i\\ i\end{array}\right){\left(2x\right)}^{n-2i}=\underset{i=0}{\overset{⌈\frac{\text{π}}{2}⌉}{\sum }}{\left(-1\right)}^{i}{2}^{n-2i}\frac{\Gamma \left(n-i+1\right){x}^{n-2i}}{\Gamma \left(i+1\right)\Gamma \left(n-2i+1\right)},\text{\hspace{0.17em}}n>0.$ (2)

where $⌈\frac{\text{π}}{2}⌉$ denotes the integral part of $n/2$ .

2.2. Shifted Chebyshev Polynomials of the Second Kind (   )

In order to use these polynomials in Section 2.1 on the interval $x\in \left[0,1\right]$ we define the so called shifted Chebyshev polynomials of the second kind ${U}_{n}^{\ast }\left(x\right)$ by introducing the change variable $z=2x-1$ . This means that the shifted Chebyshev polynomials of the second kind defined as (   ):

${U}_{n}^{\ast }\left(x\right)={U}_{n}\left(2x-1\right)$

also there are important relation between the shifted and second kind Chebyshev polynomials as follows:

$2x{U}_{n-1}^{\ast }\left({x}^{2}\right)={U}_{2n-1}\left(x\right),$

these polynomials are orthogonal on the support interval $\left[0,1\right]$ as the following inner product:

$\left({U}_{n}^{\ast }\left(x\right),{U}_{m}^{\ast }\left(x\right)\right)={\int }_{0}^{1}\sqrt{x-{x}^{2}}{U}_{n}^{\ast }\left(x\right){U}_{m}^{\ast }\left(x\right)\text{d}x=\left\{\begin{array}{l}0,\text{\hspace{0.17em}}\text{ }n\ne m,\\ \frac{\text{π}}{8},\text{ }n=m,\end{array}$ (3)

where $\sqrt{x-{x}^{2}}$ is weight function.

${U}_{n}^{\ast }\left(x\right)$ may be generated by using the recurrence relations

${U}_{n}^{\ast }\left(x\right)=2\left(2x-1\right){U}_{n-1}^{\ast }\left(x\right)-{U}_{n-2}^{\ast }\left(x\right),\text{\hspace{0.17em}}n=2,3,\cdots$

with start values ${U}_{0}^{\ast }\left(x\right)=1$ , ${U}_{0}^{\ast }\left(x\right)=4x-2$ .

The analytical form of the shifted Chebyshev polynomials of the second kind ${U}_{n}^{\ast }\left(x\right)$ of degree $n$ is given by

${U}_{n}^{\ast }\left(x\right)=\underset{i=0}{\overset{n}{\sum }}{\left(-1\right)}^{i}{2}^{2n-2i}\frac{\Gamma \left(2n-i+2\right){x}^{n-i}}{\Gamma \left(i+1\right)\Gamma \left(2n-2i+2\right)},\text{\hspace{0.17em}}n>0,$ (4)

The function which may be appear in solution of the model problem can be written as series of ${U}^{\ast }\left(x\right)$ .

Let $g\left(x\right)$ be a square integrable in $\left[0,1\right]$ it can be expressed in terms of the shifted Chebyshev polynomials of the second kind as follows:

$g\left(x\right)=\underset{i=0}{\overset{\infty }{\sum }}\text{ }{a}_{i}{U}_{i}^{\ast }\left(x\right),$ (5)

where the coefficients ${a}_{i},i=0,1,\cdots$ are given by:

${a}_{i}=\frac{2}{\text{π}}{\int }_{-1}^{1}\text{ }g\left(\frac{x+1}{2}\right)\sqrt{1-{x}^{2}}{U}_{i}\left(x\right)\text{d}x,$ (6)

or

${a}_{i}=\frac{8}{\pi }{\int }_{0}^{1}\text{ }\text{ }g\left(x\right)\sqrt{x-{x}^{2}}{U}_{i}^{\ast }\left(x\right)\text{d}x,$ (7)

In practice, only the first $\left(m+1\right)$ terms of shifted Chebyshev polynomials of the second kind are considered in the approximate case. Then we have:

${g}_{m}\left(x\right)=\underset{i=0}{\overset{m}{\sum }}\text{ }\text{ }{a}_{i}{U}_{i}^{\ast }\left(x\right),$ (8)

Using the parctice shifted Chebyshev polynomials of the second kind to constraction the integral collocation method to give the N-th derivative of the unknown function $u\left(x\right)$ as the following  :

$\frac{{\text{d}}^{k}u\left(x\right)}{\text{d}{x}^{k}}\approxeq \underset{n=0}{\overset{m}{\sum }}\text{ }\text{ }{a}_{n}{U}_{n}^{\ast }\left(x\right)=\underset{n=0}{\overset{m}{\sum }}\text{ }\text{ }{a}_{n}{w}_{n}^{k}\left(x\right).$ (9)

Using the integration we can obtain the lower-order derivatives and the function itself as follows

$\frac{{\text{d}}^{k-1}u\left(x\right)}{\text{d}{x}^{n-1}}\approxeq \underset{n=0}{\overset{m}{\sum }}\text{ }\text{ }{a}_{n}{w}_{n}^{k-1}\left(x\right)+{c}_{1}$ (10)

$\frac{{\text{d}}^{k-2}u\left(x\right)}{\text{d}{x}^{n-2}}\approxeq \underset{n=0}{\overset{m}{\sum }}\text{ }\text{ }{a}_{n}{w}_{n}^{\left(k-2\right)}\left(x\right)+{c}_{1}x+{c}_{2},\cdots$ (11)

$\frac{\text{d}u\left(x\right)}{\text{d}x}\approxeq \underset{n=0}{\overset{m}{\sum }}\text{ }{a}_{n}{w}_{n}^{\left(1\right)}\left(x\right)+{c}_{1}\frac{{x}^{k-2}}{\left(k-2\right)!}+{c}_{2}\frac{{x}^{k-3}}{\left(k-3\right)!}+\cdots +{c}_{k-2}x+{c}_{k-1},$ (12)

$u\left(x\right)=\underset{n=0}{\overset{m}{\sum }}\text{ }\text{ }{a}_{n}{w}_{n}^{\left(0\right)}\left(x\right)+{c}_{1}\frac{{x}^{k-1}}{\left(k-1\right)!}+{c}_{2}\frac{{x}^{k-2}}{\left(k-2\right)!}+\cdots +{c}_{k-1}x+{c}_{k},$ (13)

from (4) and (9) we have

${w}_{n}^{\left(k\right)}\left(x\right)=\underset{i=0}{\overset{n}{\sum }}{\left(-1\right)}^{i}{2}^{2n-2i}\frac{\Gamma \left(2n-i+2\right){x}^{n-i}}{\Gamma \left(i+1\right)\Gamma \left(2n-2i+2\right)},$ (14)

${w}_{n}^{\left(k-1\right)}\left(x\right)=\int {w}_{n}^{\left(k\right)}\left(x\right)\text{d}x=\underset{i=0}{\overset{n}{\sum }}{\left(-1\right)}^{i}{2}^{2n-2i}\frac{\Gamma \left(2n-i+2\right){x}^{n-i+1}}{\Gamma \left(i+1\right)\Gamma \left(2n-2i+2\right)\left(n-i+1\right)}$ ,

${w}_{n}^{\left(k-2\right)}\left(x\right)=\int {w}_{n}^{\left(k-1\right)}\left(x\right)\text{d}x=\underset{i=0}{\overset{n}{\sum }}{\left(-1\right)}^{i}{2}^{2n-2i}\frac{\Gamma \left(2n-i+2\right){x}^{n-i+2}}{\Gamma \left(i+1\right)\Gamma \left(2n-2i+2\right)\left(n-i+1\right)\left(n-i+2\right)}$ ,

$\cdots$

${w}_{n}^{\left(0\right)}\left(x\right)=\int {w}_{n}^{\left(1\right)}\left(x\right)\text{d}x=\underset{i=0}{\overset{n}{\sum }}{\left(-1\right)}^{i}{2}^{2n-2i}\frac{\Gamma \left(2n-i+2\right){x}^{i+k}}{\Gamma \left(i+1\right)\Gamma \left(2n-2i+2\right)\cdots \left(i+k-1\right)\left(i+k\right)}$ .

We now collocate Equatuions (10)-(14) at $\left(m+1\right)$ points ${x}_{p},p=0,1,\cdots ,m$ as

$\frac{{\text{d}}^{k}u\left({x}_{p}\right)}{\text{d}{x}^{k}}={\Omega }^{\left(k\right)}\stackrel{^}{E},\text{\hspace{0.17em}}\frac{{\text{d}}^{k-1}u\left({x}_{p}\right)}{\text{d}{x}^{k-1}}={\Omega }^{\left(k-1\right)}\stackrel{^}{E},\cdots ,$ (15)

$\frac{\text{d}u\left({x}_{p}\right)}{\text{d}x}={\Omega }^{\left(1\right)}\stackrel{^}{E},\text{\hspace{0.17em}}u\left({x}_{p}\right)={\Omega }^{\left(0\right)}\stackrel{^}{E},$

where $\stackrel{^}{E}={\left[{a}_{0},{a}_{1},\cdots ,{a}_{m},{c}_{1},{c}_{2},\cdots ,{c}_{n}\right]}^{\text{T}}$ , and ${\Omega }^{\left(k\right)},{\Omega }^{\left(k-1\right)},\cdots ,{\Omega }^{\left(0\right)}$ are integrated matrices.

3. Integral Collocation Method for Solving Riccati, Logistic and Multi-Order Nonlinear ODEs 

In this section, we introduce the integral collocation method using shifted Chebyshev polynomials of the second kind for solving the Riccati, Logistic and multi-order nonlinear ODEs.

3.1. Model 1: Riccati Differential Equation 

$\frac{\text{d}u\left(x\right)}{\text{d}x}+{u}^{2}\left(x\right)-1=0,\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}x\ge 0,$ (16)

we also assume an initial condition

$u\left(x\right)={u}^{0}.$ (17)

The exact solution to this problem at ${u}^{0}=0$ is

$u\left(x\right)=\frac{{\text{e}}^{2x}-1}{{\text{e}}^{2x}+1}.$

The procedure of the implementation is given by the following steps:

1) Approximate the function $u\left(x\right)$ using formula (9)-(14) with $m=5$ , as follows

$\frac{\text{d}u\left(x\right)}{\text{d}x}\approxeq \underset{n=0}{\overset{5}{\sum }}\text{ }\text{ }{a}_{n}{w}_{n}^{\left(1\right)}\left(x\right),$ (18)

$u\left(x\right)\approxeq \underset{n=0}{\overset{5}{\sum }}\text{ }\text{ }{a}_{n}{w}_{n}^{\left(0\right)}\left(x\right)+{c}_{1},$

where ${w}_{n}^{\left(0\right)}\left(x\right)$ is defined in (14) as

${w}_{n}^{\left(0\right)}\left(x\right)=\underset{i=0}{\overset{n}{\sum }}{\left(-1\right)}^{i}{2}^{2n-2i}\frac{\Gamma \left(2n-i+2\right){x}^{i+k}}{\Gamma \left(i+1\right)\Gamma \left(2n-2i+2\right)\cdots \left(i+k-1\right)\left(i+k\right)}$

${w}_{n}^{\left(1\right)}\left(x\right)=\underset{i=0}{\overset{n}{\sum }}{\left(-1\right)}^{i}{2}^{2n-2i}\frac{\Gamma \left(2n-i+2\right){x}^{n-i}}{\Gamma \left(i+1\right)\Gamma \left(2n-2i+2\right)},$

Then the Riccati differential Equation (16) is transformed to the following approximated form

$\underset{n=0}{\overset{5}{\sum }}\text{ }\text{ }{a}_{n}{U}_{n}^{\ast }\left(x\right)+{\left(\underset{n=0}{\overset{5}{\sum }}\text{ }{a}_{n}{w}_{n}^{\left(0\right)}\left(x\right)+{c}_{1}\right)}^{2}=1$ (19)

We now collocate Equation (19) at $\left(m+1=6\right)$ points ${x}_{p},p=0,1,2,3,4,5$ as

$\underset{n=0}{\overset{5}{\sum }}\text{ }\text{ }{a}_{n}{U}_{n}^{\ast }\left({x}_{p}\right)+{\left(\underset{n=0}{\overset{5}{\sum }}\text{ }{a}_{n}{w}_{n}^{\left(0\right)}\left({x}_{p}\right)+{c}_{1}\right)}^{2}=1$ (20)

For suitable collocation points we use the roots of shifted Chebyshev polynomial ${U}_{6}^{\ast }\left(x\right)$ .

2) Also, by substituting from the initial condition (17) in (18) we can obtain $\left(n=1\right)$ an equation which gives the value of the constant ${c}_{1}$ as follows

${c}_{1}={u}^{0}=0.$ (21)

Equations (20) and (21) represent a system of non-linear algebraic equations which contains seven equations for the unknowns ${a}_{n},n=0,1,2,3,4,5$ and ${c}_{1}$ .

3) Solve the resulting system using the Newton iteration method to obtain the unknowns ${a}_{i},i=0,1,2,3,4,5$ as follows

${a}_{0}=0.76160,\text{\hspace{0.17em}}\text{\hspace{0.17em}}{a}_{1}=-0.31790,\text{\hspace{0.17em}}\text{\hspace{0.17em}}{a}_{2}=-0.0506,$

${a}_{3}=0.02896,\text{\hspace{0.17em}}\text{\hspace{0.17em}}{a}_{4}=-0.00111,\text{\hspace{0.17em}}\text{\hspace{0.17em}}{a}_{5}=-0.00112,$

Therefore, from Formula (19) we can obtain the approximate solution in the form

$u\left(x\right)\approxeq \underset{n=0}{\overset{5}{\sum }}\text{ }{a}_{n}{w}_{n}^{\left(0\right)}\left(x\right)+{c}_{1}$

$u\left(x\right)=0.990x+0.002{x}^{2}-0.346{x}^{3}+0.027{x}^{4}+0.125{x}^{5}-0.047{x}^{6}.$

The numerical results of the proposed problem (16) are given in Figure 1 with $m=5$ in the interval $\left[0,1\right]$ at ${u}^{0}=0$ .

From this Figure 1, since the obtained numerical solutions are in excellent agreement with the exact solution, so, we can conclude that the proposed technique is well for solving such class of ODEs.

3.2. Model 2: Logistic Differential Equation 

$\frac{\text{d}u\left(x\right)}{\text{d}x}=\rho u\left(x\right)\left(1-u\left(x\right)\right),\text{\hspace{0.17em}}x>0,\rho >0.$ (22)

Figure 1. The behavior of the approximate solution and exact solution with m = 5.

We also assume an initial condition

$u\left(0\right)={u}_{0}=0.85,\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}{u}_{0}>0.$ (23)

The exact solution to this problem is given by

$u\left(x\right)=\frac{{u}_{0}}{\left(1-{u}_{0}\right){\text{e}}^{-\rho x}+{u}_{0}}.$

The procedure of the implementation is given by the following steps:

1) Approximate the function $u\left(x\right)$ using formula (9)-(14) with $m=5$

Then the Logistic differential Equation (22) is transformed to the following approximated form

$\underset{n=0}{\overset{5}{\sum }}\text{ }{a}_{n}{U}_{n}^{\ast }\left(x\right)-\rho \left(\underset{n=0}{\overset{5}{\sum }}\text{ }{a}_{n}{w}_{n}^{\left(0\right)}\left(x\right)+{c}_{1}\right)\left(1-\left(\underset{n=0}{\overset{5}{\sum }}\text{ }{a}_{n}{w}_{n}^{\left(0\right)}\left(x\right)+{c}_{1}\right)\right)=0.$ (24)

We now collocate Equation (24) at $\left(m+1=6\right)$ points ${x}_{p},p=0,1,2,3,4,5$ as

$\underset{n=0}{\overset{5}{\sum }}{a}_{n}{U}_{n}^{\ast }\left({x}_{p}\right)-\rho \left(\underset{n=0}{\overset{5}{\sum }}{a}_{n}{w}_{n}^{\left(0\right)}\left({x}_{p}\right)+{c}_{1}\right)\left(1-\left(\underset{n=0}{\overset{5}{\sum }}{a}_{n}{w}_{n}^{\left(0\right)}\left({x}_{p}\right)+{c}_{1}\right)\right)=0.$ (25)

For suitable collocation points we use roots of shifted Chebyshev polynomial ${U}_{6}^{\ast }\left(x\right)$

${x}_{0}=0.96623,\text{\hspace{0.17em}}\text{\hspace{0.17em}}{x}_{1}=0.03377,$

${x}_{2}=0.38069,\text{\hspace{0.17em}}\text{\hspace{0.17em}}{x}_{3}=0.61930,$

${x}_{4}=0.16931,\text{\hspace{0.17em}}\text{\hspace{0.17em}}{x}_{5}=0.83060,$

2) Also, by substituting from the initial condition (23) in (18) with ${u}_{0}=0.85$ we can obtain $\left(k=1\right)$ an equation which gives the value of the constant ${c}_{1}=0.85$ .

Equation (25) represents a system of non-linear algebraic equations which contains six equations for the unknowns ${a}_{n},n=0,1,2,3,4,5$ .

3) Solve the resulting system using the Newton iteration method to obtain the unknowns ${a}_{n},n=0,1,2,3,4,5$ as follows

$\begin{array}{l}{a}_{0}=0.0533,\text{\hspace{0.17em}}\text{\hspace{0.17em}}{a}_{1}=0.0101,\\ {a}_{2}=0.0004,\text{\hspace{0.17em}}\text{\hspace{0.17em}}{a}_{3}=0.00002,\\ {a}_{4}=-1.642×{10}^{-6},\text{ }{a}_{5}=5.398×{10}^{-8}.\end{array}$ (26)

Therefore, from Formula (18) we can obtain the approximate solution in the form

$u\left(x\right)\approxeq \underset{n=0}{\overset{5}{\sum }}{a}_{n}{w}_{n}^{\left(0\right)}\left(x\right)+{c}_{1}$

$\begin{array}{c}u\left(x\right)=1+x+0.5{x}^{2}+0.1667{x}^{3}+0.0417{x}^{4}+0.0083{x}^{5}\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}+0.0014{x}^{6}+0.0002{x}^{7}+0.00004{x}^{8}\end{array}$

The numerical results of the proposed problem (22) is given in Figure 2 with $m=5$ in he interval [0, 1].

From this Figure 2, since the obtained numerical solutions are in excellent agreement with the exact solution, so, we can conclude that the proposed technique is well for solving such class of ODEs.

Figure 2. The behavior of the approximate solution and exact solution with m = 5.

3.3. Model Multi-Order Nonlinear ODEs (   )

Consider the following initial value problem (   )

$2{D}^{3}y\left(x\right)+{y}^{2}\left(x\right)={x}^{4}$ (27)

the initial conditions are:

$y\left(0\right)={y}^{\prime }\left(0\right)=0,\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}{y}^{″}\left(0\right)=2$ (28)

1) Approximate the function $y\left(x\right)$ and its relevant derivatives with $k=3$

$\frac{{\text{d}}^{3}y\left(x\right)}{\text{d}{x}^{3}}\approxeq \underset{n=0}{\overset{3}{\sum }}{a}_{k}{p}_{k}\left(x\right)=\underset{n=0}{\overset{3}{\sum }}{a}_{n}{w}_{n}^{\left(3\right)}\left(x\right)$ (29)

$\frac{{\text{d}}^{2}y\left(x\right)}{\text{d}{x}^{2}}\approxeq \underset{n=0}{\overset{3}{\sum }}{a}_{n}{w}_{n}^{\left(2\right)}\left(x\right)+{c}_{1}$

$\frac{\text{d}y\left(x\right)}{\text{d}x}\approxeq \underset{n=0}{\overset{3}{\sum }}{a}_{n}{w}_{n}^{\left(1\right)}\left(x\right)+x{c}_{1}+{c}_{2}.$

$y\left(x\right)\approxeq \underset{n=0}{\overset{3}{\sum }}{a}_{n}{w}_{n}^{\left(0\right)}\left(x\right)+\frac{{x}^{2}}{2}{c}_{1}+x{c}_{2}+{c}_{3}.$

where ${w}_{n}^{\left(0\right)}\left(x\right),{w}_{n}^{\left(1\right)}\left(x\right)$ and ${w}_{n}^{\left(2\right)}\left(x\right)$ are defined as follows

${w}_{n}^{\left(0\right)}\left(x\right)=\underset{i=0}{\overset{n}{\sum }}{\left(-1\right)}^{i}{2}^{2n-2i}\frac{\Gamma \left(2n-i+2\right){x}^{n-i}}{\Gamma \left(i+1\right)\Gamma \left(2n-2i+2\right)}$

${w}_{n}^{\left(1\right)}\left(x\right)=\underset{i=0}{\overset{n}{\sum }}{\left(-1\right)}^{i}{2}^{2n-2i}\frac{\Gamma \left(2n-i+2\right){x}^{n-i+1}}{\Gamma \left(i+1\right)\Gamma \left(2n-2i+2\right)\left(n-i+1\right)},$

${w}_{n}^{\left(2\right)}\left(x\right)=\underset{i=0}{\overset{n}{\sum }}{\left(-1\right)}^{i}{2}^{2n-2i}\frac{\Gamma \left(2n-i+2\right){x}^{n-i+2}}{\Gamma \left(i+1\right)\Gamma \left(2n-2i+2\right)\left(n-i+1\right)\left(n-i+2\right)},$

Then the multi-order ODE (27) can be written in the following approximated form

$2\underset{n=0}{\overset{3}{\sum }}{a}_{k}{p}_{k}\left(x\right)+{\left(\underset{n=0}{\overset{3}{\sum }}{a}_{n}{w}_{n}^{\left(0\right)}\left(x\right)+\frac{{x}^{2}}{2}{c}_{1}+x{c}_{2}+{c}_{3}\right)}^{2}={x}^{4}$ (30)

We now collocate Equation (30) at $\left(k+1\right)$ points ${x}_{p},p=0,1,2,3$ as

$2\underset{n=0}{\overset{3}{\sum }}{a}_{k}{p}_{k}\left({x}_{p}\right)+{\left(\underset{n=0}{\overset{3}{\sum }}{a}_{n}{w}_{n}^{\left(0\right)}\left({x}_{p}\right)+\frac{{x}_{p}^{2}}{2}{c}_{1}+{x}_{p}{c}_{2}+{c}_{3}\right)}^{2}={x}_{p}^{4}$ (31)

For suitable collocation points we use roots of shifted Chebyshev polynomial ${p}_{4}\left(x\right)$

2) Also, by substituting from the initial conditions (28) in (29) we can obtain $k=3$ of equations which give the values of the constants ${c}_{1},{c}_{2}$ and ${c}_{3}$ .

${c}_{1}=2,\text{\hspace{0.17em}}{c}_{2}=0,\text{\hspace{0.17em}}{c}_{3}=0.$ (32)

The Equations (31) and (32) construct system of non-linear algebraic equations which contains seven equations for the unknowns ${a}_{n},n=0,1,2,3$ and ${c}_{i},i=1,2,3$

3) Solve the resulting system using the Newton iteration method to obtain the unknowns ${b}_{n},n=0,1,2,3$ .

Therefore, using the formula (29) we can find the required approximate solution in the following form:

$y\left(x\right)\approxeq \underset{n=0}{\overset{3}{\sum }}{a}_{n}{w}_{n}^{\left(0\right)}\left(x\right)+\frac{{x}^{2}}{2}{c}_{1}+x{c}_{2}+{c}_{3}={x}^{2}.$

which is the exact solution of the proposed problem (27).

The numerical results of the proposed problem (27) are given in Figure 3 with $m=5$ in the interval $\left[0,10\right]$ . From this Figure 3, since the obtained numerical solutions are in excellent agreement with the exact solution, so, we can conclude that the proposed technique is well for solving such class of ODEs.

4. Conclusion

In this paper, the Chebyshev polynomials of the second kind has been successfully applied to study the model nonlinear ODEs. The results show that Chebyshev polynomials of the second kind is an efficient and easy-to-use technique for finding exact and approximate solutions for nonlinear ordinary differential equations. The obtained approximate solutions using the suggested method is in excellent agreement with the exact solution and show that these approaches can be solved the problem effectively and illustrates the validity and the great potential of the proposed technique.

Figure 3. The behavior of the approximate solution with m = 5.

Acknowledgements

Thank you for the referees their efforts. The authors would like to thank Prof. Dr. Ahmed Ahmed Hassan, Department of Mathematics, Faculty of Science, Zagazig University, Zagazig, Egypt which provided support.

Cite this paper: Mahdy, A. , Mukhtar, N. (2017) Second Kind Shifted Chebyshev Polynomials for Solving the Model Nonlinear ODEs. American Journal of Computational Mathematics, 7, 391-401. doi: 10.4236/ajcm.2017.74028.
References

   Boyd, J.P. (2001) Chebyshev and Fourier Spectral Methods. 2nd Edition. Courier Corporation, Dover.

   Mason, J.C. and Handscomb, D.C. (2003) Chebyshev Polynomials. Chapman and Hall, Boca Raton.

   Azizi, H. and Loghmani, G.B. (2013) Numerical Approximation for Space Fractional Diffusion Equations via Chebyshev Finite Difference Method. Journal of Fractional Calculus and Applications, 4, 303-311.
http://fcag-egypt.com/Journals/JFCA/Vol4(2)_Papers/14_Vol.%204(2)%20July%202013,%20
No.%2014,%20pp.%20303-311..pdf

   Azizi, H. and Loghmani, G.B. (2014) A Numerical Method for Space Fractional Diffusion Equations Using a Semi-Discrete Scheme and Chebyshev Collocation Method. Journal of Mathematical and Computational Science, 8, 226-235.

   Moneim, I.A. and Mosa, G.A. (2006) Modelling the Hepatitis C with Different Types of Virus Genome. Computational and Mathematical Methods in Medicine, 7, 3-13.
https://www.hindawi.com/journals/cmmm/2006/318687/abs/
https://doi.org/10.1080/10273660600914121

   Meerschaert, M.M. and Tadjeran, C. (2004) Finite Difference Approximations for Fractional Advection-Dispersion Flow Equations. Journal of Computational and Applied Mathematics, 172, 65-77.
https://doi.org/10.1016/j.cam.2004.01.033

   Saadatmandi, A. and Dehghan, M.A. (2010) New Operational Matrix for Solving Fractional-Order Differential Equations. Computers & Mathematics with Applications, 59, 1326-1236.
https://doi.org/10.1016/j.camwa.2009.07.006

   Sweilam, N.H. and Khader, M.M.A. (2010) Chebyshev Pseudo-Spectral Method for Solving Fractional Order Integro-Differential Equations. The ANZIAM Journal, 51, 464-475.
https://doi.org/10.1017/S1446181110000830

   Bhrawy, A.H. and Alshomrani, M.A. (2012) SHIFTED LEGENDRE SPECTRAL METhod for Fractional-Order Multi-Point Boundary Value Problems. Advances in Difference Equations, 2012, 1-19.
https://pdfs.semanticscholar.org/c3bd/71d221c3e19871fa8ec3c79ae17faf06db42.pdf
https://doi.org/10.1186/1687-1847-2012-8

   Dehghan, M. and Saadatmandi, A. (2008) Chebyshev Finite Difference Method for Fredholm Integro-Differential Equation. International Journal of Computer Mathematics, 85, 123-130.
https://doi.org/10.1080/00207160701405436

   Elbarbary, E.M.M. (2003) Chebyshev Finite Difference Approximation for the Boundary Value Problems. Applied Mathematics and Computation, 139, 513-523.
https://doi.org/10.1016/S0096-3003(02)00214-X

   Kumar, P. and Agrawal, O.P. (2006) An Approximate Method for Numerical Solution of Fractional Differential Equations. Signal Processing, 86, 2602-2610.
https://doi.org/10.1016/j.sigpro.2006.02.007

   Rawashdeh, E.A. (2006) Numerical Solution of Fractional Integro-Differential Equations by Collocation Method. Applied Mathematics and Computation, 176, 1-6.
https://doi.org/10.1016/j.amc.2005.09.059

   Sweilam, N.H., Nagy, A.M. and Sayed, A.A. (2015) Second Kind Shifted Chebyshev Polynomials for Solving Space Fractional Order Diffusion Equation. Chaos, Solitons & Fractals, 73, 141-147.
https://doi.org/10.1016/j.chaos.2015.01.010

   Khader, M.M., Mahdy, A.M.S. and Shehata, M.M. (2014) An Integral Collocation Approach Based on Legender Polynomials for Solving Riccati, Logistic and Delay Differential Equations. Applied Mathematics, 5, 2360-2369.
https://doi.org/10.4236/am.2014.515228

   Abualnaja, K.M. and Khader, M.M. (2016) A Computational Solution of the Multi-Term Nonlinear ODEs with Variable Coefficients Using the Integral-Collocation-Approach Based on Legender Polynomials. Journal of Progressive Research in Mathematics, 9, 1406-1410.
http://scitecresearch.com/journals/index.php/jprm/article/view/857

   Sweilam, N.H., Kader, M.M. and ALBar, R.F., (2007) Numerical Studies for Multi-Order Fractional Differential Equation, Physics Letters A, 371, 26-33.
https://doi.org/10.1016/j.physleta.2007.06.016

Top