Solution of Electrohydrodynamic Flow Equation Using an Orthogonal Collocation Method Based on Mixed Interpolation

Show more

1. Introduction

The electrohydrodynamic flow (EHD flow) of a fluid in a “ion drag” configuration in a circular conduit (see Figure 1) is governed by a nonlinear second-order ordinary differential Equations ((1), (2))

$\frac{{\text{d}}^{2}w}{\text{d}{r}^{2}}+\frac{1}{r}\frac{dw}{\text{d}r}+{H}_{a}^{2}\left(1-\frac{w}{1-\alpha w}\right)=0,0<r<1,$ (1)

subject to the boundary conditions

${w}^{\prime}\left(0\right)=0,\mathrm{}w\left(1\right)=0.$ (2)

where $w\left(r\right)$ is the fluid velocity, r is the radial distance from the center of the cylindrical conduit, ${H}_{a}$ is the Hartmann electric number and the parameter α measures the strength of the non-linearity. It has been noted that the nonlinearity occurred in this problem is in the form of a rational function and thus, creates a significant challenge in regard to obtain analytical solutions.

Though, some analytic solutions are introduced by several researchers which are mentioned here. In 1997, Mckee et al. [1] developed regular perturbation solutions of EHD flow Equations ((1), (2)) in terms of the nonlinearity control parameter α governing a nonlinearity of the problem. Mckee and his coworkers used a Gauss-Newton finite-difference solver combined with the continuation method and Runge-Kutta shooting method to provide numerical results for the fluid velocity over a large range of values of α. This was done for both large and small values of α.

For $\alpha \ll 1$ , Mckee et al. [1] assumes the solution of the form $w\left(r\right)=w\left(r,\alpha \right)={\displaystyle {\sum}_{n=0}^{\infty}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}{\alpha}^{n}{w}_{n}\left(r;\alpha \right)$ and obtained the $O\left({\alpha}^{3}\right)$ perturbation solution as

$w\left(r\mathrm{,}\alpha \right)=1-\frac{{I}_{0}\left({H}_{r}\right)}{{I}_{0}\left(H\right)}\mathrm{.}$

Similarly, for $\alpha \gg 1$ , the authors in [1] proposed that the solution of BVP (1 - 2) could be expanded in the series of the form $w\left(r\right)={\displaystyle {\sum}_{n=0}^{\infty}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}{\alpha}^{n}{w}_{n}\left(r;\alpha \right)$ with $O\left(1\right)$ leading term. In 1999, Paullet [2] proved the following the existence and uniqueness of a solution of BVP of electrohydrodynamic flow.

For any $\alpha >0$ and any ${H}_{a}^{2}\ne 0$ $ a solution of BVP (1 - 2). Further this

Figure 1. “Ion-drag” flow in a circular cylindrical conduit.

solution is monotonically decreasing and satisfies $0<w\left(r\right)<\frac{1}{\alpha +1}$ $\forall r\in \left(0,1\right)$ .

Remark: Clearly the solution $w\left(r\right)$ of BVP (1 - 2) satisfies $w\left(r\right)<\frac{1}{\alpha}$ and $w\left(r\right)$ never equals $\frac{1}{\alpha}$ , otherwise the term $\frac{w\left(r\right)}{1-\alpha w\left(r\right)}$ creates the singularity.

Paullet [2] claimed an error in the perturbation solution and numerical solution given in [1] for the large value of α. This is obvious from the fact that for the large α, the solutions are of $O\left(\frac{1}{\alpha}\right)$ not of $O\left(1\right)$ as proposed in [1] . For

$\alpha \ll 1$ , our solution obtained by orthogonal collocation method based on mixed interpolation are in complete agreement with those of [1] and [2] but for $\alpha \gg 1$ , the proposed solution profiles are similar to those of [2] . The strong strength of our proposed method is its simplicity and high accuracy. Our results for large and small value of α are in good agreement with those of the solutions given in [3] [4] [5] . Recently Mastroberardino [3] presented the approximate solution by homotopy analysis method (HAM) for the nonlinear BVP of electrohydrodynamic flow Equations ((1), (2)) for $\alpha \in \left[\mathrm{0,1}\right]$ . In 2011, Pandey et al. [4] settle this differentiation and they showed that the solution profile for the large value of α is in good agreement with those of Paullet [2] . They solve EHD flow Equations ((1), (2)) using two semi-analytical algorithms based on optimal homotopy asymptotic method (OHAM) and optimal homotopy analysis method. They showed that HAM solutions are quite accurate especially for lower values of the parameters α and ${H}_{a}^{2}$ , but the accuracy decreases rather fast for higher values of these parameters. They found that for the large value of α, solution profile given by Paullet was correct and the solution profiles given in Mckee’s paper was quite different with those given in [4] . Khan et al. [5] introduced new homotopy perturbation method to solve EHD flow equation. Recently, Ghasemi et al. [6] introduced Least square method (LSM) to find the approximated solution of EHD flow equation.

The aim of the present article is to introduce a new weighted residual method based on collocation and mixed interpolation. There are several known weighted residual methods like collocation, Galerkin, Least square method etc. There are several important research contributions to the development of numerical techniques for solving ODE and PDE by different method based on the weighted residual method [7] .

