# New Perspective on the Conventional Solutions of the Nonlinear Time-Fractional Partial Differential Equations

Authors: Hijaz Ahmad; Ali Akgül; Tufail A. Khan; Predrag S. Stanimirović; Yu-Ming Chu
Journal: Complexity
 (2020)

---

## Abstract

The role of integer and noninteger order partial differential equations (PDE) is essential in applied sciences and engineering. Exact solutions of these equations are sometimes difficult to find. Therefore, it takes time to develop some numerical techniques to find accurate numerical solutions of these types of differential equations. This work aims to present a novel approach termed as fractional iteration algorithm-I for finding the numerical solution of nonlinear noninteger order partial differential equations. The proposed approach is developed and tested on nonlinear fractional-order Fornberg–Whitham equation and employed without using any transformation, Adomian polynomials, small perturbation, discretization, or linearization. The fractional derivatives are taken in the Caputo sense. To assess the efficiency and precision of the suggested method, the tabulated numerical results are compared with the standard variational iteration method and the exact solution as well. In addition, numerical results for different cases of the fractional-orderα are presented graphically, which show the effectiveness of the proposed procedure and revealed that the proposed scheme is very effective, suitable for fractional PDEs, and may be viewed as a generalization of the existing methods for solving integer and noninteger order differential equations.


---

## Body

## 1. Introduction

