Skip to main content
MethodsX logoLink to MethodsX
. 2023 Jan 2;10:101980. doi: 10.1016/j.mex.2022.101980

Higher order approximation in exponential form based on half-step grid-points for 2D quasilinear elliptic BVPs on a variant domain

Nikita Setia a,, RK Mohanty b
PMCID: PMC9846021  PMID: 36684468

Abstract

This paper reports a new fourth order Finite Difference Method (FDM) in exponential form for two-dimensional quasilinear boundary value problem of elliptic type (BVPE) with variant solution domain. Further, this discretization is extended to solve the system of quasilinear BVPEs. Following are the main highlights of the proposed FDM:

• An unequal mesh 9-point compact stencil is used to approximate the solution. Half-step points are used to evaluate the known variables of this problem. The convergence theory is studied for unequal mesh to validate the fourth order convergence of the suggested FDM.

• It is applicable to BVPE irrespective of coordinate systems. Various benchmark problems, for example, Poisson equation in cylindrical coordinates, Burgers’ equation, Navier-Stokes (NS) equations in cylindrical and rectangular coordinates, are solved to depict their fourth order convergence.

• Numerical results confirm the accuracy, trustworthiness and acceptability of the suggested numerical algorithm. These results endorse the superiority of the proposed FDM over the previously existing techniques of Mohanty and Kumar (2014), Mohanty and Setia (2014), Priyadarshini and Mohanty (2021).

Keywords: Quasilinear boundary value problem, Half-step points, Navier-Stokes equations, Unequal grid, Exponential form, Dissimilar domain, Convergence theory, Burgers’ equation

Method name: Finite Difference Technique

Graphical abstract

Image, graphical abstract


Specifications table

Subject area; Mathematics
More specific subject area; Partial Differential Equations
Name of your method; Finite Difference Technique
Name and reference of original method; I. Priyadarshini, R.K. Mohanty
High resolution half-step compact numerical approximation for 2D quasilinear elliptic equations in vector form and the estimates of normal derivatives on an irrational domain
Soft Computing, 25 (2021) 9967–9991
Resource availability; MATLAB

The Finite Difference Technique

Preliminaries and History

Introduction

We consider the following quasi-linear partial differential equation (PDE) of elliptic type:

Φ(x,y,u)uxx+Ψ(x,y,u)uyy=R(x,y,u,ux,uy). (1)

The solution domain for Eq. (1) is given by Ω=(0,xα)×(0,yβ). Let its boundary be denoted by Ω.

The boundary values of Dirichlet type are prescribed as follows:

u(x,y)=u0(x,y),(x,y)Ω, (2)

where real numbers xα and yβ are such that (xα/yβ) is irrational. Eq. (1) along with the above prescribed boundary values (2) is termed as boundary value problem of elliptic type (BVPE).

It is supposed that Eq. (1) satisfies Φ.Ψ>0 in Ω, which is the condition for ellipticity.

For (x,y)Ω, the following conditions hold:

  • I. uC6(Ω) and Φ,ΨC4(Ω),

  • II. R is continuous and (Ru)0,

  • III. |Rux|K1,|Ruy|K2, where K1 and K2 are constants in R.

Condition (I) is vital for generation of local truncation error (LTE) of the required accuracy. (II)-(III) are the sufficient conditions required for the numerical technique to be convergent [1]. Further, it is assumed that the solution of the given BVPE (1)-(2) exists in the prescribed domain and is unique therein.

Associated research work done in the past

Over the span of last four decades, many numerical methods of high accuracy have been developed towards solving linear and non-linear BVPEs. A finite difference method (FDM) that involves only the grid points immediately surrounding the one in concern is called as a compact FDM. In this article, a compact FDM of order three has been presented and applied to solve the quasilinear BVPEs in vector form, such as the Navier-Stokes (NS) equations.

Some related research works done in the past by various authors are as follows: FDMs of different orders of approximation for solving linear and non-linear BVPEs have been developed by Jain et al. [7,8,10] and Mohanty [9,15,24]. In the year 1995, an FDM of order four for a two-dimensional (2D) mildly non-linear BVPE has been developed by Saldanha and Ananthakrishnaiah et al. [11]. That same year, the NS equations which form a system of non-linear BVPEs have been solved using SOR technique by Li et al. [12]. Further, Spotz and Carey [13,14], Tian and Ge [22] have formed a nine-point high order compact (HOC) FDM for stream-function vorticity form of time-independent NS equations. In 1997, fourth order approximations have been given for a significant linear counterpart of the given BVPE (1) – (2) by Yavneh [16] and Zhang [17]. Further, compact techniques have been designed for 2D BVPEs and the convergence of the iterative techniques involved have been discussed by Zhang [18] and Saldanha [21]. In the year 1999, an HOC FDM has been proposed by Yanwen et al. [19] for solving incompressible system of NS equations in a regular domain. Mohanty and Dey [20] have framed approximations of order four, towards finding the normal derivatives of the dependent variable involved in a quasi-linear BVPE. In 2006, another new compact discretization for NS equations has been given by Erturk and Gökcöl [23]. They have used a finer mesh and a tri-diagonal solver. The order of accuracy achieved is four. Preconditioning techniques have been followed by Arabshahi and Dehghan [25] to solve a linear counterpart of the BVPE in concern. In 2008, Liu and Wang [26] have developed an FDM towards solving the mean-vorticity formulation, and examined the computational results obtained by application to equations governing large-scale atmospheric and oceanic flow. That same year, Fairweather et al. [27] proposed a discretization using orthogonal spline collocation method for 2D NS equations using stream-function vorticity form. Further, Ito and Qiao [28] have used a new HOC FDM to solve a BVPE involving the Stokes equations subject to Dirichlet boundary conditions. Upwind compact estimates of high orders for NS equations involving artificial compressibility have been designed by Shah and Yuan [31]. Apart from these, some finite element methods (FEM) ([6,29]) and finite volume methods [30] have also been proposed for the solution of many analogous forms of the BVPE in concern.

Detailing the related studies done in past ten years: In 2011, Tian et al. [32] have proposed a compact discretization of high order for incompressible NS equations. During the subsequent years, Mohanty and Setia have developed an HOC FDM for a general system of quasi-linear BVPEs using off-step grid points with uniform mesh in [33] and an unequal mesh in [36]. A scalar counterpart of this problem of Numerov type has been solved by Mohanty and Kumar [35]. Collocation methods based on Haar and Legendre wavelets for solving PDEs of elliptic type have been given by Aziz et al. [60] in 2013. Further, in the year 2014, a new HOC FDM for a Poisson equation in 2D space has been designed by Zhai et al. [34]. A comparison of an FDM and an FEM applied over a linear BVPE has been studied and discussed by Papanikos and Gousidou-Koutita in [37]. Monotone and adaptive FDMs have been combined to form a new FDM by Oberman and Zwiers [38] for time-dependent and time-independent problems with free boundaries. A similar method is designed by Hamfeldt and Salvador [43]. In 2015, Islam et al. [61] have developed a collocation method and a meshless method for 2D Poisson equation with nonlocal boundary conditions. Various meshless techniques have been derived by many authors in the subsequent years ([40,41,50,51]). Another FDM applied to NS equations is designed by Bayona et al. [42]. In 2017, Aziz et al. [62] have developed a collocation technique for a general three dimensional (3D) BVPE. Further, a class of FDMs with effective application to time-independent as well as time-dependent NS equations has been developed by Mittal et al. [39]. Subsequently, in [44], Mittal and Ray have developed FDMs for non-linear BVPEs in two- and three-dimensional space. Poisson equation with variable coefficients has been solved by Raeli et al. in [45]. Pandey and Jaboob [46] have proposed an FDM of order two, for a system involving BVPEs. Further, Zhang et al. [47] have solved 2D NS equations using a Galerkin method. Nadeem and Aziz [63] have designed a meshless and a Haar wavelet collocation method for 2D and 3D PDEs of elliptic type. In the year 2020, Li and Zhang [52] have developed a new HOC FDM by reducing the classical FEM. HOC FDMs in exponential form have been recently developed by Mohanty et al. [48,49,53,54] and Manchanda et al. [55]. Most recently, new high order approximations for 2D quasi-linear BVPEs involving an unequal mesh have been given by Priyadarshini and Mohanty in [56] and [57]. Mohanty et al. [59] have presented an HOC FDM in exponential form for the concerned system of BVPEs using full step grid points.