Collocation method is widely used to solve various problems in science and engineering. Its usefulness is due to its simplicity and easy computations. Collocation method has found as one of the important methods to solve various integral and differential equations in science and engineering [8] . Some other developments in the area of collocation methods are given in [9] [10] [11] . In orthogonal collocation, zeros of some orthogonal polynomial are used as collocation (grid) points. Several important contributions in the field of development of orthogonal collocation are done by Carey and Finlayson [12] , Bhatia [13] , and Arora et al. [14] . In 1971, Peterson and Cresswell [15] was first who introduced orthogonal collocation in finite elements (OCFE) and his work were further extended by Carey and Finlayson (1975) [12] . Recently, Vaferi et al. [16] solved the diffusivity equation (arising in petroleum engineering) using orthogonal collocation method.

The idea of mixed interpolation was introduced by Mayer et al. (1990) [17] [18] . They replaced the existing Lagrange interpolation by mixed interpolation to find the numerical value of $\int}f\left(x\right)\text{d}x$ . Where, they approximated the integrand $f\left(x\right)$ by means of the interpolation formula of the form

$a\mathrm{}\mathrm{cos}\left(kx\right)+b\mathrm{}\mathrm{sin}\left(kx\right)+{\displaystyle \underset{i=0}{\overset{n-2}{\sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}{c}_{i}{x}^{i}.$

The present approach of mixed interpolation is inspired by the work of Meyer et al. (1990). Meyer et al. approximates a function $f\left(x\right)$ by a function ${f}_{n}\left(x\right)$ of the form $a\mathrm{}\mathrm{cos}\left(kx\right)+b\mathrm{}\mathrm{sin}\left(kx\right)+{\displaystyle {\sum}_{i=0}^{n-2}}\text{\hspace{0.05em}}{c}_{i}{x}^{i}$ such that $f\left(j\mathrm{,}h\right)={f}_{n}\left(j\mathrm{,}h\right)$ for $\left(n+1\right)$ equidistant points jh, $j=\mathrm{0,1,2,}\cdots ,n$ , h is stepsize. Several authors have formulated new quadrature rules and multi-step methods for ordinary differential equations on the basis of mixed interpolation [19] [20] [21] .

2. Orthogonal Collocation Method Using Mixed Interpolation Method

In this section, we propose a new type of weighted residual method called orthogonal collocation mixed interpolation method (OCMIM). It is an advancement over existing collocation method in a sense that we interpolate the unknown solution by means of a mixed interpolating function which is actually the mixed version of classical Lagrange polynomial and trigonometric functions. This advancement improves the accuracy of the method. Here, we are using one cosine factor $\mathrm{cos}\left(kx\right)$ and one sine factor $\mathrm{sin}\left(kx\right)$ in interpolating function. These functions can be taken as correction terms of the solution [17] .

The principle of orthogonal collocation method is to minimize the residual function (defect) $R\left(x\mathrm{,}{c}_{i}\right)$ and set equal to zero at preassigned collocation points (Zeros of some orthogonal polynomial). In this paper, we have considered the zeros of shifted Legendre polynomial as collocation points. The approximate solution is produced by means of the values it assumes in some locations, called collocation points, where the governing differential equation is satisfied. Such approach is called the collocation method.

2.1. Collocation Points

The important step in collocation technique is the choice of collocation points. It is the most important part of collocation technique as the wrong choice of collocation points may lead to divergent results. Preferably the zeros of the orthogonal polynomial are used as collocation points to keep the error minimum.

Jacobi polynomial of degree n, denoted as ${P}_{n}^{\left(\alpha \mathrm{,}\beta \right)}$ , forms a basis for the vector space of polynomials of degree at most n. Jacobi polynomial is defined on the interval [−1, 1] and can be determined with the aid of the following recurrence formulae:

$\begin{array}{l}2\left(n+1\right)\left(\alpha +\beta +n+1\right)\left(\alpha +\beta +2n\right){P}_{n+1}^{\left(\alpha +\beta \right)}\left(x\right)\\ =\left(\alpha +\beta +2n+1\right)\left[{\alpha}^{2}-{\beta}^{2}+x\left(\alpha +\beta +2n+2\right)\left(\alpha +\beta +2n\right)\right]{P}_{n}^{\alpha \mathrm{,}\beta}\left(x\right)\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.05em}}-2\left(\alpha +n\right)\left(\beta +n\right)\left(\alpha +\beta +2n+2\right){P}_{n-1}^{\left(\alpha \mathrm{,}\beta \right)}\left(x\right)\mathrm{,}\forall x\in \left[-\mathrm{1,1}\right]\end{array}$

${P}_{0}^{\left(\alpha \mathrm{,}\beta \right)}\left(x\right)=\mathrm{1,}$ (3)

${P}_{1}^{\left(\alpha \mathrm{,}\beta \right)}\left(x\right)=\frac{\left(\alpha +1\right)\left(\beta +1\right)\left(x+1\right)}{2}+\frac{x-2}{2}\mathrm{.}$

The interpolation points (‘n’ in number) are chosen to be the extreme values of an n^{th} order shifted Jacobi polynomial. For the interval [0, 1], the collocation points are obtained by mapping the computational domain of the interval [−1, 1] to [0, 1] with the help of the following relationship:

${\xi}_{j}=\frac{{x}_{j}+1}{2};\mathrm{}j=2,3,\cdots ,n-1,$

where, ${x}_{j}$ is the jth zero of ${P}_{n-2}^{\left(\alpha \mathrm{,}\beta \right)}\left(x\right)$ in the interval [−1, 1] with ${\xi}_{1}=0$ and ${\xi}_{n}=1$ .

For $\alpha =\beta =0$ , Jacobi becomes Legendre polynomial which is defined by

${P}_{n}\left(x\right)=\frac{1}{{2}^{n}n!}\frac{{\text{d}}^{n}}{\text{d}{x}^{n}}{\left({x}^{2}-1\right)}^{n}\mathrm{.}$

The first five zeros of shifted Legendre polynomial in the interval [0, 1] are given by

${x}_{1}=0.046910077030668$ , ${x}_{2}=0.23076534494715875$ , ${x}_{3}=0.5$ ,

${x}_{4}=0.7692346550528495$ , and ${x}_{5}=0.9530899229693268$ .

2.2. Description of the Method

Suppose a diffrential operator A is acted on a function u to produce a function f. i.e.

$A\left(u\left(x\right)\right)=f\left(x\right)\mathrm{.}$ (4)

It is considered that u is approximated by a function ${u}_{N}$ , which is a linear combination of basic functions chosen from a linearly dependent set. That is,

$u\cong {u}_{N}\left(x\right)=a\mathrm{}\mathrm{cos}\left(kx\right)+b\mathrm{}\mathrm{sin}\left(kx\right)+{\displaystyle \underset{i=0}{\overset{n-2}{\sum}}}\text{\hspace{0.05em}}{c}_{i}{x}^{i}.$ (5)

Consider a set of collocation (grid) points $\left\{{u}_{i}:i=1,2,\cdots ,n+1\right\}$ in the domain [0, 1] such that ${u}_{1}=0$ and ${u}_{n+1}=1$ and $\left\{{u}_{2}\mathrm{,}{u}_{3}\mathrm{,}\cdots \mathrm{,}{u}_{n}\right\}\in \left(\mathrm{0,1}\right)$ , such that ${u}_{1}=0<{u}_{2}<{u}_{3}<\cdots <{u}_{n+1}=1$ . In the present article, we have taken $\left\{{u}_{i}:i=2,3,4,\cdots ,n\right\}$ the interior collocation points as zero of shifted Legendre polynomial of order $\left(n-1\right)$ . Let $\left\{u\left({u}_{i}\right)={u}_{i}:i=1,2,\cdots ,n+1\right\}$ represent the values of dependent variable at these collocation points. Suppose the approximate solution ${u}_{N}\left({u}_{i}\right)$ given in (4) agrees with the exact one i.e. with $u\left({u}_{i}\right)$ i.e.

$u\left({u}_{i}\right)={u}_{i}={u}_{N}\left({u}_{i}\right);\mathrm{}i=1,2,\cdots ,n+1.$ (6)

So, we get a set of $\left(n+1\right)$ equations in unknown coefficients ${c}_{i}$ .

Solving Equation (5) with the combination of Equation (4), we get ${c}_{i}$ in terms of unknown numerical solutions $\left\{{u}_{i}:i=1,2,3,\cdots ,n+1\right\}$ .

$C={A}^{-1}U,$

where $C={\left[a\mathrm{,}b\mathrm{,}{c}_{0}\mathrm{,}{c}_{1}\mathrm{,}\cdots \mathrm{,}{c}_{n-2}\right]}^{\text{T}}$ and $U={\left[{u}_{1}\mathrm{,}{u}_{2}\mathrm{,}{u}_{2}\mathrm{,}\cdots \mathrm{,}{u}_{n+1}\right]}^{\text{T}}$ and A is a coefficient matrix whose rows are of the form $\left[\mathrm{cos}\left(k{u}_{i}\right),\mathrm{sin}\left(k{u}_{i}\right),1,{u}_{i},{u}_{i}^{2},\cdots ,{u}_{i}^{n-2}\right],i=1,2,3,\cdots ,n$ . Following the procedure of Mayer et al. (1989), we can prove A is non-singular and $\left|A\right|\ne 0$ as ${u}_{i}$ are distinct grid points in the domain. Thus, ${u}_{N}\left(x\right)$ in (4) can be rewritten as