The nonlinear PDEs have become a hot topic in the field of nonlinear science, which has been used to describe the problems in many fields, such as quantum mechanics, image processing, ecology and economic system, and epidemiology. PDEs are broadly emerging in different physical applications like dispersing and propagation of waves, magnetic resonance imaging, computational fluid dynamics, magnetohydrodynamic move through pipes, phenomena of supersonic and turbulence flow, acoustic transmission, and traffic. More details can be found in [1] and the references therein. PDEs are used in population models, medical imaging, proper distribution of oxygen to the healing tissues, electrical signalling of nerves, etc. [2]. The popularity of PDE has been confirmed in a very actual prediction of the number of COVID cases [3, 4]. Using PDE, it is possible to make a model of the shape of COVID-19 [5]. However, for some complex problems in these fields, the fractional PDE is more accurate than integer-order partial differential equation. So, generating numerical solutions of fractional PDEs has become extremely important.The noninteger order Calculus was created immediately after the integer order Calculus, which means that it dates back to the 17th century. The notation difψ/dψi was originated around 1675 by Leibniz to represent the ith derivative of a function fψ, assuming integer values of i. In 1695, L′ Hospital stated the problem: “What if i is 1/2?” Later, Leibniz used fractional derivatives (FD) symbols in his research. Accordingly, the concept of an FD appeared almost at the same time as the integer order derivative. Many famous researchers in the 18th and 19th century, for example Euler, Lagrange, Laplace, Fourier, and many others, contributed to the development of the fractional calculus (FC). The first problem modeled in terms of FC was the known problem of the tautochrone curve. In 1823, Abel found a solution in terms of an integral equation, which is based on the Riemann-Liouville definition of the fractional integration. However, the popularity of fractional partial differential equations (FPDE) was slowed down by some incomplete and conflicting definitions and difficulties in establishing consistent regulations for inverse operations. Satisfactory definitions for the integration and differentiation with fractional power were developed in the middle of the 19th century. FC is still an active of research in engineering and sciences [6–10].Due to the importance of numerical solution of fractional PDEs (FPDEs) in science and engineering, some powerful numerical techniques are developed in the literature, and many prominent researchers have made contributions in this area. These include finite element methods [11], mixed finite element (MFE) methods [12], (local) discontinuous Galerkin methods [13], finite volume methods [14], Jacobi collocation [15], variational iteration method [16], generalized Kudryashov method [17], finite Hankel transform procedure [18], modified Khater method [19], residual power series method [20], modified auxiliary equation method [21], local meshless method [22], RBF collocation method [23], operational matrix of B-spline functions [24], and some other advanced numerical methods as well. Zhang and Xu [25], Lin et al. [26] considered some spectral approximations for the time-fractional water wave model, time-fractional diffusion equation. Most nonlinear TFPDEs do not have accurate exact solutions. Therefore, direct and iterative approaches are applied. Most of the methods for nonlinear TFPDEs give infinite series solutions or mesh-based method. These methods are time-consuming due to repeated calculation in series solution and mesh creation in mesh-based methods.Opposite to great popularity and applicability, the shortcoming is obvious in the available numerical techniques of reasonably high orders for finding approximate solutions of FPDEs. Such a need for a general method, which is usable in solving linear, nonlinear, homogenous, nonhomogeneous, and multivariable FPDEs problems without major changes, is the inspiration for the current research. Recently, many scholars have investigated the numerical solutions of the fractional PDEs, which has effectively promoted the advancement of the field of nonlinear PDEs. However, in general, numerical techniques have some limitations such as low accuracy, mesh generation, transformations, stability, convergence, and difficulty of implementing in complex geometries. In recent years, the variational iteration methods (VIM) have become popular in the field of numerical approximations. In this technique, the discretization of the domain and linearization of given differential equations is not required. We simply need to calculate the Lagrange multiplier of the given differential equation by restricting the nonlinear terms and in series form analytical solution of the given differential equations can be obtained. VIM can be implemented in the easiest way and is more flexible than other techniques available in the literature. It was applied for the first time to FPDEs by He in [27], and later on by Odibat and Momani in [28]. Inc [29] employed it for the numerical approximation of fractional Burgers equations. Yulita et al. [30] applied VIM for the analytical treatment of fractional Zakharov-Kuznetsov equations, while Safari et al. [31] utilized it for fractional KdV Burger’s Kuramoto equation. Das in [32] investigated fractional diffusion equations by using VIM and obtained the exact solution.In this study, we present a novel approach, termed as fractional iteration algorithm-I, for solving noninteger order differential equations. The proposed approach is developed and tested on nonlinear fractional-order Fornberg–Whitham equation. This equation is defined as(1)∂Uα∂tα+∂U∂ψ−∂U3∂ψ2∂t+U∂U∂ψ=3∂U∂ψ∂2U∂ψ2+U∂3U∂ψ3,t>0,0<α≤1,subject to the beneath initial condition(2)Uψ,0=43eψ/2.The constantα in 1 lies in the interval 0,1, Uψ,t is the fluid velocity, ψ is the spatial, and t is the time coordinate.The numerical solution of the Fornberg–Whitham type equations (1) is numerically challenging. To solve these equations numerically, several methods were proposed in the literature. Lu in [33] solved Fornberg–Whitham type equations by He’s variational iteration method. The approximate analytical solutions to this type of equations were presented by Abidi and Omrani in [34] employing homotopy analysis technique. Zhou and Tian [35] obtained a special type of travelling wave solution of the Fornberg–Whitham type equations by applying the bifurcation method. Yin et al. [36] classified all the travelling solutions obtained by an improved qualitative method of Fornberg–Whitham equation. Feng and Wu [37] reduced this equation to simple ODE and solved it by factorization technique successfully. Jiang and Bi [38] presented the bifurcation method and smooth travelling wave solutions are obtained. Reduced differential transform method has been utilized by Hesam [39] for this type of equations and in convergent power series, the results are obtained. Biazar and Eslami [40] used He’s HPM for the analytical solution of equation (1). Three different types of Fornberg–Whitham equation were investigated by Boutarfa et al. [41] who used the reproducing kernel Hilbert space method. A novel analytical approach for solving fractional Fornberg-Whitham equation was proposed in [42]. An iterative method for finding approximate analytical solutions to the fractional Fornberg-Whitham equation was proposed in [43]. An analytical solution of Fornberg-Whitham type equations in view of the fractional Caputo operator was considered in [44]. Our aim in this work is to apply the MVIA-I for these two types of Fornberg–Whitham type equations.The remaining sections of the paper are organized on the basis of the following organization. In Section2, some special and basic functions of fractional Calculus are defined. In Section 3, the fractional iteration algorithm-I is explained. Its convergence analysis is discussed in Section 4, and its implementation is illustrated for nonlinear Fornberg–Whitham type equations in Section 5. In Section 6, the results are discussed, and some utilizations of the proposed scheme are given. Conclusion is explained in the last Section 7.


## 2. Basic Functions and Properties of Fractional Calculus

This section aims to present some basic definitions and notions, which have significant importance in the FC. First of all, we discuss some basic special functions. Basic definitions of fractional derivatives were introduced thereafter.


### 2.1. Special Functions