In the present article, we propose a new HOC FDM in exponential form using an unequal mesh for the given BVPE (1) – (2) on a dissimilar domain. The discretization so developed, involves nine points of the compact cell. The method details comprise of the mesh formation, notations involved for framing the proposed method, the discretization and its derivation. Further, we give a proof of the order of the discretization through a convergence analysis. The order of accuracy of the proposed FDM has been validated with computational illustrations through many benchmark BVPEs.

Numerical scheme on unequal mesh

For the construction of the new HOC FDM, we consider the 2D PDE:

Φ(x,y)uxx+Ψ(x,y)uyy=R(x,y,u,ux,uy),(x,y)Ω. (3)

Let us impose a mesh on the domain using the grid sizes hx>0 and hy>0 in x- and y- directions, respectively, such that hxhy in general. The mesh points in respective directions are given by xi=ihx,i=0,1,,Nx, and yj=jhy,j=0,1,,Ny, where Nx and Ny are positive integers such that Nxhx=xα,Nyhy=yβ. LetUi,j=u(xi,yj) and is approximated by ui,j. Let γ=(hxhy)>0 and Φi,j=Φ(xi,yj), Ψi,j=Ψ(xi,yj).

At each nodal point (xi,yj), let the following notations hold:

Uζη=ζ+ηUxζyη,Φζη=ζ+ηΦxζyη,Ψζη=ζ+ηΨxζyηforζ,η=0,1,2, (4)
q1=hxΦ106Φ00,q2=hyΨ016Ψ00. (5)

Further,

U0=Ui,j,U1=Ui+1,j,U2=Ui1,j,U3=Ui,j+1,U4=Ui,j1,U5=Ui+1,j+1,U6=Ui+1,j1,U7=Ui1,j+1,U8=Ui1,j1. (6)

For the domain Ω, let

U^i+12,j=12(U0+U1), (7)
U^i12,j=12(U0+U2), (8)
U^i,j+12=12(U0+U3), (9)
U^i,j12=12(U0+U4), (10)
U^xi,j=12hx(U1U2), (11)
U^xi+12,j=1hx(U1U0), (12)
U^xi12,j=1hx(U0U2), (13)
U^xi,j+12=14hx(U5U7+U1U2), (14)
U^xi,j12=14hx(U6U8+U1U2), (15)
U^yi,j=12hy(U3U4), (16)
U^yi+12,j=14hy(U5U6+U3U4), (17)
U^yi12,j=14hy(U7U8+U3U4), (18)
U^yi,j+12=1hy(U3U0), (19)
U^yi,j12=1hy(U0U4), (20)
U^xxi,j=1hx2(U1+U22U0), (21)
U^yyi,j=1hy2(U3+U42U0), (22)
U^xxyi,j=12hx2hy[U5U6+U7U82(U3U4)], (23)
U^xyyi,j=12hy2hx[U5+U6U7U82(U1U2)], (24)
U^xxyyi,j=1hx2hy2[U5+U6+U7+U82(U1+U2+U3+U4)+4U0], (25)
R^i±12,j=R(xi±12,yj,U^i±12,j,U^xi±12,j,U^yi±12,j), (26)
R^i,j±12=R(xi,yj±12,U^i,j±12,U^xi,j±12,U^yi,j±12), (27)
U^^xi,j=U^xi,jhx6Φ00(R^i+12,jR^i12,j)+hx26Φ00[Ψ00U^xyyi,j+Φ10U^xxi,j+Ψ10U^yyi,j], (28)
U^^yi,j=U^yi,jhy6Ψ00(R^i,j+12R^i,j12)+hy26Ψ00[Φ00U^xxyi,j+Φ01U^xxi,j+Ψ01U^yyi,j], (29)
U˜˜i,j=Ui,j+hx216U^xxi,j+hy216U^yyi,j, (30)
U˜˜xi,j=U^xi,jhx16Φ00(R^i+12,jR^i12,j)+hx216[1γ2+Ψ00Φ00]U^xyyi,j+hx216Φ00[Φ10U^xxi,j+Ψ10U^yyi,j], (31)
U˜˜yi,j=U^yi,jhy16Ψ00(R^i,j+12R^i,j12)+hy216[γ2+Φ00Ψ00]U^xxyi,j+hy216Ψ00[Φ01U^xxi,j+Ψ01U^yyi,j], (32)
R^^i,j=R(xi,yj,Ui,j,U^^xi,j,U^^yi,j), (33)
R˜˜i,j=R(xi,yj,U˜˜i,j,U˜˜xi,j,U˜˜yi,j). (34)

With the above definitions, at every (xi,yj) inside Ω, the PDE (3) is discretized by

Lu[Φ00+q1hxΦ10+q2hyΦ01+hx212Φ20+hy212Φ02]U^xxi,j+[Ψ00+q1hxΨ10+q2hyΨ01+hx212Ψ20+hy212Ψ02]U^yyi,j+[q2hyΦ00+hy26Φ01]U^xxyi,j+[q1hxΨ00+hx26Ψ10]U^xyyi,j+112[hx2Ψ00+hy2Φ00]U^xxyyi,j=R^^i,jexp[(1+3q1)R^i+12,j+(13q1)R^i12,j+(1+3q2)R^i,j+12+(13q2)R^i,j124R˜˜i,j3R^^i,j]+T^i,j, (35)

where T^i,j=O(hx4+hx2hy2+hy4) is the LTE.

Using the prescribed Dirichlet values (2), the scheme (35) is reducible as a block matrix of tri-diagonal form. This system of equations is implicitly solvable by the point or block iterative technique [[2], [3], [3], [4], [5], [6]].

Derivation of the proposed FDM

The PDE (3) can be written as

Φ00U20+Ψ00U02=R(xi,yj,Ui,j,Uxi,j,Uyi,j)=Ri,j, (36)

at each internal grid point (xi,yj).

From (36), it is easy to observe that

Lu[Φ00+q1hxΦ10+q2hyΦ01+hx212Φ20+hy212Φ02]U^xxi,j+[Ψ00+q1hxΨ10+q2hyΨ01+hx212Ψ20+hy212Ψ02]U^yyi,j+[q2hyΦ00+hy26Φ01]U^xxyi,j+[q1hxΨ00+hx26Ψ10]U^xyyi,j+112[hx2Ψ00+hy2Φ00]U^xxyyi,j=Ri,jexp[(1+3q1)Ri+12,j+(13q1)Ri12,j+(1+3q2)Ri,j+12+(13q2)Ri,j124Ri,j3Ri,j]+O(hx4+hx2hy2+hy4). (37)

The new simplified version of approximations (7)(25) can be written as

U^i±12,j=Ui±12,j+hx28U20±O(hx3), (38)
U^i,j±12=Ui,j±12+hy28U02±O(hy3), (39)
U^xi,j=Uxi,j+hx26U30+O(hx4), (40)
U^xi±12,j=Uxi±12,j+hx224U30±O(hx3), (41)
U^xi,j±12=Uxi,j±12+hx26U30+hy28U12±O(hx2hy), (42)
U^yi,j=Uyi,j+hy26U03+O(hy4), (43)
U^yi±12,j=Uyi±12,j+hx28U21+hy26U03±O(hxhy2), (44)
U^yi,j±12=Uyi,j±12+hy224U03±O(hy3), (45)
U^xxi,j=Uxxi,j+hx212U40+O(hx4), (46)
U^yyi,j=Uyyi,j+hy212U04+O(hy4), (47)
U^xxyi,j=Uxxyi,j+O(hx2+hy2), (48)
U^xyyi,j=Uxyyi,j+O(hx2+hy2), (49)
U^xxyyi,j=Uxxyyi,j+O(hx2+hy2). (50)