${u}_{N}\left(x\right)={\displaystyle \underset{i=0}{\overset{n}{\sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}{u}_{i}{l}_{i}\left(x\right).$ (7)

When an approximate solution ${u}_{N}\left(x\right)$ given in (5) is substituted into the differential Equation (4), the result of the operations generally not equal to $f\left(x\right)$ . Hence, an error or residual will exist which is denoted and defined by

$R\left(x,{c}_{i}\right)\cong A\left({u}_{N}\right)-f=a\mathrm{cos}\left(kx\right)+b\mathrm{sin}\left(kx\right)+{\displaystyle \underset{i=0}{\overset{n-2}{\sum}}}\text{\hspace{0.05em}}{c}_{i}{x}^{i}-f\ne 0.$ (8)

Here, the residual $R\left(x\mathrm{,}{c}_{i}\right)$ is a function of position as well as of the parameters ${c}_{i}$ .

Combining (7) and (8), we have the residual error as:

$R\left(x\right)\equiv R\left(x,{u}_{i}\right)\cong A\left({\displaystyle \underset{i=0}{\overset{n}{\sum}}}\text{\hspace{0.05em}}{u}_{i}{l}_{i}\left(x\right)\right)-f.$ (9)

To find the ${u}_{i}$ from (8), we set $R\left(x\mathrm{,}{u}_{i}\right)=R\left(x\right)$ equal to zero at interior collocation points $\left\{{u}_{i}:i=2,3,4,\cdots ,n\right\}$ with combination of boundary conditions ${u}^{\prime}\left(0\right)=0$ and $u\left(1\right)=0$ . i.e. we solve the set of $\left(n+1\right)$ equations in ${u}_{i},i=0,1,2,\cdots ,n$ which are

${\int}_{0}^{1}}\text{\hspace{0.05em}}R\left(x\mathrm{,}{c}_{i}\right)\delta \left(x-{u}_{i}\right)\text{d}x=\mathrm{0,}i=\mathrm{2,3,4,}\cdots \mathrm{,}n\mathrm{,$ (10)

and

${u}^{\prime}\left(0\right)=1,\mathrm{}u\left(1\right)=0.$ (11)

where, Dirac delta function is defined by

$\delta \left(x-{u}_{i}\right)=0\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{when}\text{\hspace{0.17em}}x\ne {u}_{i}\mathrm{,}$

and

${\int}_{-\infty}^{\infty}}R\left(x\right)\delta \left(x-{u}_{i}\right)=R\left({u}_{i}\right)\mathrm{.$

Solving (10) and (11), we get the desired unknown numerical solutions ${u}_{i}$ which on substituting in (7) gives us the approximates solution ${u}_{N}\left(x\right)$ .

3. Error Estimate

In this section, we consider the convergence analysis and error bound of the orthogonal collocation method introduced in section 2 to compute the approximate solution of the EHD flow equation (Equations ((1), (2))).

We denote,

${e}_{n}\left(x\right)=y\left(x\right)-{\varphi}_{n}\left(x\right).$

To compute the error bound, we use the following results.

Theorem (3.1). (Weierstrass Approximation Theorem). Any Continous function defined on the closed and bounded interval [a,b] can be approximated uniformly by polynomials to any degree of accuracy on that interval. If $f\in C\left[a\mathrm{,}b\right]$ is approximated by a polynomial $p\left(x\right)$ of degree n then

$\left|f\left(x\right)-p\left(x\right)\right|\le \u03f5,\mathrm{}\forall x\in \left[a\mathrm{,}b\right]\mathrm{.}$

Theorem (3.2). If ${x}_{1}\mathrm{,}\cdots \mathrm{,}{x}_{n}$ are distinct n points defined on [0, 1] and $f\left(x\right)\in {C}^{n+1}\left[\mathrm{0,1}\right]$ is any function defined on [0, 1] then there exists a unique polynomial $L\left(x\right)$ of degree atmost n such that

$f\left({x}_{i}\right)=L\left({x}_{i}\right)\mathrm{;}i=\mathrm{1,2,}\cdots \mathrm{,}n\mathrm{,}$

where,

$L\left(x\right)={\displaystyle \underset{i=1}{\overset{n}{\sum}}}\text{\hspace{0.05em}}{l}_{i}\left(x\right){f}_{i}.$

Proof. Result is straightforward and proof is followed by use of theorem (3.1).

Theorem (3.3). ( [10] ). If
$y\left(x\right)\in {C}^{n+1}\left[\mathrm{0,1}\right]$ and
${x}_{i},i=0,1,2,\cdots ,n$ are the roots of (n + 1)^{th} degree shifted Legendre polynomial in
$\left[\mathrm{0,1}\right]$ . If
${\varphi}_{n}\left(x\right)$ is the interpolating polynomial to
$y\left(x\right)$ in
$\left[\mathrm{0,1}\right]$ such that
$y\left({x}_{i}\right)={\varphi}_{n}\left({x}_{i}\right),i=\mathrm{0,1,2,}\cdots \mathrm{,}n$ . Then,

$y\left(x\right)-{\varphi}_{n}\left(x\right)=\frac{{y}^{n+1}\left(\xi \right){\displaystyle \underset{i=0}{\overset{n}{\prod}}}\left(x-{x}_{i}\right)}{\left(n+1\right)!},0<\xi <1,$

and

$\left|y\left(x\right)-{\varphi}_{n}\left(x\right)\right|\le \frac{{M}_{n}}{{2}^{2n+1}\left(n+1\right)\mathrm{!}}$ (12)

where,

${M}_{n}=max\left\{\left|{y}^{n+1}\left(\xi \right)\right|\mathrm{:}\xi \in \left[\mathrm{0,1}\right]\right\}\mathrm{.}$

Proof: Let

$f\left(x\right)=y\left(x\right)-{\varphi}_{n}\left(x\right)-L{\displaystyle \underset{i=0}{\overset{n}{\prod}}}\left(x-{x}_{0}\right),$

where, L is constant such that $f\left(x\right)$ vanishes at some interior point ${x}^{\prime}$ in $\left[{x}_{0}\mathrm{,}{x}_{n}\right]$ , where ${x}_{0}=0<{x}_{1}<{x}_{2}<\cdots <{x}_{n}=1$ .

Under the assumption of the theorem (3.3), it is clear that $f\left(x\right)$ vanishes at $\left(n+2\right)$ values ${x}_{0}\mathrm{,}{x}_{1}\mathrm{,}\cdots \mathrm{,}{x}_{n}$ and ${x}^{\prime}$ . So, by repeated use of Rolle’s theorem, one can prove that,

$y\left(x\right)-{\varphi}_{n}\left(x\right)=\frac{{y}^{n+1}\left(\xi \right){\displaystyle \underset{i=0}{\overset{n}{\prod}}}\left(x-{x}_{i}\right)}{\left(n+1\right)!},0<\xi <1.$

So,

$\left|y\left(x\right)-{\varphi}_{n}\left(x\right)\right|\le \frac{{y}^{n+1}\left(\xi \right)\left|{\displaystyle \underset{i\mathrm{=0}}{\overset{n}{\prod}}}\left(x-{x}_{0}\right)\right|}{\left(n+1\right)\mathrm{!}}\mathrm{,}$

or,

$\left|y\left(x\right)-{\varphi}_{n}\left(x\right)\right|\le \frac{{M}_{n}}{{2}^{2n+1}\left(n+1\right)\mathrm{!}}\mathrm{.}$

Theorem (3.4). Suppose the solution of boundary value problem (1 - 2) is $\left(n+1\right)$ times continuously differential on [0, 1] and ${\varphi}_{n}\left(x\right)$ be the Lagrange polynomial approximation of $y\left(x\right)$ . If ${\psi}_{n}\left(x\right)$ is the approximate solution of BVP (1 - 2) based on mixed interpolation where ${\psi}_{n}\left(x\right)=a\mathrm{cos}\left(kx\right)+b\mathrm{sin}\left(kx\right)+{\displaystyle {\sum}_{i=0}^{n-2}}\text{\hspace{0.05em}}{c}_{i}{x}^{i}$ and ${M}_{n}=max\left\{\left|{y}^{n+1}\left(\xi \right)\right|\mathrm{:}\xi \in \left[\mathrm{0,1}\right]\right\}$ then $ two real numbers ${\alpha}_{n}$ and ${\beta}_{n}$ such that

${\Vert y\left(x\right)-{\psi}_{n}\left(x\right)\Vert}_{2}\le \frac{{M}_{n}}{{2}^{2n+1}\left(n+1\right)\mathrm{!}}+{\alpha}_{n}{\Vert C-\stackrel{\xaf}{C}\Vert}_{2}+{\beta}_{n}\mathrm{,}$

where, $C={\left({C}_{0}\mathrm{,}{C}_{1}\mathrm{,}{C}_{2}\mathrm{,}\cdots \mathrm{,}{C}_{n-2}\right)}^{\text{T}}$ and $\stackrel{\xaf}{C}={\left({\stackrel{\xaf}{C}}_{0}\mathrm{,}{\stackrel{\xaf}{C}}_{1}\mathrm{,}{\stackrel{\xaf}{C}}_{2}\mathrm{,}\cdots \mathrm{,}{\stackrel{\xaf}{C}}_{n-2}\right)}^{\text{T}}$ .

Proof: Consider,

$\Vert {e}_{n}\Vert ={\Vert y\left(x\right)-{\psi}_{n}\left(x\right)\Vert}_{2}\le {\Vert y\left(x\right)-{\varphi}_{n}\left(x\right)\Vert}_{2}+{\Vert {\varphi}_{n}\left(x\right)-{\psi}_{n}\left(x\right)\Vert}_{2}\mathrm{.}$ (13)

Using theorem (3.3) and Equation (12)

$\Vert y\left(x\right)-{\varphi}_{n}\left(x\right)\Vert \le \frac{{M}_{n}}{{2}^{2n+1}\left(n+1\right)\mathrm{!}}\mathrm{.}$ (14)

Again,

$\begin{array}{c}{\Vert {\varphi}_{n}\left(x\right)-{\psi}_{n}\left(x\right)\Vert}_{2}^{2}\le {\displaystyle \underset{i=0}{\overset{n-2}{\sum}}}{\left({\stackrel{\xaf}{C}}_{i}-{C}_{i}\right)}^{2}{\displaystyle {\int}_{0}^{1}}{\left({x}_{i}\right)}^{\text{2}}\text{d}x+{\stackrel{\xaf}{C}}_{n-1}^{2}{\displaystyle {\int}_{0}^{1}}{\left({x}^{n-1}\right)}^{2}\text{d}x+{C}_{n}^{2}{\displaystyle {\int}_{0}^{1}}{\left({x}^{n}\right)}^{2}\text{d}x\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}+{a}^{2}{\displaystyle {\int}_{0}^{1}}{\left(\mathrm{cos}kx\right)}^{2}\text{d}x+{b}^{2}{\displaystyle {\int}_{0}^{1}}{\left(\mathrm{sin}kx\right)}^{2}\text{d}x\\ \le {\alpha}_{n}{\displaystyle \underset{i=0}{\overset{n-2}{\sum}}}{\left({\stackrel{\xaf}{C}}_{i}-{C}_{i}\right)}^{2}+\frac{{C}_{n-1}^{2}}{2n-1}+\frac{{C}_{n}^{2}}{2n+1}+\frac{{a}^{2}+{b}^{2}}{4k}+\frac{\left({b}^{2}-{a}^{2}\right)\mathrm{sin}2k}{4k}\end{array}$

${\Vert {\varphi}_{n}\left(x\right)-{\psi}_{n}\left(x\right)\Vert}_{2}\le {\alpha}_{n}\Vert C-\stackrel{\xaf}{C}\Vert +\beta \mathrm{,}$

where,

${\alpha}_{n}={\displaystyle \underset{i=0}{\overset{n-2}{\sum}}}\frac{1}{2i+1}$

and

${\beta}_{n}=\frac{{C}_{n-1}^{2}}{2n-1}+\frac{{C}_{n}^{2}}{2n+1}+\frac{{a}^{2}+{b}^{2}}{4k}+\frac{\left({b}^{2}-{a}^{2}\right)\mathrm{sin}2k}{4k}.$

Remark: If $f\left(x\right)\in {L}^{2}\left[\mathrm{0,1}\right]$ be aprroximated by

${f}_{n}\left(x\right)=a\mathrm{cos}\left(kx\right)+b\mathrm{sin}\left(kx\right)+{\displaystyle \underset{i=0}{\overset{n-2}{\sum}}}\text{\hspace{0.05em}}{c}_{i}{x}^{i}.$ (15)

Then (7) can be rewritten as

${f}_{n}\left({x}_{i}\right)={\displaystyle \underset{i=0}{\overset{n}{\sum}}}\text{\hspace{0.05em}}f\left({x}_{i}\right){l}_{i}\left(x\right),$ (16)

where, ${l}_{i}\left(x\right)$ are called trial function and $f\left({x}_{i}\right)={f}_{i}$ are unknown numerical solution at node ${x}_{i}$ .

4. Numerical Experiment

Consider the EHD flow equation (Equations ((1), (2))). Using (5) the approximate solution of BVP (1 - 2) is

${u}_{N}\left(r\right)=a\mathrm{cos}\left(kr\right)+b\mathrm{sin}\left(kr\right)+{c}_{0}+{c}_{1}r+{c}_{2}{r}^{2}+{c}_{3}{r}^{3}+{c}_{4}{r}^{4},$ (17)

such that

${u}_{N}\left({u}_{i}\right)={u}_{i},i=0,1,\cdots ,6$ (18)

So, by Equation (7),

${u}_{N}\left(r\right)={\displaystyle \underset{i=0}{\overset{6}{\sum}}}\text{\hspace{0.05em}}{u}_{i}{l}_{i}\left(r\right),$ (19)

where ${l}_{i}\left(x\right)$ are base functions. Differentiating Equation (19) two times,

$\frac{\text{d}}{\text{d}r}{u}_{N}\left(r\right)={\displaystyle \underset{i=0}{\overset{6}{\sum}}}\text{\hspace{0.05em}}{u}_{i}{{l}^{\prime}}_{i}\left(r\right),$

$\frac{{\text{d}}^{2}{u}_{N}\left(r\right)}{\text{d}{r}^{2}}={\displaystyle \underset{i=0}{\overset{6}{\sum}}}\text{\hspace{0.05em}}{u}_{i}{{l}^{\u2033}}_{i}\left(r\right).$

So, in view of (1), the residual $R\left(r\right)$ (given in (9)) is:

$R\left(r\right)={\displaystyle \underset{i=0}{\overset{6}{\sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}{u}_{i}{{l}^{\u2033}}_{i}\left(r\right)+{\displaystyle \underset{i=0}{\overset{6}{\sum}}}\text{\hspace{0.05em}}\text{\hspace{0.05em}}{u}_{i}{{l}^{\prime}}_{i}\left(r\right)+{H}_{a}^{2}\left(1-\frac{{\displaystyle \underset{i=0}{\overset{6}{\sum}}}\text{\hspace{0.05em}}{u}_{i}{l}_{i}\left(r\right)}{1-\alpha {\displaystyle \underset{i=0}{\overset{6}{\sum}}}\text{\hspace{0.05em}}{u}_{i}{l}_{i}\left(r\right)}\right)=0,0<r<1.$

In light of (9) and (10), we have the following set of 7 equations

${\int}_{0}^{1}}\text{\hspace{0.05em}}R\left(r\right)\delta \left(x-{u}_{i}\right)\text{d}x=\mathrm{0;}i=\mathrm{0,1,2,}\cdots \mathrm{,6.$ (20)

For $\alpha =0.5$ , ${H}_{a}^{2}=0.5$ and $k=1.5$ , solving the system (20), we have

${u}_{0}=0.11374565155265949$ , ${u}_{1}=0.\text{1135}0\text{37385434152}$ ,

${u}_{2}=0.\text{1}0\text{788}0\text{9362815}0\text{8}$ , ${u}_{3}=0.0\text{86}0\text{238}0\text{525867}0\text{34}$ ,

${u}_{4}=0.0\text{473571247957}0\text{691}$ , ${u}_{5}=0.0\text{1}0\text{73621856}0\text{82}0\text{429}$ ,

${u}_{6}=0$ .

Similarly, For other values of parameters α and ${H}_{a}^{2}$ the numerical results are shown in the upcoming Figure 2 & Figure 3 and residual errors are displayed via the Tables 1-3.

Note: There are several choices for the parameter k but here we have considered particular $k=1.5$ . The optimum value of k can be computed and it takes a tedious computation which can be the part of future research in this direction.

Figure 2. Solution profile for $\alpha =1.$

Figure 3. Solution profile for ${H}_{a}^{2}=1.$

Table 1. Maximum residual error.

Table 2. Maximum residual error.

Table 3. Comparison of residual errors using LSM, HAM and OCMI (our method).

The solution profiles of numerical solution for several values of α and ${H}_{a}^{2}$ are shown via the Figure 2 & Figure 3. Also, the maximum residual error is tabulated in Table 1 & Table 2 for varying value of α and ${H}_{a}^{2}$ . From the Table 1 & Table 2, it is obvious that errors are significantly small which shows the effectiveness of the method.

5 .Result and Discussion

The main aim of the discussion is to recognize the effects of Hartmann number ${H}_{a}^{2}$ and nonlinearity parameter α on conduit velocity profiles. In this paper, the solution profiles for both large and small values of α are considered. For $\alpha \ll 1$ , the solution profiles obtained by our proposed method are similar to Mckee et al. [1] , Paullet [2] , Ghasemi et al. [6] . As in [2] , author claimed that solutions (for

large ${H}_{a}^{2}$ ) are monotonically decreasing and satisfy $0<w(r)<\frac{1}{\alpha +1}$ which is quite evident from Figure 2. For $\alpha \gg 1$ , solutions profiles are also bounded by $\frac{1}{\alpha +1}$ which is depicted via the Figure 3. The amount of maximum residual

errors for varying values of α and ${H}_{a}^{2}$ are tabulated in Table 1 & Table 2. Table 3, shows the comparison of residual errors obtained by Least Square Method (LSM), Homotopy Analysis Method (HAM)and OCMI (our proposed method). The residual errors by our method are smaller than the errors obtained by Least Square Method [6] and Homotopy Analysis Method [3] . The amount of residual errors for $\alpha =1$ with ${H}_{a}^{2}=1,2,4$ are depicted in Figures 4-6 respectively which infer that residual errors are quite smaller than the residual errors claimed in [6] . For ${H}_{a}^{2}=1$ with $\alpha =4,10$ the residual errors are plotted in Figure 7 & Figure 8 which are significantly smaller as compared to the residual errors claimed in the Figures shown by Ghasemi et al. [6] .

6. Conclusion

In this paper, we have successfully introduced a very simple numerical method named as “orthogonal collocation-based on mixed interpolation” (OCMI). We have solved a non-linear boundary value problem governing the electrohydrodynamic

Figure 4. Residual error for ${H}_{a}^{2}=1$ and $\alpha =1.$

Figure 5. Residual error for ${H}_{a}^{2}=2$ and $\alpha =1.$

Figure 6. Residual error for ${H}_{a}^{2}=4$ and $\alpha =1.$

Figure 7. Residual error for ${H}_{a}^{2}=1$ and $\alpha =4.$

Figure 8. Residual error for ${H}_{a}^{2}=1$ and $\alpha =10.$

flow (EHD) in cylindrical conduit where the unknown solution is approximated by means of mixed interpolation. The approximate solutions are in excellent agreement with those of the solution given by previous researchers Mckee et al. (1997), Paullet (1999) and Ghasemi et al. (2014). The comparison of residual errors is made in Table 3 which shows the error in our method is smaller or equal to the error via Least Square Methods (LSM), Homotopy Analysis Method (HAM) for a fixed non-linearity parameter. The effect of Hartmann electric number (
${H}_{a}^{2}$ ) is depicted in Figure 2 which shows that the conduit velocity increases with increase in
${H}_{a}^{2}$ . On the other hand, the increasing effect of nonlinearity parameter (α) for a fixed
${H}_{a}^{2}$ affects conduit velocity adversely. For small values of α, conduit velocity shows rhythmic behavior but for large values of α, its behavior is adversed which is shown in Figure 3. For
$\alpha \gg 1$ velocity profile found to be flatten in shape, thus shown an agreement in velocity profile that claimed by Paullet [2] . The graphs of residual errors are displayed via Figures 4-8 which infer that the amount of errors are significantly smaller than the values, shown in Figures given by Ghasemi et al. [6] . The truncation error is bounded and its L_{2}-norm has computed and given in section 3. In this approach of mixed interpolation we have used a fixed value of parameter
$k=1.5$ in correction terms. The computation of optimum value of correction parameter k can be taken as future development in this direction.

Acknowledgements

The first author acknowledges the financial support in form of fellowship given by Dr. Harisingh Gour Vishwavidyalaya, Sagar (M.P.), India.

References

[1] Mckee, S., Watson, R., Cuminato, J.A., Caldwell, J. and Chen, M.S. (1997) Calculation of Electrohydrodynamic Flow in a Circular Cylindrical Conduit. Zeitschrift für Angewandte Mathematik und Mechanik, 77, 457-465.

https://doi.org/10.1002/zamm.19970770612

[2] Paullet, J.E. (1999) On the Solution of Electrohydrodynamic Flow in a Circular Cylindrical Conduit. Zeitschrift für Angewandte Mathematik und Mechanik, 79, 357-360.

https://doi.org/10.1002/(SICI)1521-4001(199905)79:5<357::AID-ZAMM357>3.0.CO;2-B

[3] Mastroberardino, A. (2011) Homotopy Analysis Method Applied to Electrohydradynamic Flow. Communications in Nonlinear Science and Numerical Simulation, 16, 2730-2736.

https://doi.org/10.1016/j.cnsns.2010.10.004

[4] Pandey, R.K., Baranwal, V.K. and Singh, C.S. (2012) Semi-Analytic Algorithms for the Electrohydrodynamic Flow Equation. Journal of Theoretical and Applied Physics, 6, 45.

[5] Khan, N.A., Jamil, M., Mahmood, A. and Ara, A. (2012) Approximate Solution for the Electrohydrodynamic Flow in a Circular Cylindrical Conduit. ISRN Computational Mathematics, 2012, Article ID: 341069.

[6] Ghasemi, S.E., Hatami, M., Mehdizadeh Ahangar, GH.R. and Ganji, D.D. (2014) Electrohydrodynamic Flow Analysis in a Circular Cylindrical Conduit Using Least Square Method. Journal of Electrostatics, 72, 47-52.

https://doi.org/10.1016/j.elstat.2013.11.005

[7] Saunders, R. (1985) Note on a Proposed Weighted Residual Method for Solving Nonlinear Differential Boundary Problems. Applied Mathematical Modelling, 9, 385-386.

https://doi.org/10.1016/0307-904X(85)90029-0

[8] Iserles, A. (1996) A First course in the Numerical Analysis of Differential Equations, Cambridge University Press, Cambridge.

[9] de Boor, C. and Swartz, B. (1973) Collocation at Gaussian Points. SIAM Journal on Numerical Analysis, 10, 582-606.

https://doi.org/10.1137/0710052

[10] Nemati, S. (2015) Numerical Solution of Volterra-Fredholm Integral Equations Using Legendre Collocation Method. Journal of Computational and Applied Mathematics, 278, 29-36.

https://doi.org/10.1016/j.cam.2014.09.030

[11] Pandey, R.K., Sharma, S. and Kumar, K. (2016) Collocation Method for Generalized Abel’s Integral Equations. Journal of Computational and Applied Mathematics, 302, 118-128.

https://doi.org/10.1016/j.cam.2016.01.036

[12] Carey, G.F. and Finlayson, B.A. (1975) Orthogonal Collocation on Finite Elements, Chemical Engineering Science, 30, 587-596.

https://doi.org/10.1016/0009-2509(75)80031-5

[13] Liu, F. and Bhatia, S.K. (1999) Computationally Efficient Solution Techniques for Adsorption Problems Involving Steep Gradients Bidisperse Particles. Computers & Chemical Engineering, 23, 933-943.

https://doi.org/10.1016/S0098-1354(99)00262-8

[14] Arora, S., Dhaliwal, S.S. and Kukreja, V.K. (2005) Solution of Two Point Boundary Value Problems Using Orthogonal Collocation on Finite Elements. Applied Mathematics and Computation, 171, 358-370.

https://doi.org/10.1016/j.amc.2005.01.049

[15] Paterson, W.R. and Cresswell, D.L. (1971) A Simple Method for the Calculation of Effectiveness Factor. Chemical Engineering Science, 26, 605-616.

https://doi.org/10.1016/0009-2509(71)86004-9

[16] Vaferi, B., Salimi, V., Dehghan Baniani, D., Jahanmiri, A. and Khedri, S. (2012) Prediction of Transient Pressure Response in the Petroleum Reservoirs Using Orthogonal Collocation. Journal of Petroleum Science and Engineering, 98-99, 156-163.

https://doi.org/10.1016/j.petrol.2012.04.023

[17] Meyer, H.D., Vanthournout, J., Vanden Berghe, G. and Vanderbauwhede, A. (1990) On the Error Estimation for a New Type of Mixed Interpolation. Journal of Computational and Applied Mathematics, 32, 407-415.

https://doi.org/10.1016/0377-0427(90)90045-2

[18] Meyer, H.D., Vanthournout, J. and Vanden Berghe, G. (1990) On a New Type of Mixed Interpolation. Journal of Computational and Applied Mathematics, 30, 55-69.

https://doi.org/10.1016/0377-0427(90)90005-K

[19] Chakrabarti, A. and Hamsapriye (1996) Derivation of a Generalised Mixed Interpolation Formula. Journal of Computational and Applied Mathematics, 70, 161-172.

https://doi.org/10.1016/0377-0427(96)00145-8

[20] Chakrabarti, A. and Hamsapriye (1996) Modified Quadrature Rules Based on a Generalised Mixed Interpolation Formula. Journal of Computational and Applied Mathematics, 76, 239-254.

https://doi.org/10.1016/S0377-0427(96)00107-0

[21] Vanden Berghe, G., Meyer, H.D. and Vanthournout, J. (1990) On a Class of Modified Newton-Cotes Quadrature Formulae Based upon Mixed-Type of Interpolation. Journal of Computational and Applied Mathematics, 31, 331-349.

https://doi.org/10.1016/0377-0427(90)90034-W