In fractional/fractal calculus, the gamma, Beta, and Mittag–Leffler functions are the fundamental and key tools to understand the origin of its computational challenges.


#### 2.1.1. Gamma Function

The gamma functionΓz is defined by the Euler integral of the second kind [45]:(3)Γz=∫0∞e−ttz−1dt.This integral is convergent in the right half of the complex plane rez>0.


#### 2.1.2. Beta Function

The Beta functionβz,w is defined by the Euler integral of the first kind [45]:(4)βz,w=∫0∞1−tw−1tz−1dt,rez>0,rew>0.The relationship between Beta function and Gamma function can be established as(5)βz,w=ΓwΓzΓw+z.


#### 2.1.3. Mittag–Leffler Function

We describe the one-parameter and two-parameter Mittag–Leffler function, respectively, as [46](6)Eαz=∑k=0∞zkΓαk+1,Eα,βz=∑k=0∞zkΓαk+β.


### 2.2. Different Definitions of Fractional Derivatives

We present some main definitions of the fractional derivatives as follows:Definition 1.
The right-modified Riemann–Liouville derivative is defined as [47](7)∂αUψ,t∂tα=1Γ1−αddt∫tTUψ,ϑ−Uψ,tϑ−tαdϑ,0<α<1.Definition 2.
The Caputo fractional derivative is defined as [48](8)∂αUψ,t∂tα=1Γ1−α∫0t∂Uψ,ϑ∂ϑt−ϑ−αdϑ,0<α<1.Definition 3.
The ABC derivative is introduced as [49](9)ABCa∂αUψ,t∂tα=ABα1−α∫atUψ,xEα−αt−xα1−αdx,0<α<1,where ABα is the normalization function.Definition 4.
The Ji-Huan He’s fractional derivative is defined by the rule [50](10)∂αUψ,t∂tα=1Γ1−αddx∫t0tt−ϑ−αU0ϑ−Uϑ,0<α<1.Definition 5.
The Ji-Huan He’s fractal derivative is defined as [50](11)∂U∂ψα=Γ1−αlimΔψ=ψ1−ψ2⟶LUψ1−Uψ2ψ1−ψ2α.Definition 6.
The Grünwald–Letnikov fractional derivative is presented as [45](12)Dtαft=limh⟶01hα∑k=0m−1kαkft−kh,ψ−1<α<ψ.


## 2.1. Special Functions

In fractional/fractal calculus, the gamma, Beta, and Mittag–Leffler functions are the fundamental and key tools to understand the origin of its computational challenges.


### 2.1.1. Gamma Function

The gamma functionΓz is defined by the Euler integral of the second kind [45]:(3)Γz=∫0∞e−ttz−1dt.This integral is convergent in the right half of the complex plane rez>0.


### 2.1.2. Beta Function

The Beta functionβz,w is defined by the Euler integral of the first kind [45]:(4)βz,w=∫0∞1−tw−1tz−1dt,rez>0,rew>0.The relationship between Beta function and Gamma function can be established as(5)βz,w=ΓwΓzΓw+z.


### 2.1.3. Mittag–Leffler Function

We describe the one-parameter and two-parameter Mittag–Leffler function, respectively, as [46](6)Eαz=∑k=0∞zkΓαk+1,Eα,βz=∑k=0∞zkΓαk+β.


## 2.1.1. Gamma Function

The gamma functionΓz is defined by the Euler integral of the second kind [45]:(3)Γz=∫0∞e−ttz−1dt.This integral is convergent in the right half of the complex plane rez>0.


## 2.1.2. Beta Function

The Beta functionβz,w is defined by the Euler integral of the first kind [45]:(4)βz,w=∫0∞1−tw−1tz−1dt,rez>0,rew>0.The relationship between Beta function and Gamma function can be established as(5)βz,w=ΓwΓzΓw+z.


## 2.1.3. Mittag–Leffler Function

We describe the one-parameter and two-parameter Mittag–Leffler function, respectively, as [46](6)Eαz=∑k=0∞zkΓαk+1,Eα,βz=∑k=0∞zkΓαk+β.


## 2.2. Different Definitions of Fractional Derivatives