Executing the approximations (38)(45) in (26), (27), we get

R^i±12,j=Ri±12,j+hx224T1+hy26U03Ruy±O(hx3+hxhy2), (51)
R^i,j±12=Ri,j±12+hx26U30Rux+hy224T2±O(hy3+hyhx2), (52)

where

T1=3U20Ru+U30Rux+3U21Ruy,
T2=3U02Ru+3U12Rux+U03Ruy.

In order to obtain higher order approximations for ux and uy, let

U^^xi,j=U^xi,j+b11hx(R^i+12,jR^i12,j)+hx2(b12U^xyyi,j+b13U^xxi,j+b14U^yyi,j), (53)
U^^yi,j=U^yi,j+c11hy(R^i,j+12R^i,j12)+hy2(c12U^xxyi,j+c13U^xxi,j+c14U^yyi,j), (54)

where b1k,c1k, k=1,2,3,4 are parameters to be evaluated. Using the approximations (40), (43), (46)(52), in (53), (54), we get

U^^xi,j=Uxi,j+hx26T3+O(hx4+hx2hy2), (55)
U^^yi,j=Uyi,j+hy26T4+O(hy4+hx2hy2), (56)

where

T3=(1+6b11Φ00)U30+6(b11Ψ00+b12)U12+6(b11Φ10+b13)U20+6(b11Ψ10+b14)U02,
T4=(1+6c11Ψ00)U03+6(c11Φ00+c12)U21+6(c11Φ01+c13)U20+6(c11Ψ01+c14)U02.

Let T3=T4=0, then the values of parameters are determined by

b11=16Φ00,b12=Ψ006Φ00,b13=Φ106Φ00,b14=Ψ106Φ00
c11=16Ψ00,c12=Φ006Ψ00,c13=Φ016Ψ00,c14=Ψ016Ψ00.

The approximations (55), (56) reduce to

U^^xi,j=Uxi,j+O(hx4+hx2hy2), (57)
U^^yi,j=Uyi,j+O(hy4+hx2hy2). (58)

With the aid of the approximations (57), (58), from (33), we have

R^^i,j=Ri,j+O(hx4+hx2hy2+hy4) (59)

In order to increase the order of accuracy of the suggested method, we consider the following linear combinations:

U˜˜i,j=Ui,j+a21hx2U^xxi,j+a22hy2U^yyi,j, (60)
U˜˜xi,j=U^xi,j+b21hx(R^i+12,jR^i12,j)+hx2(b22U^xyyi,j+b23U^xxi,j+b24U^yyi,j), (61)
U˜˜yi,j=U^yi,j+c21hy(R^i,j+12R^i,j12)+hy2(c22U^xxyi,j+c23U^xxi,j+c24U^yyi,j), (62)

where a21, a22, b2k,c2k, k=1,2,3,4 are variable parameters to be found out. With the assistance of (40), (43), (46)–(52), simplifying (60)–(62), we get

U˜˜i,j=Ui,j+a21hx2Uxxi,j+a22hy2Uyyi,j+O(hx4+hy4), (63)
U˜˜xi,j=Uxi,j+hx26T5+O(hx4+hx2hy2), (64)
U˜˜yi,j=Uyi,j+hy26T6+O(hy4+hx2hy2), (65)

where

T5=(1+6b21Φ00)U30+6(b21Ψ00+b22)U12+6(b21Φ10+b23)U20+6(b21Ψ10+b24)U02,
T6=(1+6c21Ψ00)U03+6(c21Φ00+c22)U21+6(c21Φ01+c23)U20+6(c21Ψ01+c24)U02.

As a result of (63)(65), from (34), we have

R˜˜i,j=Ri,j+(a21hx2U20+a22hy2U02)Ru+hx26T5Rux+hy26T6Ruy+O(hx4+hx2hy2+hy4). (66)

By the support of Eqs. (51)(52), (59) and (66), from (35) to (37), we may acquire the following LTE:

T^i,j=hx2(116a21)U20Ruhy2(116a22)U02Ru+hx2[(1+16b21Φ00)U30+16(b21Φ10+b23)U20+16(b21Ψ10+b24)U02]Ruxhy2[116γ2(b21Ψ00+b22)]U12Ruxhy2[γ216(c21Φ00+c22)]U21Ruy+hy2[(1+16c21Ψ00)U03+16(c21Φ01+c23)U20+16(c21Ψ01+c24)U02]Ruy+O(hx4+hx2hy2+hy4). (67)

We observe that to achieve the required accuracy, the coefficients of hx2 and hy2 in (67) must be equated to zero. This leads to T^i,j=O(hx4+hx2hy2+hy4) in the domain Ω. Consequently, we obtain

a21=a22=116,b21=116Φ00,b22=(Φ00+γ2Ψ00)16γ2Φ00,b23=Φ1016Φ00,b24=Ψ1016Φ00,
c21=116Ψ00,c22=(Φ00+γ2Ψ00)16Ψ00,c23=Φ0116Ψ00,c24=Ψ0116Ψ00.

The above technique given by (35) in combination with that of [57] will lead to the FDM of order four for the quasilinear counterpart of (1). This technique so developed can be extended to produce an O(hx4+hx2hy2+hy4) approximation for BVPEs in vector-matrix system (see [33]).

The foremost advantage of the suggested technique is that it is appropriate to solve BVPEs irrespective of the coordinates system involved. No special technique or modification is required in order to obtain fourth order numerical solution near the singular points.

Convergence theory

Consider the following equation

Φuxx+Ψuyy=R(x,y,u,ux,uy), (68)

with prescribed Dirichlet boundary condition (2), assuming Φ,Ψ to be constant values. Let γ=(hxhy)= a positive constant. We now show that the FDM (35) is O(hx4) convergent when applied to (68). Throughout this subsection, i,j are integers belonging to the specified intervals.

For i,j=[1,Nx1]Z, at every (xi,yj), the proposed FDM (35) applied over Eq. (68) results in the following:

(Φ+γ2Ψ2)U8(Φ5γ2Ψ)U4+(Φ+γ2Ψ2)U6(γ2Ψ5Φ)U210(Φ+γ2Ψ)U0(γ2Ψ5Φ)U1+(Φ+γ2Ψ2)U7(Φ5γ2Ψ)U3+(Φ+γ2Ψ2)U5=2hx2[3R^^i,j+R^i+12,j+R^i12,j+R^i,j+12+R^i,j124R˜˜i,j]+T^i,j, (69)

where T^i,j=O(hx6).

At every (xi,yj), let

Bi,j=2hx2[3R^^i,j+R^i+12,j+R^i12,j+R^i,j+12+R^i,j124R˜˜i,j]+BoundaryValues,

and Ei,j=ui,jUi,j. Taking S=B,E,u,U andT^, we denote the corresponding column matrix as S, i.e.

S=[S1,1,S2,1,,SNx1,1,S1,2,S2,2,,SNx1,2,,S1,Nx1,S2,Nx1,,SNx1,Nx1](Nx1)2×1t,

t representing the transpose of the concerned matrix.

Then, the matrix form of Eq. (69) is given by:

Du+B(u)=0, (70)

where

D=[A,C,A](Nx1)2×(Nx1)2 (Tri-block-diagonal matrix) for

C=[γ2Ψ5Φ,10(Φ+γ2Ψ),γ2Ψ5Φ](Nx1)×(Nx1) (Tri-diagonal matrix)

