- Research
- Open Access
- Published:
Operator compact exponential approximation for the solution of the system of 2D second order quasilinear elliptic partial differential equations
Advances in Difference Equations volume 2019, Article number: 47 (2019)
Abstract
In this paper, we suggest a new exponential implicit method based on full step discretization of order four for the solution of quasilinear elliptic partial differential equation of the form \(A ( x,y,z ) z_{xx} +C ( x,y,z ) z_{yy} =k ( x,y,z, z_{x}, z_{y} )\), \(0< x,y<1\). In this method a single compact cell consisting of nine nodal points is used. Convergence analysis of the said method is discussed in detail. The developed method is successfully applied to solving problems in polar coordinates. The method for scalar equation is eventually applied to solving the system of quasilinear elliptic equations. To measure the rationality and precision, the method is applied to solving several noteworthy problems and numerical results are provided to exhibit the effectiveness of the method.
1 Introduction
We examine a quasilinear elliptic equation in two space dimensions of the form
where \((x,y)\in \varGamma = (0,1) \times (0,1)\).
The partial differential equations (PDEs) of the type (1.1) with non-constant coefficients illustrate several real world problems of phenomenological importance like Poisson’s equation, convection–diffusion equation, Burgers’ equation and the nonlinear steady-state Navier–Stokes (NS) equations of motion.
We presuppose the following about the boundary value problem (1.1)–(1.2):
-
1.
\(A.C>0\) in Γ,
-
2.
\(z(x,y)\in C^{6}\),
-
3.
\(A, C\in C^{4}\),
-
4.
k is continuous,
-
5.
\(\frac{\partial k}{\partial z} \geq0\),
-
6.
\(\vert \frac{\partial k}{\partial z_{x}} \vert \leq H\), \(\vert \frac{\partial k}{\partial z_{y}} \vert \leq I\),
where H and Iare finite positive real bounds and \(C ^{p}\) is the class of functions with smooth partial derivatives up to order p (Jain et al. [1]).
The ellipticity condition of Eq. (1.1) is ensured by (1). Assumptions (2)–(4) are required to enable the Taylor series expansions, and (5)–(6) are the adequate conditions for the existence and uniqueness of the solution of the boundary value problem (1.1)–(1.2) (Jain et al. [2]).
Elliptic equations, a type of partial differential equations illustrate behavior that remains static with time. In other words processes which are in equilibrium, like heat flow or fluid flow through a medium without any accumulations. The elliptic equation satisfies a differential equation within a domain along with the values near the boundary of the region (boundary values), representing the effect from outside the domain. These conditions fall in two categories, one representing fixed temperature distribution at boundary points (Dirichlet problem) another, where heat is added or removed across the boundary in such a manner so that constant temperature is maintained throughout (Neumann problem).
The elliptic equations are used to model many natural phenomena like heat dissipation in a metal sheet. They are used in aircraft design as well as in weather prediction (weather, flow over wing, turbulence etc.). Many numerical strategies to solve a specific PDE are iterative methods based on finite differencing whereby a mesh is generated to represent a physical domain, the points on the mesh or grid are initialized usually with an approximate solution and then repeatedly updated to obtain an increasingly accurate solution. This process may be repeated for a fixed number of iterations or until the solution has reached the desired level of accuracy. Each iteration stores the newly calculated values in another array and swaps the arrays at the end of the iteration.
The Laplace equation, \(z _{xx} + z _{yy} = 0\), is one of the most fundamental 2D elliptic equation which represents the steady-state condition. It arises in electrostatics, gravitation, steady-state flow of inviscid fluids and steady-state heat conduction. We have numerically solved substantially important equations like Navier–Stokes equations which are beneficial in explaining multitude of phenomena arising in science and engineering-modeling weather, ocean currents, water flowing in a pipe and air flowing around a wing. The Navier–Stokes equations find their way in a host of applications viz. creating blueprints of aircraft and cars, flow of blood in animals, designing power stations, analyzing soil, air and water pollution and a plethora of real world phenomena. These equations govern the motion of fluids and can be seen as Newton’s second law of motion for fluids. These are always solved together with the continuity equation. The Navier–Stokes equations symbolize the conservation of momentum while the continuity equation describes the conservation of mass. They form the core of fluid dynamics. Due to their complex behavior, these equations allow for a few restricted analytical solutions. In 1995, Li, Tang, Fornberg [3] discussed a compact finite difference method for the equilibrium state of non-compressible Navier–Stokes equations.
In the year 2006, Erturk, Gökcöl [4] developed a fourth order compact method to solve Navier–Stokes equations with high Reynolds numbers. Then, in the year 2008, Liu, Wang proposed a fourth order numerical scheme for the primitive equations formulated in mean vortices [5]. In the same year Ito and Qiao [6] discussed compact MAC finite difference scheme of high order for the Stokes equations.
We have also numerically solved the Poisson equation, which arises in electrostatics and elasticity theory. The solution of a Poisson equation describes the steady state of a system. For example, the stabilized temperature of a steel rod with one end held in your hand and the other end in the air is a solution of a certain Poisson equation. To approximate the solution of a Poisson equation numerically, one needs to solve a diagonally dominant linear system.
For linear elliptic equations many numerical schemes have been discussed which date back to the year 1984 (see [7,8,9,10,11]). Solving fully nonlinear elliptic partial differential equations numerically finds strong interest among the research community. The applicability of these equations in innumerable areas of science, such as transportation theory, optimization, fluid dynamics and differential geometry, provides strong impetus to pursue deeper research into this field. Among various numerical methods in the literature for solving fully nonlinear equations; finite difference and finite element type methods are quite popular (see [1, 12,13,14,15]). In 1994, Jain et al. [16] developed fourth order difference method for quasilinear Poisson equation in cylindrical symmetry. The following year Ananthakrishnaiah, Saldanha [17] discussed a fourth order finite difference scheme for two-dimensional nonlinear elliptic partial differential equations. Thereafter, Mohanty et al. [18,19,20,21], Zhang [22], Saldanha [23] discussed order \(h ^{4}\) difference methods for a class of elliptic boundary value problem. Dehghan et al. [24] proposed preconditioning techniques to obtain faster convergence of the higher order methods applied to linear elliptic PDEs. Using the splitting technique, Mohanty et al. [25,26,27,28], Khattar et al. [29] and Singh et al. [30, 31] have proposed high accuracy numerical methods for the solution of nonlinear bi- and triharmonic elliptic boundary value problems.
This paper is devoted to the construction and analysis of the fourth order exponentially fitted discretization of a second order quasilinear elliptic PDE using full step grid points on a uniform mesh with Dirichlet boundary conditions. The exponentially fitted scheme is one of the upcoming classes of robust difference schemes. Such schemes exhibit good convergence and stability. Furthermore, they do not produce spurious oscillations as the previously known finite difference schemes. The supremacy of the exponentially fitted scheme is reflected by the numerical results in terms of maximum absolute errors.
A good first theoretical foundation of the technique of exponential fitting for multistep methods was given by Gautschi [32] and Lyche [33]. Since then, a lot of exponentially fitted linear multistep methods have been constructed; most of them were developed for second order differential equations where the first derivative is absent and applied to solving equations of the Schrödinger type.
This paper is structured in the following manner: In Sect. 2, we formulate the full step fourth order compact discretization scheme for the solution of a nonlinear elliptic equation with non-constant coefficients. Section 3 is dedicated to a detailed derivation of the numerical scheme under consideration. Thereafter, in Sect. 4, we establish the fourth order convergence of the method for a scalar equation under suitable conditions. Further, we extend our method to the system of quasilinear elliptic PDEs with non-constant coefficients, subject to Dirichlet boundary conditions in Sect. 5. In Sect. 6, we discuss our method to solve the elliptic equation in polar coordinates. The difficulties like the deterioration of the solution in the vicinity of singularity which we encountered in the past for obtaining the high accuracy numerical solution for the singular elliptic problems are solved by modifying our method and thus the method becomes valid to compute the singular problem in the entire solution domain. In Sect. 7, we have applied our method to solving nonlinear bi- and triharmonic problems. In Sect. 8, we solve a set of linear and nonlinear elliptic problems of physical importance to present and investigate the precision of the proposed method. The last section is devoted to concluding remarks.
2 Formulation of the numerical algorithm
We first consider the following two-dimensional elliptic PDE:
where \((x,y)\in \varGamma = (0,1) \times (0,1)\), satisfying Dirichlet boundary conditions given by (1.2).
We overlay on the solution domain Γ a square grid with spacing \(h>0\) in both x- and y-directions. Each nodal point is given by (\(x _{p} ,y _{q}\)), where \(x _{p}=ph\) and \(y _{q}=qh\), \(0 \leq p\), \(q \leq N\)+1 and \((N+1)h=1\).
Further, at each grid point (\(x _{p} ,y _{q}\)), let
-
(a)
\(Z_{p,q}\) and \(z_{p,q}\) be the exact and approximate values of \(z(x _{p} ,y _{q})\), respectively,
-
(b)
\(K_{p,q} = k(x_{p}, y_{q},Z_{p,q}, Z_{x_{p,q}}, Z_{y_{p,q}})\),
-
(c)
\(k_{p,q} = k(x_{p}, y_{q},z_{p,q}, z_{x_{p,q}}, z_{y_{p,q}})\),
-
(d)
\(S_{lm} = \frac{\partial^{l+m} S}{\partial x^{l} \partial y^{m}}\), for \(l,m=0,1,2,\dots\) and for \(S=A, C,Z\).
At each nodal point (\(x _{p} ,y _{q}\)), the differential equation (2.1) can be written as
Let \(\delta_{x} Z_{l} = ( Z_{l+ {\frac{1}{2}}} - Z_{l- {\frac{1}{2}}} )\) and \(\mu_{x} Z_{l} = {\frac{1}{2}} ( Z_{l+ {\frac{1}{2}}} + Z_{l- {\frac{1}{2}}} )\).
For the fourth order discretization of PDE (2.1), we use the following approximations:
Define
Let
and let
Further, let
and let
We denote
Assume that \(K_{p,q} \neq0\), then at each interior nodal point \(( x_{p}, y_{q} )\), the differential equation (2.1) is discretized as
where \(\overline{E}_{p,q} = O(h^{6})\).
3 Deriving the numerical scheme
For the derivation of the scheme (2.12), at the nodal point (\(x _{p,} y _{q}\)), we denote
With the help of (2.3b), (2.4b) and (3.1) from (2.7a), we get
Similarly, using (2.3c), (2.4c) and (3.1) from (2.7b), we get
where
Let us consider the following linear combinations:
where \(a_{i}\), \(b_{i}\), \(a'_{i}\), \(b'_{i}\), \(i = 1(1)4\) are parameters to be determined.
Using (2.3a), (2.5a), (2.6a), (2.6b), (3.2) in (3.6a) and (2.4a), (2.5a), (2.5b), (2.6a), (3.3) in (3.6b), we get
Note that
and
if
For this choice of parameters, from (2.9), it is easy to verify that
Using (2.3a), (2.5a), (2.6a), (2.6b), (3.1) in (3.6a) and (2.4a), (2.5a), (2.5b), (2.6a), (3.2) in (3.6b) we get
where
Using (3.10) and (3.11) in (2.11) we get
With the help of a Taylor expansion, it is easy to verify that
With the help of approximations (3.2), (3.3), (3.10), (3.15), from (2.12) and (3.16), we get the local truncation error
For the proposed method (2.12) to be of O(\(h ^{4}\)), the coefficient of \(h ^{4}\) in (3.17) must be zero. Thus we obtain the values of the coefficients,
We now consider the numerical method of \(O(h^{4})\) for the solution of the 2D quasilinear elliptic equation (1.1). Using the technique discussed in [19], we can get the fourth order method for the quasilinear equation (1.1).
4 Study of convergence
Consider the following 2D nonlinear elliptic partial differential equation:
defined in the region Γ and subject to \(z(x,y) = z_{0}(x,y), (x,y) \in \partial \varGamma\), where A and Care positive constants.
Then the difference method (2.12) for Eq. (4.1) becomes
where \(\overline{E}_{p,q} = O(h^{6})\), \(\lambda_{1} = 5A - C\), \(\lambda_{2} = 5C - A\) and \(\lambda_{3} = \frac{A + C}{2}\). The conditions which are usually imposed on (4.2) are \(\lambda _{1}\)>0 and \(\lambda _{2}\)>0.
The scheme (4.2) can easily be written in matrix form.
Let \(\boldsymbol{S} = [\boldsymbol{S}_{1}, \boldsymbol{S}_{2}, \boldsymbol{S}_{1}]_{N^{2} \times N^{2}}\) be a triblock-diagonal matrix, where \(S_{1} = [ - \lambda_{3}, - \lambda_{2}, - \lambda_{3}\ ]_{N \times N}\) and \(S_{2} = [ - \lambda_{1}, 20\lambda_{3}, - \lambda_{1}\ ]_{N \times N}\) are tri-diagonal matrices.
Let
Then the method (4.2) in matrix form may be written as
where E is the local truncation error vector.
Thus the method involves computing a numerical value z for the exact value Z by solving a system of \(( N^{2} \times N^{2} )\) equations:
Let
and
Let
We may write
for suitable \(R_{p \pm 1,q}^{(1)}\), \(R_{p,q \pm 1}^{(2)}\), \(R_{p,q}^{(3)}\) and \(R_{p,q}^{(4)}\), where \(R = V, G\) and H.
Also, for \(R = G\) and H we may write
and
With the help of Eqs. (4.7a)–(4.7d) and (4.8a)–(4.8d), we get
where \(\boldsymbol{Q} = (Q_{i,j})\), \(((i = 1(1)N^{2}), j = 1(1)N^{2})\) is the triblock-diagonal matrix with
where
With the help of (4.9), from (4.3) and (4.4), we get the following equation:
Let
where \(\overline{\varGamma} = \varGamma \cup \partial \varGamma\).
Then \(0 < V_{*}^{(2)} \le V_{p \pm 1,q}^{(1)}, V_{p,q \pm 1}^{(2)}, V_{p,q}^{(3)}, V_{p,q}^{(4)} \le V_{(2)}^{*}\), and for \(R=G,H\), let \(0 < \vert R_{p \pm 1,q}^{(1)} \vert , \vert R_{p,q \pm 1}^{(2)} \vert , \vert R_{p,q}^{(3)} \vert , \vert R_{p,q}^{(4)} \vert \le R\), and \(\vert R_{{x_{p,q}}}^{(1)} \vert \le R^{(1)}\), \(\vert R_{{y_{p,q}}}^{(2)} \vert \le R^{(2)}\) for some positive constants \(R^{(1)}\) and \(R^{(2)}\).
Further it is easy to verify that, for howsoever small h,
Further, the directed graph of (\(\boldsymbol{S} + \boldsymbol{Q}\)) shows that it is an irreducible matrix (see Fig. 1). The arrows indicate the paths \(i \to j\) for every nonzero entry of the matrix \((\boldsymbol{S} + \boldsymbol{Q})\). For any ordered pair of nodes i and j, there exists a direct path \((\overrightarrow{i,l_{1}} ), (\overrightarrow{l_{1},l_{2}} ),\ldots, (\overrightarrow{l_{k},j} )\) connecting i to j. Thus, the graph is strongly connected. So, the matrix (\(\boldsymbol{S} + \boldsymbol{Q}\)) is irreducible. (See Varga [34], Young [35].)
Let \(M_{k}\) be the sum of the elements in the kth row of \((\boldsymbol{S} + \boldsymbol{Q})\), then for \(k = 1\) and N, we have
where
where
For \(( 2 \le j \le N - 1 )\):
where
For \(( i = 2(1)N - 1 )\):
where
and, finally, for \(((2 \le i \le N - 1), 2 \le j \le N - 1)\):
With the help of Eqs. (4.11a)–(4.11e), for \(k = 1, N, (N - 1)N + 1\) and \(N^{2}\)
and for \(k = i\) and \((N - 1)N + i\); \(i = 2(1)N - 1\)
and for \(k = (j - 1)N + 1\) and jN; \(j = 2(1)N - 1\)
Hence for h (howsoever small) using (4.11) it is easy to see that
Thus, for h (howsoever small), (\(\boldsymbol{S} + \boldsymbol{Q}\)) is monotone. Hence, \((\boldsymbol{S} + \boldsymbol{Q})^{ - 1}\) exists and \((\boldsymbol{S} + \boldsymbol{Q})^{ - 1}= \boldsymbol{J} >\boldsymbol{0} \) where \(\boldsymbol{J} = [J_{i,j}]_{N^{2} \times N^{2}}\).
Since \(\sum_{j = 1}^{N^{2}} J_{l,j}M_{j} = 1\), \(l = 1(1)N^{2}\), using (4.12a)–(4.12d) with \(l = 1(1)N^{2}\), we obtain
Since E is the local truncation error vector, we define \(\Vert \boldsymbol{E} \Vert =\max_{p,q} \vert \bar{E}_{p,q} \vert \leq C ^{*} h ^{6}\), where \(C ^{*}\) is a positive constant.
Now, from Eq. (4.10), we obtain
where
Using inequalities (4.13a)–(4.13d) in Eq. (4.15), we get
Finally, with the help of (4.16) for sufficiently small h, from (4.14) we obtain
This proves the convergence of the fourth order of the method (4.2) for the elliptic equation (4.1).
5 Method for system of equations
In this section, we extend our method to the system of quasilinear PDEs of the form
where \((x,y)\in \varGamma = (0,1) \times (0,1)\), \(A^{(i)} = A^{(i)}(x, y)\) and \(C^{(i)} = C^{(i)}(x, y)\).
The boundary conditions of Dirichlet type are given by
We assume \(Z_{p,q}^{(i)}\) and \(z_{p,q}^{(i)}\) to be the exact and approximate values of \(z^{(i)}(x_{p},y_{q})\) respectively.
For each \(i=1(1)n\), let
We define the following approximations:
Define
Let
and let
We denote
Assume that \(K_{p,q}^{(i)} \ne 0\), \(i = 1(1) N\). Then at each nodal point \(( x_{ p}, y_{ q})\) the given system of differential equations (5.1) is discretized by
Using the technique discussed in [19], we can derive the fourth order schemes for the system of quasilinear elliptic PDEs.
6 Application to elliptic equations in polar coordinates
In this section, we aim to derive a stable finite difference scheme for a class of two-dimensional quasilinear elliptic equations and ensure that the numerical methods developed here retain their order and accuracy everywhere including the region in the vicinity of the singularity \(x= 0\).
Let us consider the elliptic equation of the form
where \(D(x) = \frac{1}{x}\).
In this section, we denote
With the help of approximations (2.3a)–(2.11) and using the method (2.12), we obtain the following difference scheme for Eq. (6.1):
where
Note that the scheme (6.3) is of \(O(h ^{4})\) for the difference solution of (6.1). However, the scheme fails when the solution is to be determined at \(p=1\). We overcome this difficulty by modifying the method in such a way that the solutions retain the order and accuracy even in the vicinity of the singularity \(x=0\).
We consider the following approximations:
Now using the approximations (6.4a)–(6.4c) and neglecting the higher order terms, we get
where
Now consider the two dimensional Poisson equation in the r–θ plane,
Replacing the variables x, y by r, θ, respectively, we get the required difference scheme for the solution of differential equation (6.6) and the coefficients are given by
Next, we consider the two dimensional Poisson equation in the r–w plane,
Replacing the variables x, y by r, w, respectively, we get the required difference scheme for the solution of the differential equation (6.7) and the coefficients are given by
Note that the scheme (6.3) along with the approximations (6.4a)–(6.4c) are of \(O(h ^{4})\) and free from the terms \(1/(p \pm1)\) and \(1/(q \pm1)\), hence it is very easily solved for \(p,q= 1, 2,\ldots,N\) in the region \(0 < r,\theta < 1\) and \(0 < r,w < 1\). In a similar manner, we can discuss the numerical schemes for nonlinear elliptic equations in polar coordinates.
7 Application to nonlinear bi- and triharmonic problems
7.1 Nonlinear biharmonic equation
We consider the 2D nonlinear biharmonic elliptic partial differential equation with a forcing function of the form
where the Laplacian operator \(\nabla^{2}\) is defined by \(\nabla^{2}z \equiv \frac{\partial^{2}z}{\partial x^{2}} + \frac{\partial^{2}z}{\partial y^{2}}\).
The boundary conditions of second kind z and (\(\partial^{2}z/\partial n^{2}\)) are prescribed on the boundary.
The values of z, \(z _{yy}\) are prescribed on the boundary \(y = 0\), \(y = 1\); and the values of z, \(z _{xx}\) are prescribed on the boundary \(x = 0\), \(x = 1\). As the grid lines are parallel to the coordinate axes and the values of zare exactly known on the boundary, this implies that the successive tangential partial derivatives of z are known exactly on the boundary. For example, on the line \(y = 0\), the values of \(z(x,0)\) and \(z _{yy}(x,0)\) are known, i.e. the values of \(z _{x}(x,0)\), \(z _{xx}(x,0)\), etc. are known on the line \(y = 0\). This implies the values of \(z(x,0)\) and \(\nabla^{2}z(x,0) \equiv z_{xx}(x,0) + z_{yy}(x,0)\) are known on the line \(y = 0\). Similarly, the values of z and \(\nabla^{2}z\) are known on all sides of the square region.
Let us denote \(\nabla^{2}z=v\). Then we can rewrite Eq. (7.1) in a coupled manner as
In this case, the values of z and vare exactly known on the boundary of Γ.
Applying the method (5.12) to the system of equations (7.2a)–(7.2b), a numerical method of order four for the solution of the biharmonic equation (7.1) can be written as
where
The approximations associated with (7.4a)–(7.4d) are already defined in Sect. 5.
7.2 Nonlinear triharmonic equation
Next we consider the nonlinear triharmonic equation with a forcing function of the form
The values of z, (\(\partial^{2}z/\partial n^{2}\)) and (\(\partial^{4}z/\partial n^{4}\)) are known on the boundary.
For Eq. (7.5), the boundary values of \(z, z _{yy}\), \(z _{\mathit{yyyy}}\) are prescribed on the line \(y = 0\), \(y = 1\); and the boundary values of \(z, z _{xx}\), \(z _{\mathit{xxxx}}\) are prescribed on the line \(x = 0\), \(x = 1\). As discussed in the biharmonic case, the values of z, \(\nabla^{2}z\) and \(\nabla^{4}z\) are known on all sides of the square region Γ.
Let \(\nabla^{2}z =v\) and \(\nabla^{2}v =w\). Then we rewrite Eq. (7.5) in a split form as
Applying the method (5.12) to the system of equations (7.6a)–(7.6c), a numerical method of order four for the solution of triharmonic equation (7.5) can be written as
where
The approximations associated with (7.8a)–(7.8d) are already defined in Sect. 5.
With the help of boundary values, writing all methods at every interior grid point, one obtains sparse systems of linear algebraic equations for the solution of the multiharmonic equations (7.1), (7.5). A direct solution of these linear systems is impractical because of the large size of the coefficient matrix and enormous storage requirements even for moderate values of the grid size. Classical block iterative methods such as the Gauss–Seidel and successive over relaxation methods are attractive for their low storage requirements as long as convergence is guaranteed.
8 Numerical illustrations
We implement the proposed method on ten benchmark problems of 2D elliptic equations. The exact solution of each problem is given. The right hand side function and Dirichlet boundary conditions are determined from the exact solution in each problem. The system of linear difference equations are solved using the Gauss–Seidel iteration method and that of nonlinear difference equations by the Newton–Raphson iteration method [36, 37]. The iterations are terminated once the absolute error tolerance ≤10−12 is reached and the initial guess made in each case is \(\mathbf{z} = \mathbf{0}\). All computations were performed using MATLAB codes.
Problem 8.1
(Convection–diffusion equation)
The exact solution is given by \(z(x,y) =e^{\beta x/2}\frac{\sin (\pi y)}{\sinh (\sigma )}[2e^{ - \beta /2}\sinh (\sigma x) + \sinh (\sigma (1 - x))]\), \(\sigma = \sqrt{\pi^{2} + \frac{\beta^{2}}{4}}\).
The maximum absolute errors (MAEs) in z are listed in Table 1. Figures 2(a) and (b) give the plots of the exact and numerical solutions for \(h=1/64\) and \(\beta=50\).
Problem 8.2
(Poisson’s equation in r–θ plane)
The exact solution is \(z(r,\theta ) = r^{2}\cos (\pi \theta )\). The MAEs in z are listed in Table 2 for \(\alpha=1\) and 2. Figures 3(a) and (b) give the plots of the exact and numerical solutions for \(h=1/32\) and \(\alpha = 2\).
Problem 8.3
(Poisson’s equation in r–w plane)
The exact solution is \(z(r,w) = \cosh r\cosh w\). The MAEs in z are listed in Table 3 for \(\alpha = 1\) and 2. Figures 4(a) and (b) give the plots of the exact and numerical solutions for \(h=1/64\) and \(\alpha = 2\).
Problem 8.4
(Burgers’ equation)
The exact solution is \(z(x,y) = e^{x}\sin ( \frac{\pi y}{2} )\). The MAEs in z are listed in Table 4 for \(\varepsilon = 0.1,0.01\) and 0.001. Figures 5(a) and (b) give the plots of the exact and numerical solutions for \(h=1/32\) and \(\varepsilon = 0.01\).
Problem 8.5
(2D steady-state Navier–Stokes model equations in rectangular coordinates)
The exact solutions are \(z(x,y) = \sin (\pi x)\sin (\pi y)\), \(v(x,y) = \cos (\pi x)\cos (\pi y)\).
The MAEs in z, v are tabulated in Table 5 for various values of the Reynolds number \(R _{e}\). Figures 6(a) and (b) give the plots of the exact and numerical solutions of z and Figs. 6(c) and (d) give the plots of the exact and numerical solutions of v for \(h=1/64\), \(R _{e}=10\).
(a) Exact solution of Problem 8.5 for \(z(x,y)\) for \(h = 1/64\) and \(\operatorname{Re} = 10\). (b) Numerical solution of Problem 8.5 for \(z(x,y)\) for \(h = 1/64\) and \(\operatorname{Re} = 10\). (c) Exact solution of Problem 8.5 for \(v(x,y)\) for \(h = 1/64\) and \(\operatorname{Re} = 10\). (d) Numerical solution of Problem 8.5 for \(v(x,y)\) for \(h = 1/64\) and \(\operatorname{Re} = 10\)
Problem 8.6
(2D steady-state Navier–Stokes model equations in cylindrical polar coordinates in r–w plane)
The exact solutions are given by \(z(r,w) = r^{3}\sinh w\), \(v(r,w) = - 4r^{2}\cosh w\). The MAEs in z, v are listed in Table 6 for various values \(R _{e}\). Figures 7(a) and (b) give the plots of the exact and numerical solutions of z, and Figs. 7(c) and (d) give the plot of the exact and numerical solutions of v for \(h=1/32\) and \(R _{e}=10\).
(a) Exact solution of Problem 8.6 for \(z(x,y)\) for \(h = 1/32\) and \(\operatorname{Re} = 10\). (b) Numerical solution of Problem 8.6 for \(z(x,y)\) for \(h = 1/32\) and \(\operatorname{Re} = 10\). (c) Exact solution of Problem 8.6 for \(v(x,y)\) for \(h = 1/32\) and \(\operatorname{Re} = 10\). (d) Numerical solution of Problem 8.6 for \(v(x,y)\) for \(h = 1/32\) and \(\operatorname{Re} = 10\)
Problem 8.7
(Nonlinear elliptic equation)
The exact solution is \(z(x,y) = e^{x}\cos (\pi y)\). The MAEs in z are tabulated in Table 7 for various values of α. Figures 8(a) and (b) give the plot of the exact and numerical solutions of z for the values of \(h=1/64\) and \(\alpha=1\).
Problem 8.8
(Quasilinear elliptic equation)
The exact solution is \(z(x,y) = e^{x}\cos (\pi y)\). The MAEs in z are tabulated in Table 8 for various values of α. Figures 9(a) and (b) give the plots of the exact and numerical solutions of z for \(h=1/64\) and \(\alpha = 1\).
Problem 8.9
(Nonlinear biharmonic equation)
The exact solution is \(z(x,y) = \sin (\pi x)\cos (\pi y)\). The MAEs in z are tabulated in Table 9 for various values of α. Figures 10(a) and (b) give the plots of the exact and numerical solutions of z for \(h=1/64\) and \(\alpha = 1\).
Problem 8.10
(Nonlinear triharmonic Equation)
The exact solution is \(z(x,y) = \cos (\pi x)\sin (\pi y)\). The MAEs in z are tabulated in Table 10 for various values of α. Figures 11(a) and (b) give the plots of the exact and numerical solutions of z for \(h=1/64\) and \(\alpha = 1\).
9 Conclusions
We have derived a new 9-point compact fourth order numerical method in exponential form for the numerical solution of the system of 2D quasilinear elliptic partial differential equations. The advantage of the exponential method is that it gives higher accuracy results than existing methods in the literature. The theoretical convergence of elliptic equations with constant coefficients has been established. Many benchmark problems like the diffusion–convection equation, Poisson’s equation in polar coordinates, the Navier–Stokes equations of motion both in rectangular and polar coordinates, nonlinear bi- and triharmonic equations, and quasilinear elliptic equations have been solved and compared with the results of existing methods. The theoretical rate of convergence was corroborated by the experimentally observed rate of convergence using the formula \(\rho = \log (e_{h_{1}} / e_{h_{2}}) / \log (h_{1} / h_{2})\), where \(e_{h_{1}}\) and \(e_{h_{2}}\) are the maximum absolute errors for two mesh sizes \(h_{1}\) and \(h_{2}\) respectively. Computational results exhibit that the proposed methods avoid spurious oscillation and give stable results for high Reynolds number even in the vicinity of the singularity. From the results we conclude that the proposed method is competitive in solving the two-dimensional problems and it can be extended to solving three-dimensional problems.
References
Jain, M.K., Jain, R.K., Mohanty, R.K.: Fourth order difference methods for the system of 2D nonlinear elliptic partial differential equations. Numer. Methods Partial Differ. Equ. 7, 227–244 (1991)
Jain, M.K., Jain, R.K., Mohanty, R.K.: A fourth order difference method for elliptic equations with nonlinear first derivative terms. Numer. Methods Partial Differ. Equ. 5, 87–95 (1989)
Li, M., Tang, T., Fornberg, B.: A compact fourth-order finite difference scheme for the steady state incompressible Navier–Stokes equations. Int. J. Numer. Methods Fluids 20, 1137–1151 (1995)
Erturk, E., Gökcöl, C.: Fourth-order compact formulation of Navier–Stokes equations and driven cavity flow at high Reynolds numbers. Int. J. Numer. Methods Fluids 50, 421–436 (2006)
Liu, J., Wang, C.: A fourth order numerical method for the primitive equations formulated in mean vorticity. Commun. Comput. Phys. 4, 26–55 (2008)
Ito, K., Qiao, Z.: A high order compact MAC finite difference scheme for the Stokes equations: augmented variable approach. J. Comput. Phys. 227, 8177–8190 (2008)
Spotz, W.F., Carey, G.F.: High order compact scheme for the steady stream function vorticity equations. Int. J. Numer. Methods Eng. 38, 3497–3512 (1995)
Carey, G.F.: Computational Grids: Generation, Adaption and Solution Strategies. Taylor & Francis, Washington (1997)
Yavneh, I.: Analysis of a fourth-order compact scheme for convection diffusion. J. Comput. Phys. 133, 361–364 (1997)
Zhang, J.: On convergence of iterative methods for a fourth-order discretization scheme. Appl. Math. Lett. 10, 49–55 (1997)
Birkhoff, G., Lynch, R.E.: The Numerical Solution of Elliptic Problems. SIAM, Philadelphia (1984)
Mohanty, R.K.: Fourth order finite difference methods for the system of 2D nonlinear elliptic equations with variable coefficients. Int. J. Comput. Math. 46, 195–206 (1992)
Böhmer, K.: On finite element methods for fully nonlinear elliptic equations of second order. SIAM J. Numer. Anal. 46(3), 1212–1249 (2008)
Feng, X., Neilan, M.: Vanishing moment method and moment solution for fully nonlinear second order partial differential equations. J. Sci. Comput. 38, 78–98 (2009)
Böhmer, K.: Numerical Methods for Nonlinear Elliptic Differential Equations: A Synopsis. Oxford University Press, Oxford (2010)
Jain, M.K., Jain, R.K., Krishna, M.: Fourth order difference method for quasi-linear Poisson equation in cylindrical symmetry. Commun. Numer. Methods Eng. 10, 291–296 (1994)
Ananthakrishnaiah, U., Saldanha, G.: A fourth order finite difference scheme for two-dimensional non-linear elliptic partial differential equations. Numer. Methods Partial Differ. Equ. 11, 33–40 (1995)
Mohanty, R.K.: Order \(h ^{4}\) difference methods for a class of singular two-space dimensional elliptic boundary value problems. J. Comput. Appl. Math. 81, 229–247 (1997)
Mohanty, R.K., Dey, S.: A new finite difference discretization of order four for (\(\partial u/ \partial n\)) for two-dimensional quasi-linear elliptic boundary value problems. Int. J. Comput. Math. 76, 505–576 (2001)
Mohanty, R.K., Singh, S.: A new fourth order discretization for singularly perturbed two dimensional non-linear elliptic boundary value problems. Appl. Math. Comput. 175, 1400–1414 (2006)
Mohanty, R.K., Setia, N.: A new compact high order off-step discretization for the system of 2D quasi-linear elliptic partial differential equations. Adv. Differ. Equ. 2013, 223 (2013)
Zhang, J.: On convergence and performance of iterative methods with fourth order compact schemes. Numer. Methods Partial Differ. Equ. 14, 263–280 (1998)
Saldanha, G.: Technical note: a fourth order finite difference scheme for a system of 2D nonlinear elliptic partial differential equations. Numer. Methods Partial Differ. Equ. 17, 43–53 (2001)
Arabshahi, S.M.M., Dehghan, M.: Preconditioned techniques for solving large sparse linear systems arising from the discretization of the elliptic partial differential equations. Appl. Math. Comput. 188, 1371–1388 (2007)
Mohanty, R.K.: A new high accuracy finite difference discretization for the solution of 2D non-linear biharmonic equations using coupled approach. Numer. Methods Partial Differ. Equ. 26, 931–944 (2010)
Mohanty, R.K.: Single cell compact finite difference discretizations of order two and four for multi-dimensional triharmonic problems. Numer. Methods Partial Differ. Equ. 26, 1420–1426 (2010)
Mohanty, R.K., Jain, M.K., Mishra, B.N.: A compact discretization of \(O(h ^{4})\) for two-dimensional non-linear triharmonic equations. Phys. Scr. 84, 025002 (2011)
Mohanty, R.K., Jain, M.K., Mishra, B.N.: A novel numerical method of \(O(h ^{4})\) for three-dimensional non-linear triharmonic equations. Commun. Comput. Phys. 12, 1417–1433 (2012)
Khattar, D., Singh, S., Mohanty, R.K.: A new coupled approach high accuracy numerical method for the solution of 3D non-linear biharmonic equations. Appl. Math. Comput. 215, 3036–3044 (2009)
Singh, S., Khattar, D., Mohanty, R.K.: A new coupled approach high accuracy numerical method for the solution of 2D non-linear biharmonic equations. Neural Parallel Sci. Comput. 17, 239–256 (2009)
Singh, S., Singh, S., Mohanty, R.K.: A new high accuracy off-step discretization for the solution of 2D non-linear triharmonic equations. East Asian J. Appl. Math. 03, 228–246 (2013)
Gautschi, W.: Numerical integration of ordinary differential equations based on trigonometric polynomials. Numer. Math. 3, 381–397 (1961)
Lyche, T.: Chebyshevian multistep methods for ordinary differential equations. Numer. Math. 19, 65–75 (1972)
Varga, R.S.: Matrix Iterative Analysis. Springer, New York (2000)
Hageman, L.A., Young, D.M.: Applied Iterative Methods. Dover, New York (2004)
Kelly, C.T.: Iterative Methods for Linear and Non-Linear Equations. SIAM, Philadelphia (1995)
Saad, Y.: Iterative Methods for Sparse Linear Systems. SIAM, Philadelphia (2003)
Acknowledgements
The authors thank the reviewers for their valuable suggestions, which substantially improved the quality of the paper.
Funding
This work is supported by Maitreyi College, University of Delhi.
Author information
Authors and Affiliations
Contributions
All authors drafted the manuscript, and they read and approved the final version.
Corresponding author
Ethics declarations
Competing interests
The authors declare that they have no competing interests.
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.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.
About this article
Cite this article
Mohanty, R.K., Manchanda, G. & Khan, A. Operator compact exponential approximation for the solution of the system of 2D second order quasilinear elliptic partial differential equations. Adv Differ Equ 2019, 47 (2019). https://doi.org/10.1186/s13662-019-1968-9
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13662-019-1968-9
MSC
- 65N06
- 65N12
Keywords
- Quasilinear elliptic equations
- Compact exponential approximation
- Fourth order difference methods
- Convergence analysis
- Burger’s equation
- Convection-diffusion equation
- Navier–Stokes equations of motion