We present some main definitions of the fractional derivatives as follows:Definition 1.
The right-modified Riemann–Liouville derivative is defined as [47](7)∂αUψ,t∂tα=1Γ1−αddt∫tTUψ,ϑ−Uψ,tϑ−tαdϑ,0<α<1.Definition 2.
The Caputo fractional derivative is defined as [48](8)∂αUψ,t∂tα=1Γ1−α∫0t∂Uψ,ϑ∂ϑt−ϑ−αdϑ,0<α<1.Definition 3.
The ABC derivative is introduced as [49](9)ABCa∂αUψ,t∂tα=ABα1−α∫atUψ,xEα−αt−xα1−αdx,0<α<1,where ABα is the normalization function.Definition 4.
The Ji-Huan He’s fractional derivative is defined by the rule [50](10)∂αUψ,t∂tα=1Γ1−αddx∫t0tt−ϑ−αU0ϑ−Uϑ,0<α<1.Definition 5.
The Ji-Huan He’s fractal derivative is defined as [50](11)∂U∂ψα=Γ1−αlimΔψ=ψ1−ψ2⟶LUψ1−Uψ2ψ1−ψ2α.Definition 6.
The Grünwald–Letnikov fractional derivative is presented as [45](12)Dtαft=limh⟶01hα∑k=0m−1kαkft−kh,ψ−1<α<ψ.


## 3. Fractional Iteration Algorithm-I

In this section, the main idea of the fractional iteration algorithm-I is illustrated by considering a nonlinear differential equation of the generic form(13)LUψ+NUψ=gψ,where LUψ and NUψ denote linear and nonlinear operators, respectively, whereas gψ is a nonhomogeneous term. For an appropriate given initial condition U0ψ, series Uk+1ψ, which approximates the solution of equation (13), can be obtained as(14)Uk+1ψ=Ukψ+ρ∫0ψλϑLUkϑ+NUkϑ︷−gϑdϑ,where Ukϑ︷ is a restricted term, which gives δUkϑ︷=0 with respect to the variation δ, and ρ and λϑ are an auxiliary parameter and Lagrange multiplier, respectively, which can be optimally determined. The first one is used to accelerate the convergence to the exact solution [51–55], while the second one is used to construct the correction function [56].A suitable value ofλϑ can be achieved applying δ on both sides of recurrent relation (14) with respect to Ukψ, which leads to(15)δUn+1ψ=δUnψ+ρδ∫0ψλϑLUkϑ+NUkϑ︷−gϑdϑ.For nonlinear problems, the nonlinear terms have to be considered as restricted variations for obtaining the value of Lagrange multiplier, and a correction functional can be easily constructed after determining the identified value of corresponding nonlinear terms. The beneath Lagrange multipliers can be obtained in the following way:(16)λ=−1,fori=1,λ=ψ−t,fori=2.Also, the following general formula for the Lagrange multiplier in the casesi≥1 is available:(17)λ=−1iϑ−ti−1i−1!.After finding the value ofUkϑ︷, an iteration formula is constructed by using this value in the corrective function (14) as follows:(18)Un+1ψ=Unψ+ρ∫0ψ−1iϑ−ti−1i−1!LUkϑ+NUkϑ−gϑdϑ.The iterative sequenceUk can be obtained starting from a proper initial approximation and using the iterative formula (18). It is convenient to repeat iterations many times to arrive at the given accuracy for the advanced computer technique. An exact solution Uψ is obtained as the limiting value(19)Uψ=limk⟶∞Ukψ.It is worth mentioning that the proposed algorithm may be considered as a nice refinement in existing analytical and numerical methods, where the discretization, transformations, and linearization are not required, and the numerical solution of the given differential equations can be obtained in series form as(20)U0ψis an appropriate initial approximation,U1ψ,ρ=U0ψ+ρ∫0ψλϑLU0ϑ+NU0ϑ−gϑdϑ,Uk+1ψ,ρ=U0ψ,ρ+ρ∫0ψλϑNUkϑ,ρ−gϑ,ρdϑ,k=1,2,….We employ this procedure for finding the analytical/numerical solution of nonlinear fractional-order Fornberg–Whitham equations. Whenρ=1, this procedure given in equation (20) becomes the standard variational iteration algorithm-I. Equation (20) has two obvious advantages; one is the limited step, which is needed for better accuracy, while the other is an auxiliary parameter ρ, which ensures the convergence, and a more accurate solution can be gained after a higher iteration process.


## 4. Convergence Analysis