A=[(Φ+γ2Ψ2),Φ5γ2Ψ,(Φ+γ2Ψ2)](Nx1)×(Nx1) (Tri-diagonal matrix) with the following assumptions:

γ2Ψ5Φ>0, (71)
Φ5γ2Ψ>0, (72)

which yield Φ>0 and Ψ>0. Hence, D has all positive diagonal elements and all negative off-diagonal elements.

Also, we know that

DU+B(U)+T^=0, (73)

U being the exact solution vector, and T^i,j=O(hx6).

Now, let

r^i±12,j=R(xi±12,yj,u^i±12,j,u^xi±12,j,u^yi±12,j)R^i±12,j,
r^i,j±12=R(xi,yj±12,u^i,j±12,u^xi,j±12,u^yi,j±12)R^i,j±12,
r^^i,j=R(xi,yj,ui,j,u^^xi,j,u^^yi,j)R^^i,j,
r˜˜i,j=R(xi,yj,u˜˜i,j,u˜˜xi,j,u˜˜yi,j)R˜˜i,j.

Then, it is easy to obtain the following:

r^i±12,jR^i±12,j=(u^i±12,jU^i±12,j)Gi±12,j(1)+(u^xi±12,jU^xi±12,j)Hi±12,j(1)+(u^yi±12,jU^yi±12,j)Ii±12,j(1), (74)
r^i,j±12R^i,j±12=(u^i,j±12U^i,j±12)Gi,j±12(2)+(u^xi,j±12U^xi,j±12)Hi,j±12(2)++(u^yi,j±12U^yi,j±12)Ii,j±12(2), (75)
r^^i,jR^^i,j=(u^^xi,jU^^xi,j)Hi,j(3)+(u^^yi,jU^^yi,j)Ii,j(3), (76)
r˜˜i,jR˜˜i,j=(u˜˜i,jU˜˜i,j)Gi,j(3)+(u˜˜xi,jU˜˜xi,j)Hi,j(3)+(u˜˜yi,jU˜˜yi,j)Ii,j(3), (77)

for appropriate values of Qi±12,j(1), Qi,j±12(2) and Qi,j(3), where Q=G, H and I.

Further, for Q=H and I, we observe that

Qi±12,j(1)=Qi,j(1)±hx2(Q(1)x)i,j+O(hx2), (78)
Qi,j±12(2)=Qi,j(2)±hx2γ(Q(2)y)i,j+O(hx2) (79)

and

Gi±12,j(1)=Gi,j(1)±O(hx), (80)
Gi,j±12(2)=Gi,j(2)±O(hx). (81)

Thus, using the Eqs. (74)(81), we get

B(u)B(U)=FE, (82)

where F=(Fζ,η), [ζ,η=1,2,,(Nx1)2] is the block tri-diagonal matrix such that:

F(j1)(Nx1)+i,(j1)(Nx1)+i=hx2[2Gi,j(1)+2Gi,j(2)6Gi,j(3)+1ΦHi,j(1)Hi,j(3)+1ΨIi,j(2)Ii,j(3)2(H(1)x)i,j2γ(I(2)y)i,j]+O(hx4);i,j[1,Nx1]Z,
F(j1)(Nx1)+i,(j1)(Nx1)+i±1=hx[±2Hi,j(1)±Hi,j(2)12(1+Ψγ2Φ)Hi,j(3)]+hx22[2Gi,j(1)+2(H(1)x)i,jGi,j(3)1ΦHi,j(1)Hi,j(3)]+O(hx3);{i[1,Nx2]Z,j[1,Nx1]Z},{i[2,Nx1]Z,j[1,Nx1]Z},
F(j1)(Nx1)+i,(j1±1)(Nx1)+i==hx2[±2γIi,j(1)±4γIi,j(2)(γ+ΦΨγ)Ii,j(3)]+hx22[2Gi,j(2)Gi,j(3)+2γ(I(2)y)i,j1ΨIi,j(2)Ii,j(3)]+O(hx3);{i[1,Nx1]Z,j[1,Nx2]Z},{i[1,Nx1]Z,j[2,Nx1]Z},
F(j1)(Nx1)+i,j(Nx1)+i±1=hx4[2γIi,j(1)±2Hi,j(2)±(Ψγ2Φ1)Hi,j(3)+(γ+ΦΨγ)Ii,j(3)]+hx28[±2γ(I(1)x)i,j±2(H(2)y)i,jγΦIi,j(1)Hi,j(3)1ΨγHi,j(2)Ii,j(3)]+O(hx3);{i[1,Nx2]Z,j[1,Nx2]Z},{i[2,Nx1]Z,j[1,Nx2]Z},
F(j1)(Nx1)+i,(j2)(Nx1)+i±1=hx4[2γIi,j(1)±2Hi,j(2)±(Ψγ2Φ1)Hi,j(3)+(γΦγΨ)Ii,j(3)]+hx28[2γ(I(1)x)i,j2(H(2)y)i,j±γΦIi,j(1)Hi,j(3)±1ΨγHi,j(2)Ii,j(3)]+O(hx3);{i[1,Nx2]Z,j[2,Nx1]Z},{i[2,Nx1]Z,j[2,Nx1]Z},

Using Eqs. (70) and (73), with the aid of (82), we obtain

(D+F)E=T,^ (83)

which is called the error equation.

Assuming Ω¯=ΩΩ, let

G*=Min (Ru) on Ω¯ and G*=Max (Ru) on Ω¯.

Then, clearly

0<G*Gi±12,j(1),Gi,j±12(2),Gi,j(3)G*.

Further, for Q=H and I, let

0<|Qi±12,j(1)|,|Qi,j±12(2)|,|Qi,j(3)|Q

and

|(Q(1)x)i,j|Q(1)and|(Q(2)y)i,j|Q(2),

Q, Q(1), Q(2)>0 being constants.

Hence, for appropriately small values of hx,

|F(j1)(Nx1)+i,(j1)(Nx1)+i|<10(Φ+γ2Ψ);i,j[1,Nx1]Z,
|F(j1)(Nx1)+i,(j1)(Nx1)+i±1|<γ2Ψ5Φ,{i[1,Nx2]Z,j[1,Nx1]Z},{i[2,Nx1]Z,j[1,Nx1]Z},
|F(j1)(Nx1)+i,(j1±1)(Nx1)+i|<γ2Ψ5Φ,{i[1,Nx1]Z,j[1,Nx2]Z},{i[1,Nx1]Z,j[2,Nx1]Z},
|F(j1)(Nx1)+i,j(Nx1)+i±1|<(Φ+γ2Ψ2),{i[1,Nx2]Z,j[1,Nx2]Z},{i[2,Nx1]Z,j[1,Nx2]Z},
|F(j1)(Nx1)+i,(j2)(Nx1)+i±1|<(Φ+γ2Ψ2);{i[1,Nx2]Z,j[2,Nx1]Z},{i[2,Nx1]Z,j[2,Nx1]Z}.

It can be seen D+F is an irreducible matrix, since it has strongly connected directed graph (see Varga [3]).

Now, let us assume that Sl denotes the sum of the lth row entries of the matrix D+F. It is easy to obtain the following:

For l=1,Nx1:

Sl=11(γ2Ψ+Φ)2+hx2(3Gl,1(1)+3Gl,1(2)7Gl,1(3))+hx8(bl+hxcl)+O(hx3), (84)

where

bl=±16Hl,1(1)±12Hl,1(2)(6+2Ψγ2Φ)Hl,1(3)+12γIl,1(1)+16γIl,1(2)2(3γ+ΦΨγ)Il,1(3),
cl=4ΦHl,1(1)Hl,1(3)+4ΨIl,1(2)Il,1(3)8(H(1)x)l,18γ(I(2)y)l,1γΦIl,1(1)Hl,1(3)1ΨγIl,1(3)Hl,1(2)±2γ(I(1)x)l,1±2(H(2)y)l,1.
S(Nx1)(Nx2)+l=11(γ2Ψ+Φ)2+hx22(3Gl,Nx1(3)+3Gl,Nx1(2)7Gl,Nx1(3))+hx8(bl+hxcl)+O(hx3), (85)