The convergence of the algorithm proposed inSection 3 for solving nonlinear fractional partial differential equations will be examined in this section. This algorithm can be performed in an effective and trustworthy way and can handle fractional differential equation (13) as well. When the fractional iteration algorithm is implemented for the numerical investigation of the fractional-order Fornberg–Whitham equation, the linear operator L is defined as L=∂α/∂tα. First, in (21), we define the operator R for solving problems of such type:(21)RUψ,t,ρ≔ρ∫0tλϑLUψ,ϑ,ρ+NUψ,ϑ,ρ︷−gϑdϑ,where k≥0 and wk and vk are defined by(22)w0ψ,t=U0ψ,t,v0ψ,t=w0ψ,t,w1ψ,t,ρ=Rv0ψ,t,v1ψ,t,ρ=v0ψ,t+Rv0ψ,t,U1ψ,t,ρ=Rv0ψ,t,v1ψ,t,ρ=v0ψ,t+w1ψ,t,ρ,Wk+1ψ,t,ρ=Rvnψ,t,ρ,vn+1ψ,t,ρ=vnψ,t,ρ+Rvnψ,t,ρ.In general, fork≥1, it can be written as(23)Uk+1ψ,t,ρ=Rvkψ,t,ρ,vk+1ψ,t,ρ=vkψ,t,ρ+Wk+1ψ,t,ρ.Accordingly,(24)Uψ,t,ρ≔limk⟶∞vkψ,t,ρ=w0ψ,t+∑k=1∞wkψ,t,ρ.The initial iterationU0ψ,t can be chosen uninhibitedly, but it needs to fulfil the corresponding initial-boundary conditions. The determination of appropriate initial approximation will give productive and accurate results. The nth-order truncated series Unψ,t,ρ≔w0ψ,t+∑k=1nwkψ,t,ρ can be used to approximate the solution. The unknown parameter ρ in Unψ,t,ρ ensures that the hypothesis is fulfilled by utilizing 2-norm error of the residual function. The error analysis and convergence criteria of VIA-I with an auxiliary parameter are revealed using the following theorems [57, 58].Theorem 1.
The operatorR defined in (21) maps a Hilbert space H to H. The solution given in (24) can be given in the following form of series:(25)Uψ,t≔limk⟶∞vkψ,t,ρ=w0ψ,t+∑k=1∞wkψ,t,ρ.It converges if∃ρ≠0,0<β<1, such that(26)Rv0ψ,t≤βv0ψ,t,Rv1ψ,t,ρ≤βRv0ψ,t,Rvkψ,t,ρ≤βRvk−1ψ,t,ρ,k=2,3,4,….Lemma 1.
LetQ be a function from a Hilbert space H to H, and the operator L required in (13) be defined as L=∂i/∂ti,i=1,2 and the Lagrange multiplier be defined optimally by the variation theory, then(27)L∫0tλϑQψ,ϑ,ρdϑ=−Qψ,ϑ,ρ.Theorem 2.
Let the operatorL needed in 14 be defined as L=∂i/∂ti,i=1,2. If we have the series solution (24) defined by(28)Uψ,t≔w0ψ,t+∑k=1∞wkψ,t,ρ,then Uψ,t is an exact solution to the nonlinear partial differential equation (13).Theorem 3.
Let us suppose that the solutionUψ,t≔w0ψ,t+∑n=1∞wnψ,t,ρ, given in (24), converges to the exact solution of the model equation (1). Also, assume that if the approximate solution is the truncated series UNψ,t≔w0ψ,t+∑k=1Nwkψ,t,ρ then the maximum error norm can be assessed as(29)Uψ,t−UNψ,t≤11−ββN+1w0.


## 5. Implementation of the Algorithm and Examples

In this section, to clarify step by step solution procedure of the fractional iteration algorithm-I, the following time-fractional Fornberg–Whitham equation (1) is considered:(30)∂Uα∂tα+∂U∂ψ−∂U3∂ψ2∂t+U∂U∂ψ=3∂U∂ψ∂2U∂ψ2+U∂3U∂ψ3,t>0,0<α≤1.The initial condition is(31)Uψ,0=43ex/2,and the exact solution taken from [41] is equal to(32)Uψ,t=43ex/2−2t/3.Numerical solutionUk+1ψ of equation (13) for the provided initial condition U0ψ can be achieved by means of(33)Uk+1ψ,t,ρ=Ukψ,t,ρ+ρ∫0tλϑ∂Ukαψ,ϑ,ρ∂ϑα−∂3Ukψ,ϑ,ρ∂ψ2∂ϑ︷+∂Ukψ,ϑ,ρ∂ψ+Ukψ,ϑ,ρ∂Ukψ,ϑ,ρ∂ψ︷−3∂Ukψ,ϑ,ρ∂ψ∂2Ukψ,ϑ,ρ∂ψ2︷−Ukψ,ϑ,ρ∂3Ukψ,ϑ,ρ∂ψ3︷dϑ.The Lagrange multiplierρ can be obtained using the variation theory. Multiplying both the sides of the equation (33) by δ, one obtains(34)δUk+1ψ,t,ρ=δUkψ,t,ρ+ρδ∫0tλϑ∂Ukαψ,ϑ,ρ∂ϑα−∂3Ukψ,ϑ,ρ∂ψ2∂ϑ︷+∂Ukψ,ϑ,ρ∂ψ+Ukψ,ϑ,ρ∂Ukψ,ϑ,ρ∂ψ︷−3∂Ukψ,ϑ,ρ∂ψ∂2Ukψ,ϑ,ρ∂ψ2︷−Ukψ,ϑ,ρ∂3Ukψ,ϑ,ρ∂ψ3︷dϑ.For nonlinear problems, the nonlinear terms are considered to be restricted variations for obtaining the value of Lagrange multiplier; i.e.,Ukψ,ϑ,ρ︷ is a restricted term. This implies δUkψ,ϑ,ρ︷=0 and gives the beneath value of the Lagrange multiplier λ=−1. After using the value of λϑ in the recurrence relation (34), the beneath recurrent dependence is obtained:(35)Uk+1ψ,t,ρ=Ukψ,t,ρ−ρ∫0t∂Ukαψ,ϑ,ρ∂ϑα−∂3Ukψ,ϑ,ρ∂ψ2∂ϑ+∂Ukψ,ϑ,ρ∂ψ+Ukψ,ϑ,ρ∂Ukψ,ϑ,ρ∂ψ−3∂Ukψ,ϑ,ρ∂ψ∂2Ukψ,ϑ,ρ∂ψ2−Ukψ,ϑ,ρ∂3Ukψ,ϑ,ρ∂ψ3dϑ.Starting with a proper initial approximation and using the iterative formula (35), values in other iterations can be obtained. We stop the process at the third iteration. A residual function used before for variational iteration algorithm-II in [59] can be defined here for approximated solution to get optimal value of unknown parameter:(36)r3ψ,t,ρ=∂U3αψ,t,ρ∂tα−∂3U3ψ,t,ρ∂ψ2∂t+∂U3ψ,t,ρ∂ψ+U3ψ,t,ρ∂U3ψ,t,ρ∂ψ−3∂U3ψ,t,ρ∂ψ∂2U3ψ,t,ρ∂ψ2−U3ψ,t,ρ∂3U3ψ,t,ρ∂ψ3.And error of norm 2 of the above residual function with respect to the parameter ρ for ψ,t∈a,b×a,b can be defined as(37)e3ρ=∫01∫01r3ψ,t,ρ2dtdx1/2.The value ofe3ρ is approximated using a numerical integration. The minimal value of the function (37) is the value of the auxiliary term ρ. Here, for different values of α, we get different values of auxiliary parameters using Maple software. For α=1, α=0.9, α=0.8, α=0.7, α=0.6, the corresponding values of the auxiliary parameter ρ are 1.21413823669280, 0.461366433098273, 1.29274273230225,1.33274646640909, and 1.36918865275675, respectively.It is convenient to iterate many times to arrive at the given accuracy for the advanced computer technique, and the exact solutionUψ is obtained by the limit(38)Uψ=limk⟶∞Ukψ.The numerical solutions generated using the proposed technique with an optimal value of the auxiliary parameterh=1.12170161455440 are reported in Table 1. To show the applicability and efficiency of the proposed technique, the comparisons are carried out with the exact solutions as well as the standard variational iteration method from [60], in terms of absolute errors reported in Table 2 for different values of t and x.Table 1
Comparison of exact and approximate solutions and absolute errors for equation (1).
ψtExact solutionα=1Approximate solutionsAbsolute errorsPresent[60]Present[60]0.50.51.226725881.2267730831.226065934.7203×10−57.0715×10−41.00.878987500.87934548670.873850633.5798×10−45.1368×10−31.00.51.575147211.575207818271.574299826.0608×10−58.4739×10−41.01.128642291.129101954421.122046424.5966×10−46.5958×10−31.50.52.022529062.0226068762.021440987.7816×10−51.0880×10−31.01.449205391.4497956081.440736125.9021×10−48.4692×10−3Table 2
Approximate solutions for different values ofα for equation (1).
ψtα=0.9α=0.8α=0.7Present[60]Present[60]Present[60]0.50.51.1684472011.169635761.1048216581.108672581.0246797131.043661401.00.8820035950.858344300.9133710820.838773240.9371526680.811997391.00.51.5003159051.501842041.4186190901.423563781.3157147951.340087771.01.1325150351.102135891.1727916851.077006161.2033278461.042625281.50.51.9264437551.928403351.8215429681.827892081.6894112381.720706761.01.4541780891.415170501.5058943311.382903281.5451035021.33875737A full agreement between the results of fractional variational iteration algorithm and exact solution can be observed, which confirms applicability and accuracy of the proposed algorithm. One can observe that the proposed algorithm is very rapid, effective, and accurate, and this is proved by comparing the solutions obtained through the proposed method with the results in [60] as well as with the exact solution. Results are also shown graphically by assigning different values of α with ψ=1 under the given condition in each case, which can be seen in Figure 1.Figure 1
Plots of the approximate solution atψ=1 for different values of α.The space and time surface graphs of approximate and exact solutions are observable in Figures2–7.Figure 2
The surface graph of the approximated solutionU3ψ,t,ρ for α=0.6.Figure 3
The surface graph of the approximated solutionU3ψ,t,ρ for α=0.7.Figure 4
The surface graph of the approximated solutionU3ψ,t,ρ for α=0.8.Figure 5
The surface graph of the approximated solutionU3ψ,t,ρ for α=0.9.Figure 6
The surface graph of the approximated solutionU3ψ,t,ρ for α=1.0.Figure 7
The behavior of the exact solutionUψ,t,ρ.