where

bl=±16Hl,Nx1(1)±12Hl,Nx1(2)2(3+Ψγ2Φ)Hl,Nx1(3)12γIl,Nx1(1)16γIl,Nx1(1)16γIl,Nx1(2)+(3γ+ΦΨγ)Il,Nx1(3),
cl=4ΦHl,Nx1(1)Hl,Nx1(3)+4ΨIl,Nx1(2)Il,N1(3)±γΦIl,Nx1(1)Hk,Nx1(3)±1ΨγIl,Nx1(3)Hl,Nx1(2)8(H(1)x)l,Nx18γ(I(2)y)l,Nx12γ(I(1)x)l,Nx12(H(2)y)l,Nx1.

For q[2,Nx2]Z

S(q1)(Nx1)+l=6Φ+hx22[6Gl,q(1)+8Gl,q(2)15Gl,q(3)]+hx2[b(q1)(Nx1)+l+hxc(q1)(Nx1)+l]+O(hx3), (86)

where

b(q1)(Nx1)+l=±4Hl,q(2)±4Hl,q(1)2Hl,q(3),
c(q1)(Nx1)+l=2(H(1)x)l,q+1ΦHl,q(1)Hl,q(3).

For r[2,Nx2]Z

S(l1)(Nx1)+r=6γ2Ψ+hx22[8Gr,l(1)+6Gr,l(2)15Gr,l(3)]+hx2[b(l1)(Nx1)+r+hxc(l1)(Nx1)+r]++O(hx3), (87)

where

b(l1)(Nx1)+r=±4γIr,l(1)±4γIr,l(2)2γIr,l(3),
c(l1)(Nx1)+r=2γ(I(2)y)r,l+1ΨIr,l(2)Ir,l(3).

Also, for q,r[2,Nx2]Z

S(r1)(Nx1)+q=4hx2[Gq,r(1)+Gq,r(2)2Gq,r(2)]+O(hx4). (88)

Using the Eqs. (85)(88), we obtain

|bl|(34+2Ψγ2Φ)H+(34γ+2ΦΨγ)I,
|cl|4H2Φ+4I2Ψ+(γΦ+1Ψγ)HI+8[H(1)+I(2)]+2[γI(1)+H(2)]

for l=1,Nx1,(Nx1)(Nx2)+1,(Nx1)2.

|bl|10H,
|cl|2H+H2Φ

for l=(q1)(Nx1)+1 and l=q(Nx1), such that q[2,Nx2]Z.

|bl|10γH,
|cl|2I+I2Ψ

for l=r and l=(Nx1)(Nx2)+r, such that r[2,Nx2]Z.

Thus, using appropriately small values of hx,

Sl>C1hx2,

where C1>0 is a constant, and l=1,Nx1,(Nx1)(Nx2)+1,(Nx1)2.

Sl>C2hx2,

where constant C2>0 is a constant, and l=(q1)(Nx1)+1,q(Nx1) such that

q[2,Nx2]Z.
Sl>C3hx2,

where C3>0 is a constant, and l=r,(Nx1)(Nx2)+rsuch that r[2,Nx2]Z.

S(r1)(N2)+qC4hx2,

where C4>0 is a constant, under the assumption that for each q,r, Cq,r=Gq,r(1)+Gq,r(2)2Gq,r(3)>0, such that q,r[2,Nx2]Z.

Hence, D+F is monotone and its inverse exists (Henrici [58]). Assuming (D+F)1=K1, where K=(Ki,j), for 1i,j(Nx1)2.

We know that m=1(Nx1)2Kp,mSm=1, hence for p=1,2,,(Nx1)2 we obtain

Kp,l1Sl<1C1hx2, (89)

for l=1,Nx1,(Nx1)(Nx2)+1,(Nx1)2.

q=2Nx2Kp,l<2C2hx2, (90)

for l=(q1)(Nx1)+1,q(Nx1),q=1,2,,Nx2.

r=2Nx2Kp,l<2C3hx2, (91)

for l=r,(Nx1)(Nx2)+r,r=1,2,,Nx2.

q=2Nx2r=2Nx2Kp,l1C4hx2, (92)

for l=(r1)(Nx1)+qandq,r=1,2,,Nx2.

From Eq. (83), we obtain

EKT^, (93)

where

K=Max1m(Nx1)2[(Km,1+q=2Nx2Km,q+Km,Nx1)+(q=2Nx2Km,(q1)(Nx1)+1+q=2Nx2r=2Nx2Km,(q1)(Nx1)+r+q=2Nx2Km,q(Nx1))+(Km,(Nx1)(Nx2)+1+q=2N2Km,(Nx1)(Nx2)+q+Km,(Nx1)2)] (94)

Thus, using Eqs. (89)(92) and (94) in (93), for suitably small values of hx, we obtain

EO(hx4). (95)

Hence, O(hx4) accuracy of the developed FDM over (68) is established.

Validation of the proposed FDM

We solve six benchmark problems of physical significance, whose closed-form solutions are known. The boundary values and the right-hand side function of independent variables can be obtained using the given closed-form solution. We use appropriate iteration methods to solve the resultant system of difference equations. The initial approximation 0 is considered for all problems.

Problem 1

(Poisson's equation in r-z plane)

urr+uzz+1rur=g(r,z),0<z<e,0<r<1. (96)

The solution in closed-form isu(r,z)=coshr.coshz. Eq. (95) solves for the potential field, the gravitational field or the pressure field in fluid dynamics. The Maximum Absolute Errors (MAEs) are reported in Table 1. Fig. 1a and b portray the closed-form and computational solutions, respectively, for Nx=Ny=40.

Table 1.

(Problem 1): The MAEs.

Nx=Ny Proposed Method Method [56] Method [35] Method [36]
20 8.1827(−09) 1.6787(−08) 6.8123(−04) 6.8577(−04)
40 5.1496(−10) 1.1201(−09) 1.7276(−04) 1.7844(−04)
80 3.2209(−11) 7.1160(−11) 4.3891(−05) 4.4756(−05)

Fig. 1.

Fig 1

a: Nx=Ny = 40, the analytical solution. b: Nx=Ny = 40, the approximate solution.

Problem 2

(Poisson's equation in r-θ plane)

urr+1r2uθθ+1rur=g(r,θ),0<r<1,0<θ<π. (97)

The closed-form solution isu(r,θ)=r2cosθ. In Table 2, the MAEs are charted. The exact and computational solutions are graphed in Fig. 2a and b, respectively, for Nx=Ny= 40.

Table 2.

(Problem 2): The MAEs.

Nx=Ny Proposed Method Method [56] Method [35] Method [36]
20 1.0180(−08) 7.1575(−08) 4.1614(−05) 4.2123(−05)
40 6.4137(−10) 4.4011(−09) 1.0162(−05) 1.1188(−05)
80 4.0585(−11) 2.7257(−10) 2.5098(−06) 2.5816(−06)

Fig. 2.

Fig 2

a: Nx=Ny = 40, the analytical solution. b: Nx=Ny = 40, the approximate solution.

Problem 3

(Burgers' equation in x-y plane)

ν(uxx+uyy)=u(ux+uy)+g(x,y),0<x<12,0<y<1. (98)

The exact solution in closed-form is u(x,y)=ex.sin(πy). The Eq. (97) represents a turbulent flow. The solution u depicts the speed of the fluid at each spatial coordinate (x,y), in a steady state. In Table 3, the MAEs are given. The closed-form and computational values are portrayed in Fig. 3a and b, respectively, for ν=0.01,Nx=Ny= 40.

Table 3.

(Problem 3): The MAEs.

Nx=Ny Proposed Method
Method [56]
Method [35], Method [36]
ν=0.01 ν=0.001 ν=0.01 ν=0.001 ν=0.01,0.001
20 1.1522(−06) 5.3437(−06) 5.3311(−06) 1.4276(−05) Unstable
40 7.2051(−08) 3.3533(−07) 3.3019(−07) 8.9755(−07) Unstable
80 4.5439(−09) 2.1190(−08) 2.0567(−08) 5.5923(−08) Unstable

Fig. 3.

Fig 3

a: Nx=Ny = 40, ν =0.01, the analytical solution. b: Nx=Ny = 40, ν =0.01, the approximate solution.

Problem 4

(NS equations in rectangular form)

1Re(uxx+uyy)=uux+vuy+F(x,y),0<x<1,0<y<12, (99a)
1Re(vxx+vyy)=uvx+vvy+G(x,y),0<x<1,0<y<12. (99b)

The analytical solution of the above coupled equations is u(x,y)=sin(πx)sin(πy), v(x,y)=cos(πx)cos(πy). The solution u = (u, v) represents the velocity of the fluid at each spatial coordinate (x,y), in a steady state. Table 4 shows the MAEs. The analytical and computational solutions for u and v are graphed in Fig. 4a–d for Nx=Ny= 40 and Re=104.

Table 4.

(Problem 4): The MAEs.

Nx=Ny Proposed Method
Method [56]
Method [35], Method [36]
Re=102 Re=104 Re=102 Re=104 Re=102,104
20 u 7.6329(−06) 2.2697(−03) 3.0187(−05) 2.7914(−03) Unstable
v 6.8159(−06) 1.7877(−03) 1.4415(−05) 2.4822(−03)
40 u 4.7752(−07) 1.4276(−04) 1.8831(−06) 1.7423(−04) Unstable
v 4.2861(−07) 1.1255(−04) 9.0549(−07) 1.6515(−04)
80 u 2.9987(−08) 8.9755(−06) 1.1785(−07) 1.0844(−05) Unstable
v 2.6949(−08) 7.1082(−06) 5.5772(−08) 1.0095(−05)

Fig. 4.

Fig 4

a: Nx=Ny = 40, Re=104, the analytical solution u. b: Nx=Ny = 40, Re=104, the numerical solution U. c: Nx=Ny = 40, Re=104, the analytical solution v. d: Nx=Ny = 40, Re=104, the numerical solution V.

Problem 5

(NS equations in cylindrical form)

1Re(urr+1rur+uzz1r2u)=uur+vuz+F(r,z),0<z<2,0<r<1, (100a)
1Re(vrr+1rvr+vzz)=uvr+vvz+G(r,z),0<z<2,0<r<1. (100b)

The analytical solution of the above coupled equations is u(r,z)=r3sinhz, v(r,z)=4r2coshz. The solution u = (u, v) represents the velocity of the fluid at each spatial coordinate (r,z), in a steady state. Table 5 illustrates the MAEs. Fig. 5a–d represent the analytical and computational solutions obtained with Nx=Ny= 40 and Re=103.

Table 5.

(Problem 5): The MAEs.

Nx=Ny Proposed Method
Method [56]
Method [35], Method [36]
Re=102 Re=103 Re=102 Re=103 Re=102,103
20 u 7.5524(−06) 4.6032(−04) 2.9077(−05) 2.1550(−03) Unstable
v 4.7149(−06) 3.8555(−04) 1.6887(−05) 1.7179(−03)
40 u 4.6978(−07) 2.8856(−05) 1.7913(−06) 1.3304(−04) Unstable
v 2.9582(−07) 2.4389(−05) 1.1301(−06) 1.0721(−04)
80 u 2.9461(−08) 1.8165(−06) 1.1042(−07) 8.3305(−06) Unstable
v 1.8594(−08) 1.5378(−06) 7.0160(−08) 6.6892(−06)

Fig. 5.

Fig 5

a: Nx=Ny = 40, Re=103, the analytical solution u. b: Nx=Ny = 40, Re=103, the numerical solution U. c: Nx=Ny = 40, Re=103, the analytical solution v. d: Nx=Ny = 40, Re=103, the approximate solution V.

Problem 6

(Quasi-linear elliptic equation)

uxx+(1+u2)uyy=u(ux+uy)+F(x,y),0<x<e,0<y<π2. (101)

This is a general equation to depict the applicability of our methods over quasi-linear counterpart of BVPEs in concern. The analytical solution in closed form is u(x,y)=exsiny. In Table 6, the MAEs are shown. The closed-form and computational solutions are graphed in Fig. 6a and b with Nx=Ny= 40.

Table 6.

(Problem 6): The MAEs.

Nx=Ny Proposed Method Method [56] Method [35] Method [36]
20 6.6937(−06) 2.3722(−05) 2.3172(−04) 2.3868(−04)
40 4.2085(−07) 1.4792(−06) 5.8201(−05) 5.8816(−05)
80 2.6148(−08) 9.2983(−08) 1.4469(−05) 1.5275(−05)

Fig. 6.

Fig 6

a: Nx=Ny = 40, the analytical solution. b: Nx=Ny = 40, the numerical solution.

In summarization, the proposed stable higher order method provides tremendous practical advantage in terms of diminishing the required number of storages in comparison to lower order methods and also the overall computing time for a desired solution. The order of accuracy of the obtained solution is O(hx4+hx2hy2+hy4). When hx is proportional to hy, the order becomes eitherO(hx4) or O(hy4), since hx=γhy,γ1. The order of accuracy of the method developed in this article is O(hx4+hx2hy2+hy4). When hx is proportional to hy, the order becomes eitherO(hx4) or O(hy4), since hx=γhy,γ1. The rate of convergence is given by

log(Ehx1Ehx2)log(hx1hx2), (101)

Ehx1 and Ehx2 being the MAEs for two different mesh sizes hx1=xαNx1and hx2=xβNx2, respectively. For calculation of rate of convergence, we have chosen, Nx1=40 and Nx2=80. and the results are reported in Table 7.

Table 7.

(The rate of convergence): hx1=xα40,hx2=xα80.

Problem Involved parameters Order
1 3.99
2 3.98
3 ν=0.01 3.98
ν=0.001 3.98
4 Re=102 for u 3.99
for v 3.99
Re=104 for u 3.99
for v 3.98
5 Re=102 for u 3.98
for v 3.99
Re=103 for u 3.99
for v 3.98
6 4.00

The log-log error plots of the MAEs provided in the second column of Table 1, Table 2, Table 3, Table 4, Table 5, Table 6 are represented in Fig. 7.

Fig. 7.

Fig 7

Order of Convergence: Problem 1 to Problem 6.

The computational results applied over some benchmark problems of high importance confirmed that stable solution near the singular point is generated even for high Reynolds number. It has been observed that the MAEs reduce by about 1/24, when the grid size hx reduced to hx/2. The fourth-order convergence of the suggested method is endorsed by the computational results. The graphs of the numerical and analytical solutions appear identical. The proposed method is useful to construct a new method in exponential form for 3D nonlinear BVPEs on an unequal mesh.

Data availability

No data was used for the research described in the article.

CRediT authorship contribution statement

Nikita Setia: Conceptualization, Data curation, Formal analysis, Funding acquisition, Investigation, Resources, Software, Validation, Visualization, Writing – original draft, Writing – review & editing. R.K. Mohanty: Conceptualization, Funding acquisition, Investigation, Methodology, Project administration, Supervision, Writing – review & editing.

Declaration of Competing Interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Acknowledgments

This work is supported by ‘South Asian University, New Delhi’ and ‘Shaheed Bhagat Singh College, University of Delhi’. This research did not receive any specific grant from funding agencies in the public, commercial, or not-for-profit sectors.

Footnotes

Direct Submission or Co-submission: Direct Submission

Data Availability

  • No data was used for the research described in the article.

References

  • 1.Birkhoff G., Lynch R.E. SIAM Publications; Philadelphia: 1984. The Numerical Solution of Elliptic Problems. [Google Scholar]
  • 2.Kelly C.T. SIAM; Philadelphia: 1995. Iterative Methods for Linear and Non-Linear Equations. [Google Scholar]
  • 3.Varga R.S. Springer; New York: 2000. Matrix Iterative Analysis. [Google Scholar]
  • 4.Saad Y. SIAM; Philadelphia: 2003. Iterative Methods for Sparse Linear Systems. [Google Scholar]
  • 5.Hageman L.A., Young D.M. Dover; New York: 2004. Applied Iterative Methods. [Google Scholar]
  • 6.Böhmer K. Oxford University Press; Oxford: 2010. Numerical Methods for Nonlinear Elliptic Differential Equations: A Synopsis. [Google Scholar]
  • 7.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. 1989;5:87–95. doi: 10.1002/num.1690050203. [DOI] [Google Scholar]
  • 8.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. 1991;7:227–244. doi: 10.1002/num.1690070303. [DOI] [Google Scholar]
  • 9.Mohanty R.K. Fourth order finite difference methods for the system of 2D nonlinear elliptic equations with variable coefficients. Int. J. Comput. Math. 1992;46:195–206. doi: 10.1080/00207169208804150. [DOI] [Google Scholar]
  • 10.Jain M.K., Jain R.K., Krishna M. Fourth order difference method for quasi-linear poisson equation in cylindrical symmetry. Commun. Numer. Methods Eng. 1994;10:291–296. doi: 10.1002/cnm.1640100403. [DOI] [Google Scholar]
  • 11.Saldanha G., Ananthakrishnaiah U. A fourth order finite difference scheme for two-dimensional non-linear elliptic partial differential equations. Numer. Methods Partial Differ. Equ. 1995;11:33–40. doi: 10.1002/num.1690110104. [DOI] [Google Scholar]
  • 12.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. 1995;20(10):1137–1151. doi: 10.1002/fld.1650201003. [DOI] [Google Scholar]
  • 13.Spotz W.F., Carey G.F. High order compact scheme for the steady stream function vorticity equations. Int. J. Numer. Methods Eng. 1995;38:3497–3512. doi: 10.1002/nme.1620382008. [DOI] [Google Scholar]
  • 14.Carey G.F. Taylor and Francis; Washington, DC: 1997. Computational Grids: Generation, Adaption and Solution Strategies. [Google Scholar]
  • 15.Mohanty R.K. Order h4 difference methods for a class of singular two-space dimensional elliptic boundary value problems. J. Comput. Appl. Math. 1997;81:229–247. doi: 10.1016/s0377-0427(97)00058-7. [DOI] [Google Scholar]
  • 16.Yavneh I. Analysis of a fourth-order compact scheme for convection diffusion. J. Comput. Phys. 1997;133(2):361–364. doi: 10.1006/jcph.1997.5659. [DOI] [Google Scholar]
  • 17.Zhang J. On convergence of iterative methods for a fourth-order discretization scheme. Appl. Math. Lett. 1997;10:49–55. doi: 10.1016/s0893-9659(97)00010-4. [DOI] [Google Scholar]
  • 18.Zhang J. On convergence and performance of iterative methods with fourth order compact schemes. Numer. Methods Partial Differ. Equ. 1998;14(2):263–280. doi: 10.1002/(sici)1098-2426(199803)14. [DOI] [Google Scholar]
  • 19.Yanwen M., Dexun F., Kobayashi T., Taniguchi N. Numerical solution of the incompressible Navier-Stokes equations with an upwind compact difference scheme. Int. J. Numer. Methods Fluids. 1999;30(5):509–521. doi: 10.1002/(sici)1097-0363(19990715)30. [DOI] [Google Scholar]
  • 20.Mohanty R.K., Dey S. A new finite difference discretization of order four for (∂u/∂n) for two-dimensional quasi-linear elliptic boundary value problems. Int. J. Comput. Math. 2001;76:505–576. doi: 10.1080/00207160108805043. [DOI] [Google Scholar]
  • 21.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. 2001;17:43–53. doi: 10.1002/1098-2426(200101)17. [DOI] [Google Scholar]
  • 22.Tian Z., Ge Y. A fourth order compact finite difference scheme for the steady stream function-vorticity formulation of the Navier-Stokes/Boussinesq equations. Int. J. Numer. Methods Fluids. 2003;41(5):495–518. doi: 10.1002/fld.444. [DOI] [Google Scholar]
  • 23.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. 2006;50:421–436. doi: 10.1002/fld.1061. [DOI] [Google Scholar]
  • 24.Mohanty R.K., Singh S. A new fourth order discretization for singularly perturbed two-dimensional non-linear elliptic boundary value problems. Appl. Math. Comput. 2006;175:1400–1414. doi: 10.1016/j.amc.2005.08.023. [DOI] [Google Scholar]
  • 25.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. 2007;188:1371–1388. doi: 10.1016/j.amc.2006.11.028. [DOI] [Google Scholar]
  • 26.Liu J., Wang C. A fourth order numerical method for the primitive equations formulated in mean vorticity. Commun. Comput. Phys. 2008;4:26–55. [Google Scholar]
  • 27.Fairweather G., Ma H., Sun W. Orthogonal spline collocation methods for the stream function-vorticity formulation of the Navier-Stokes equations. Numer. Methods Partial Differ. Equ. 2008;24:449–464. doi: 10.1002/num.20269. [DOI] [Google Scholar]
  • 28.Ito K., Qiao Z. A high order compact MAC finite difference scheme for the Stokes equations: augmented variable approach. J. Comput. Phys. 2008;227:8177–8190. doi: 10.1016/j.jcp.2008.05.021. [DOI] [Google Scholar]
  • 29.Böhmer K. On finite element methods for fully nonlinear elliptic equations of second order. SIAM J. Numer. Anal. 2008;46(3):1212–1249. doi: 10.1137/040621740. [DOI] [Google Scholar]
  • 30.Feng X., Neilan M. Vanishing moment method and moment solution for fully nonlinear second order partial differential equations. J. Sci. Comput. 2009;38:78–98. doi: 10.1007/s10915-008-9221-9. [DOI] [Google Scholar]
  • 31.Shah A., Yuan L. Flux-difference splitting based upwind compact schemes for the incompressible Navier-Stokes equations. Int. J. Numer. Methods Fluids. 2009;61:552–568. doi: 10.1002/fld.1965. [DOI] [Google Scholar]
  • 32.Tian Z., Liang X., Yu P. A higher order compact finite difference algorithm for solving the incompressible Navier-Stokes equations. Int. J. Numer. Methods Eng. 2011;88:511–532. doi: 10.1002/nme.3184. [DOI] [Google Scholar]
  • 33.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;2013:1–29. doi: 10.1186/1687-1847-2013-223. [DOI] [Google Scholar]
  • 34.Zhai S., Feng X., He Y. A new method to deduce high-order compact difference schemes for two-dimensional Poisson equation. Appl. Math. Comput. 2014;230:9–26. doi: 10.1016/j.amc.2013.12.096. [DOI] [Google Scholar]
  • 35.Mohanty R.K., Kumar R. A novel numerical algorithm of Numerov type for 2D quasilinear elliptic boundary value problems. Int. J. Comput. Methods Eng. Sci. Mech. 2014;15:473–489. doi: 10.1080/15502287.2014.934488. [DOI] [Google Scholar]
  • 36.Mohanty R.K., Setia N. A new compact off-step discretization for the system of 2D quasilinear elliptic equations on unequal mesh. Comput. Math. Model. 2014;25:381–403. doi: 10.1007/s10598-014-9234-1. [DOI] [Google Scholar]
  • 37.Papanikos G., Gousidou-Koutita G.M.C. A computational study with finite element method and finite difference method for 2D elliptic partial differential equations. Appl. Math. 2015;6(12):2104. doi: 10.4236/am.2015.612185. Irvine. [DOI] [Google Scholar]
  • 38.Oberman A.M., Zwiers I. Adaptive finite difference methods for nonlinear elliptic and parabolic partial differential equations with free boundaries. J. Sci. Comput. 2016;68(1):231–251. doi: 10.1007/s10915-015-0137-x. [DOI] [Google Scholar]
  • 39.Mittal H.V.R., Kalita J.C., Ray R.K. A class of finite difference schemes for interface problems with an HOC approach. Int. J. Numer. Methods Fluids. 2016;82(9):567–606. doi: 10.1002/fld.4231. [DOI] [Google Scholar]
  • 40.Gavete L., Benito J.J., Ureña F. Generalized finite differences for solving 3D elliptic and parabolic equations. Appl. Math. Model. 2016;40(2):955–965. doi: 10.1016/j.apm.2015.07.003. [DOI] [Google Scholar]
  • 41.Gavete L., Ureña F., Benito J.J., García A., Ureña M., Salete E. Solving second order non-linear elliptic partial differential equations using generalized finite difference method. J. Comput. Appl. Math. 2017;318:378–387. doi: 10.1016/j.cam.2016.07.025. [DOI] [Google Scholar]
  • 42.Bayona V., Flyer N., Fornberg B., Barnett G.A. On the role of polynomials in RBF-FD approximations: II. numerical solution of elliptic PDEs. J. Comput. Phys. 2017;332:257–273. doi: 10.1016/j.jcp.2016.12.008. [DOI] [Google Scholar]
  • 43.Hamfeldt B.F., Salvador T. Higher-order adaptive finite difference methods for fully nonlinear elliptic equations. J. Sci. Comput. 2018;75(3):1282–1306. doi: 10.1007/s10915-017-0586-5. [DOI] [Google Scholar]
  • 44.Mittal H.V.R., Ray R.K. Solving immersed interface problems using a new interfacial points-based finite difference approach. SIAM J. Sci. Comp. 2018;40(3):A1860–A1883. doi: 10.1137/16m1106006. [DOI] [Google Scholar]
  • 45.Raeli A., Bergmann M., Iollo A. A finite-difference method for the variable coefficient poisson equation on hierarchical cartesian meshes. J. Comput. Phys. 2018;355:59–77. doi: 10.1016/j.jcp.2017.11.007. [DOI] [Google Scholar]
  • 46.Pandey P.K., Jaboob S.S.A. A finite difference method for a numerical solution of elliptic boundary value problems. Appl. Math. Nonlinear Sci. 2018;3(1):311–320. doi: 10.21042/amns.2018.1.00024. [DOI] [Google Scholar]
  • 47.Zhang F., Cheng J., Liu T. A higher order discontinuous Galerkin method for the incompressible Navier-Stokes equations on arbitrary grid. Int. J. Numer. Methods Fluids. 2019;90:217–246. doi: 10.1002/fld.4718. [DOI] [Google Scholar]
  • 48.Mohanty R.K., Manchanda G., Khan A. Operator compact exponential approximation for the solution of the system of 2D second order quasi-linear elliptic partial differential equations. Adv. Differ. Equ. 2019;2019 doi: 10.1186/s13662-019-1968-9. ID: 47. [DOI] [Google Scholar]
  • 49.Mohanty R.K., Manchanda G., Khan A. Compact half step approximation in exponential form for 2D second order quasi-linear elliptic partial differential equations. J. Differ. Equ. Appl. 2019;25:716–749. doi: 10.1080/10236198.2019.1624737. [DOI] [Google Scholar]
  • 50.Oruç Ö. A meshfree computational approach based on multiple-scale pascal polynomials for numerical solution of a 2D elliptic problem with nonlocal boundary conditions. Int. J. Comput. Methods. 2020;17(10) doi: 10.1142/s0219876219500804. [DOI] [Google Scholar]
  • 51.Milewski S. Higher order schemes introduced to the meshless FDM in elliptic problems. Eng. Anal. Bound. Elem. 2020;131:100–117. doi: 10.1016/j.enganabound.2021.06.010. [DOI] [Google Scholar]
  • 52.Li H., Zhang X. Superconvergence of high order finite difference schemes based on variational formulation for elliptic equations. J. Sci. Comput. 2020;82(2):1–39. doi: 10.1007/s10915-020-01144-w. [DOI] [Google Scholar]
  • 53.Mohanty R.K., Manchanda G., Khurana G., Khan A. A new third order exponentially fitted discretization for the solution of non-linear two point boundary value problems on a graded mesh. J. Appl. Anal. Comput. 2020;10:1741–1770. doi: 10.11948/20190187. [DOI] [Google Scholar]
  • 54.Mohanty R.K., Manchanda G., Khan A., Khurana G. A new high accuracy method in exponential form based on off-step discretization for non-linear two point boundary value problems. J. Differ. Equ. Appl. 2020;26:171–202. doi: 10.1080/10236198.2019.1710140. [DOI] [Google Scholar]
  • 55.Manchanda G., Mohanty R.K., Khan A. A high accuracy compact semi-constant mesh off-step discretization in exponential form for the solution of non-linear elliptic boundary value problems. J. Differ. Equ. Appl. 2021;27:531–556. doi: 10.1080/10236198.2021.1920936. [DOI] [Google Scholar]
  • 56.Priyadarshini I., Mohanty R.K. High resolution half-step compact numerical approximation for 2D quasilinear elliptic equations in vector form and the estimates of normal derivatives on an irrational domain. Soft Comput. 2021;25:9967–9991. doi: 10.1007/s00500-020-05505-3. [DOI] [Google Scholar]
  • 57.Priyadarshini I., Mohanty R.K. High resolution compact numerical method for the system of 2D quasilinear elliptic boundary value problems and the solution of normal derivatives on an irrational domain with engineering applications. Eng. Comput. 2020;38:539–560. doi: 10.1007/s00366-020-01150-4. [DOI] [Google Scholar]
  • 58.Henrici P. Wiley; New York: 1962. Discrete Variable Methods in Ordinary Differential Equations. [Google Scholar]
  • 59.Mohanty R.K., Setia N., Khurana G., Manchanda G. High precision compact numerical approximation in exponential form for the system of 2D quasilinear elliptic BVPs on a discrete irrational region. MethodsX. 2022;9 doi: 10.1016/j.mex.2022.101790. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 60.Aziz I., Siraj-ul-Islam, Šarler B. Wavelets collocation methods for the numerical solution of elliptic BV problems. Appl. Math. Model. 2013;37(3):676–694. doi: 10.1016/j.apm.2012.02.046. [DOI] [Google Scholar]
  • 61.Siraj-ul-Islam, Aziz I., Ahmad M. Numerical solution of two-dimensional elliptic PDEs with nonlocal boundary conditions. Comput. Math. Appl. 2015;69(3):180–205. doi: 10.1016/j.camwa.2014.12.003. [DOI] [Google Scholar]
  • 62.Aziz I., Siraj-ul-Islam, Asif M. Haar wavelet collocation method for three-dimensional elliptic partial differential equations. Comput. Math. Appl. 2017;73(9):2023–2034. doi: 10.1016/j.camwa.2017.02.034. [DOI] [Google Scholar]
  • 63.Nadeem H., Aziz I., Siraj-ul-Islam Numerical solution of 2D and 3D elliptic-type interface models with regular interfaces. Eng. Comput. 2019;35(3):1081–1102. doi: 10.1007/s00366-018-0652-0. [DOI] [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Data Availability Statement

No data was used for the research described in the article.

  • No data was used for the research described in the article.


Articles from MethodsX are provided here courtesy of Elsevier

RESOURCES