## 6. Discussion

The nonlinear PDEs have become a hot topic in the field of nonlinear science and have been used in modeling miscellaneous problems in many fields of science and engineering, including plasma physics, fluid mechanics, quantum mechanics, fluid dynamics, image processing and economic system. However, for some complex problems in these fields, the fractional partial differential equation is more accurate than integer partial differential equation. So, finding the numerical solutions of PDEs, as well as of fractional PDEs, has emerged as an extremely important strategy.(1)
Many engineering problems and other physical phenomena are modeled by nonlinear PDEs. On the other hand, the proposed iteration algorithms can be applied to various nonlinear PDEs. As a consequence, the proposed iterative scheme can be used in solving various problems.(2)
The fractional-order operator plays an important role not only in mathematics but also in other fields such as mechanics, physics, biomedical engineering, and finance. There are many nonlinear problems in real life. Therefore, there is a need to study the fractional PDEs.(3)
The numerical approaches are used for deeper understanding to predict the anomalies, which are not possible in the analytical methods because the analytical method can solve only two or three unknown variables, while numerical methods are applicable to much more variables very accurately.(4)
Analytical methods, if available, are always the best. However, these are impossible to achieve in some cases. If the analytical approaches are unable to generate the exact solution, numerical methods give the possibility to obtain an approximate numerical solution.(5)
The extreme benefit of the proposed algorithm is based on its straightforward applicability and conciseness. Furthermore, it can handle all types of nonlinear fractional PDEs.


## 7. Conclusion

In this work, a novel approach named as fractional iteration algorithm-I is introduced for various types of nonlinear PDEs as well as fractional PDEs and has been discussed in detail, including figures and tabulated numerical results. The proposed method is able to implement without the use of any transformation, linearization, discretization, or restrictive assumptions and thus is particularly perfect with the flexible and expanded nature of the physical problems. The coupling of Caputo fractional derivative and variational iteration algorithm-I to tackle both time and space derivatives accurately makes the solution process easiest, and the evaluation of fractional term becomes simpler, and FPDEs can be solved in a tremendous way. The proposed technique is able to solve all kinds of linear and nonlinear problems of physical nature arising in applied sciences and engineering.



---

*Source: 8829017-2020-10-06.xml*