Figures
Abstract
In this paper, a new heuristic scheme for the approximate solution of the generalized Burgers'-Fisher equation is proposed. The scheme is based on the hybridization of Exp-function method with nature inspired algorithm. The given nonlinear partial differential equation (NPDE) through substitution is converted into a nonlinear ordinary differential equation (NODE). The travelling wave solution is approximated by the Exp-function method with unknown parameters. The unknown parameters are estimated by transforming the NODE into an equivalent global error minimization problem by using a fitness function. The popular genetic algorithm (GA) is used to solve the minimization problem, and to achieve the unknown parameters. The proposed scheme is successfully implemented to solve the generalized Burgers'-Fisher equation. The comparison of numerical results with the exact solutions, and the solutions obtained using some traditional methods, including adomian decomposition method (ADM), homotopy perturbation method (HPM), and optimal homotopy asymptotic method (OHAM), show that the suggested scheme is fairly accurate and viable for solving such problems.
Citation: Malik SA, Qureshi IM, Amir M, Malik AN, Haq I (2015) Numerical Solution to Generalized Burgers'-Fisher Equation Using Exp-Function Method Hybridized with Heuristic Computation. PLoS ONE 10(3): e0121728. https://doi.org/10.1371/journal.pone.0121728
Academic Editor: William I. Newman, UCLA, UNITED STATES
Received: August 29, 2014; Accepted: February 15, 2015; Published: March 26, 2015
Copyright: © 2015 Malik et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited
Data Availability: All relevant data are included within the paper.
Funding: The authors have no support or funding to report.
Competing interests: The authors have declared that no competing interests exist.
Introduction
Most physical phenomena arising in various fields of engineering and science are modeled by nonlinear partial differential equations (NPDEs). The investigation of solutions to NPDEs has attracted much attention due to their potential applications and many numerical schemes have been proposed, see for example [1–4]. The generalized Burgers′-Fisher equation is one of the important NPDE which appears in various applications, such as fluid dynamics, shock wave formation, turbulence, heat conduction, traffic flow, gas dynamics, sound waves in viscous medium, and some other fields of applied science [5–10].
The generalized Burgers′-Fisher equation is of the form [10–12]
(1)
subject to the following initial condition
(2)
The exact solution is given by [10–12]
(3)
Many researchers have investigated the analytical and numerical solutions of the generalized Burgers′-Fisher Equation (1) by using several different methods [8–17]. For example, Ismail et al. [11] used adomian decomposition method (ADM), Rashidi et al. [12] employed homotopy perturbation method (HPM), Nawaz et al. [10]applied optimal homotopy asymptotic method (OHAM),for obtaining approximate solutions of the generalized Burgers′-Fisher Equation (1). Very recently Mittal and Tripathi [8] employed modified cubic B-spline functions for the numerical solution of generalized Burgers′-Fisherand Burgers′-Huxley equations. Khattak [13] used collocation based radial base functions method (CBRBF) for numerical solution of the generalized Burgers′-Fisher equation. Javidi [14] used modified pseudospectral method for generalized Burgers′-Fisher equation.
The Exp-function method was introduced recently by He and Wu [18] to obtain the generalized solitonary solutions and periodic solutions of nonlinear wave equations. The method has attracted much attention due to its simple and straightforward implementation and many authors used it [19–24]. Among many authors, Xu and Xian [19] used Exp-function method for obtaining the solitary wave solutions for generalized Burgers′-Fisher equation. Özişand Köroğlu[20] used Exp-function method for obtaining travelling wave solutions of the Fisher equation. Chun[21] used Exp-function method for solving Burgers′-Huxley equation.
In recent years, many authors have used heuristic computation based techniques for solving variety of differential equations [25–35]. Very recently Malik et al. [25,26]used nature inspired computation based approach for solving systems of nonlinear ordinary differential equations (NODEs), including biochemical reaction model [25], and boundary value problems arising in physiology [26]. Khan et al.[27] used evolutionary computation (EC) based artificial neural network (ANN)method for solving van der pol oscillator equation. Arqab et al. [28] used genetic algorithm (GA) based method for solving linear and nonlinear ODEs. Caetano et al. [29] used the ANN based method for solving NODEs arising in atomic and molecular physics.
The aim of this work is to obtain the approximate solution of the generalized Burgers′-Fisher equation using a novel scheme. The scheme is based on the elegant hybrid approach of Exp-function method and evolutionary algorithm (EA). In the proposed scheme the Exp-function method is used to express the approximate wave solution with unknown parameters. The given NPDE is converted into a global error minimization problem using a fitness function with unknown parameters. Genetic algorithm (GA), one of the renowned evolutionary algorithms is adopted for solving the minimization problem and to achieve the unknown parameters.
To the best of our knowledge nobody as yet has tackled with the generalized Burgers′-Fisher equation with the scheme presented in this work. The proposed scheme is simple and straightforward to implement and also gives the approximate solution at any value of choice in the solution domain. The efficiency and reliability of the proposed scheme is illustrated by solving generalized Burgers′-Fisher and Burgers′ equations successfully.
Materials and Methods
In this section, stochastic global search algorithm GA is introduced, the basic idea of Exp-function method is given, and description of the proposed scheme is provided.
Genetic algorithm (GA)
Genetic algorithm (GA) is one of the well-known evolutionary algorithms (EAs) that find the optimal solution of a problem from a randomly generated population of individuals called chromosome. Each individual within a population is regarded as a possible solution to the problem. The individuals within a population are evaluated using a fitness function that is specific to the problem at hand. The algorithm evolves population iteratively by means of three primary operations: selection, crossover, and mutation to reach the optimal solution [36].
The procedural steps of GA are given in algorithm 1, while the parameters settings of the algorithm used in this work are given in Table 1.
Algorithm 1.
Step 1: (Population Initialization)
A population of N individuals or chromosomes (C1, C2, ….,CN) each of length M is generated using random number generator. The length of each chromosome represents the number of unknown parameters.
Step 2: (Fitness Evaluation)
A problem exclusive fitness function is used to compute the fitness of each chromosome.
Step 3: (Selection and Reproduction)
The chromosomes from the current population are chosen on the basis of their fitness value which acts as parents for new generation. These parents produce children (offsprings) with a probability to their fitness through crossover operation.
Step 4: Mutation
Mutation operation introduces random alterations in the genes to maintain the genetic diversity to find a good solution.
Step 5: (Stoppage Criteria)
The algorithm terminates if the maximum number of cycles has exceeded or a predefined fitness value is achieved. Else go to step 3.
Overview of Exp-function method
Consider a nonlinear partial differential equation (NPDE) given in the following form
(4)
Using a transformation, u(x,t) = u(η) with η defined as follows
(5)
Equation (4) is converted into a following ODE
(6)
where k and ω are unknown constants, and prime denotes derivation with respect to η.
According to Exp-function method [18], the solution of (6) is expressed in the following form
(7)
where c, d, p, and q are unknown positive integers, an and bm are unknown constants.
The values of c and p are determined by balancing the linear term of highest order in (6) with the highest order nonlinear term, which gives p = c[18, 37]. Similarly the values of d and q are determined by balancing the lowest order of linear and nonlinear terms in (6), which yields q = d[18, 37]. Once c, d, p, q are determined their values are freely chosen [18]. Next the unknown constants an and bm are determined by substituting (7) into (6) and equating the coefficients of exp(nη) to zero, which results into a set of algebraic equations with unknown constants. The systems of algebraic equations are solved using some software package like Matlab, Maple or Mathematica for determining the unknown constants an and bm, Consequently the solution of NPDE (4) is obtained.
Description of the proposed scheme
We consider the NPDE given by (4) subject to the following initial condition
(8)
Apply the transformation variable η = kx + ωt to (4) yields NODE given by (6). We assume that the approximate solution of (6) is expressed in the following form in view of the Exp-function method [18].
As mentioned above the values of c and d can be feely chosen, therefore we accordingly set their values. The rest of the unknown parameters existing in (9) including (a-c,…,ad;b-c,…,bd;k,ω) need to be found to obtain the approximate solution of (6). To determine the values of these unknown parameters, the transformed NODE (6) along with the initial condition (8) is converted into an equivalent global error minimization problem by developing a trial solution using a fitness function (FF). The fitness function (FF) consists of the sum of two parts. The first part represents the mean of sum of the square errors associated with the transformed NODE (6), and the second part represents the mean of sum of the square errors associated with the initial condition (8), which are given respectively as follows
(10)
(11)
where N and S are the total number of steps taken in the solution domain of x and t, and
,
,
are given by (9) and its derivates respectively.
The FF which is denoted as εj is accordingly formulated as follows
(12)
where j is the generation index.
The error minimization problem given by (12) is solved using the application of evolutionary algorithm, such as GA, to find the optimal values of unknown parameters (a-c,….ad;b-c,…,bd;k,ω). Once the values of the unknown parameters are achieved, they are used in (9), which consequently provides the approximate numerical solution of the given NPDE.
Numerical approximation of generalized Burgers′-Fisher equation
To solve the generalized Burgers′-Fisher Equation (1) using the proposed scheme, we first apply the transformation variable η = kx + ωt which yield the following NODE
(13)
Assume the approximate solution of (13) is given by (9) in the view of the Exp-function method [18]. To determine the unknown parameters (a-c,…,ad;b-c,…,bd;k,ω) in (9) for obtaining the approximate solution, the FF is formulated as follows (14)—(16)
(14)
(15)
(16)
The FF given by (16) contains unknown parameters in the form of a chromosome for GA. The objective is to solve the global error minimization problem given by Equation (16) and to achieve the optimal chromosome which represents the values of unknown parameters. Consequently the approximate solution of the generalized Burgers′-Fisher equation is obtained using the values of the unknown parameters in (9).
Convergence of the Proposed Scheme
Let the exact solution be g(η). By Exp-function method we get the solution u(η) as follows
(17)
This is a continuous function on a compact set. We apply Stone-Weierstrass theorem to prove that for any given g(η) on U and arbitrary ε > 0, there exists a system like u(η) as given above such that
(18)
That is u(η)can be a universal approximator. For this three conditions given in Stone-Weierstrass theorem have to be satisfied.
Let Z be a set of real continuous functions like u(η) on a compact set U.
Condition 1: All these must be closed under addition, multiplication, and scalar multiplication.
As we can see that addition (u1(η) + u2(η)) will give same type of function. Similarly multiplication (u1(η) × u2(η)) will also give same type of function, which is real, continuous and on compact set of U. The same is true for scalar multiplication.
Condition 2: For every η1andη2∈U,η1 ≠ η2 there exists function u∈Z such that u(η1)≠u(η2)
Condition 3: u(η)≠0 for each η∈U As we can easily judge from the function that its numerator ≠0 for ∀ai > 0,bi > 0.
Thus with these three conditions satisfied, there exists for g(η) a function u(η) with arbitrary ε > 0 such that
(19)
Numerical Results and Discussion
In this section, we apply the proposed scheme to the Burgers′-Fisher equation to test and assess its performance and to demonstrate the efficacy of the proposed scheme. Further to prove the accuracy and reliability of the proposed scheme comparisons of the numerical results are made with the exact solutions and some traditional methods, including OHAM [10], ADM [11], HPM [12], and CBRBF [13]. For simulations, Matlab 7.6 has been utilized in this work.
Example 1.
We consider the generalized Burgers′-Fisher equation transformed into NODE given by Equation (13) with the initial condition given by (2). The approximate solution is obtained in the domain x ∈ (0,1) and t ∈ (0,1) for different values of α,β,and δ as follows.
Case 1: α = β = 0.001,δ = 1
Case 2: α = β = 0.1,δ = 1
Case 3: α = β = 0.5,δ = 1
Case 4: α = β = 1,δ = 2
Case 5: α = 2,β = 5,δ = 3/2
As mentioned above that the values of c and d can be freely chosen, we set p = c = 2 and d = q = 2 in Equation (9), therefore we get the approximate solution in the form
(20)
The unknown parameters (a-2,…,a2;b-2,…,b2;k,ω) in Equation (20) are achieved using the stochastic global search algorithm GA by formulating the fitness function given by Equations. (14)—(16). For instance the fitness function corresponding to case 2, with N = 11 and S = 11is given by
(21)
(22)
(23)
Similarly we formulate fitness function corresponding to each case defined above. The parameter settings and values used for the implementation of GA are given in Table 1. The number of unknown parameters (a-2,…,a2;b-2,…,b2;k,ω) which need to be tailored is 12, therefore the size of chromosome is chosen as12. The values of these unknown adjustable parameters are restricted between -10 and +10. The global search algorithm GA is executed to achieve the minimum fitness, with the prescribed parameter settings and values given in Table 1.
The optimal chromosomes representing the values of unknown constants corresponding to the minimum fitness achieved by GA are provided in Table 2. Using the values of unknown constants from Table 2 in Equation (20), provides the approximate solution of the generalized Burgers′-Fisher equation at any value of x and t in the solution domain [0, 1].
In Table 3 we have presented numerical solutions obtained by the proposed scheme for time t = 0.1 for case 1-case 4, also exact solutions are given for comparison. Table 4 shows absolute errors obtained by the proposed scheme at time t = 0.1for case 1—case 4. Further, in Table 5 a comparison of our numerical solutions is made with the exact solutions for various values of x and t for case 5.
Tables 6 and 7 show the comparison of numerical solutions and absolute errors obtained by the proposed scheme, with the exact solutions, and absolute errors obtained by OHAM [10] and ADM [11], for α = β = 0.001,δ = 1 and α = β = 0.001,δ = 2 respectively. Further, Table 8 shows comparison of numerical solutions from the proposed scheme with the exact solutions, and absolute errors obtained by HPM [12].
From the comparison of numerical solutions and absolute errors, the efficiency and reliability of the proposed scheme is quite evident. Moreover, it is observed from the findings that the proposed scheme is more accurate than traditional methods including OHAM [10], ADM [11], and HPM [12].
Example 2.
With β = 0 and α = 1 Equation (1) is reduced to the generalized Burgers′ equation [11].
The approximate solution is obtained by the proposed scheme for three different values of δ = 1,2,3 in the domain x ∈(0,1) and t ∈(0,2)for δ = 1,2, and t ∈(0,5) for δ = 3.
We assume the solution is expressed by Exp-function method given by Equation (20). The fitness function is developed for each value of δ with β = 0 and α = 1. For example, the fitness function with δ = 3 is given as follows
(24)
GA is used to solve the minimization problem such as given by Equation (24) and to obtain the optimal values of unknown constants in Equation (20). The parameter settings for the implementation of GA are given in Table 1.
The optimal values of unknown constants achieved by GA are given in Table 9 for each value of δ = 1, 2, 3. The approximate solutions of generalized Burgers′ equation are obtained consequently by using the values of unknown constants in Equation (20).
In Tables 10–13 we provide the comparison of numerical solutions obtained by the proposed scheme with the exact solutions, and the solutions obtained by ADM [11] and CBRBF [13]. The comparisons of numerical solutions and absolute errors reveals that the proposed scheme is quite competent with other methods including ADM and RBF used in [11,13] for solving the generalized Burgers′ equation. The comparison further reveals that the proposed scheme is capable to achieve the approximate solutions in the larger domain of time t with greater accuracy. Moreover, for δ = 3 more accurate results are obtained by the proposed scheme as compared to ADM [11] and CBRBF [13].
Finally, we study the effect of change in the values of c and d in Equation (9) on the accuracy of approximate solution, and show the reliability of the proposed scheme. We used following test cases
Case (i) p = c = 1 q = d = 1
Case (ii) p = c = 2 q = d = 2
Case (iii) p = c = 3 q = d = 3
Case (iv) p = c = 1 q = d = 2
We consider the generalized Burgers′-Fisher Equation (1) with α = β = 0.001, and δ = 1. The approximate solution is obtained in the domain x ∈(0,1) and t ∈(0,1). GA has been used with the same settings for all the four cases (i)—(iv) as prescribed in Table 1 for example 1, except with a change in chromosome size for each case which is 8, 12, 16, and 10 for case(i), case(ii), case (ii), and case(iv) respectively. The approximate solutions have been obtained for each case and absolute errors have been computed. In Table 14 we provide the approximate solution obtained by the proposed scheme for each case at time t = 0.1. Table 15 shows average absolute errors obtained by the proposed scheme for each case (i)—(iv) for t ∈(0,1), also computational time and number of generations utilized are given for the sake of comparison. From the comparison of Table 15, it is observed that the average absolute error corresponding to case(i) with p = c = 1 and d = q = 1 is relatively very high compared to other cases (ii)–(iv). It is also observed that the accuracy is fairly equal for the remaining cases (ii)—(iv), however the computational time is quite different. It can be seen from Table 14 that for case (iv) we get the average absolute error fairly comparable to cases (ii) and (iii), but with lesser number generations and smaller computational time. Therefore it can be concluded on the basis of the simulation results that the choice of c, d have influence on the accuracy of approximate solutions and computational time. Nonetheless the comparison clearly demonstrates the accuracy and reliability of the proposed scheme.
Conclusions
A simple straightforward heuristic scheme based on the hybridization of Exp-function method and evolutionary algorithm has been proposed for obtaining the numerical solution of NPDEs. The proposed scheme has been successfully implemented for obtaining the numerical solutions of the generalized Burgers′-Fisher and Burgers′ equations. From the comparisons of numerical solutions made with the exact solutions, and some traditional methods including ADM, HPM, OHAM, and CBRBF, it can be concluded that the proposed scheme is effective and viable for solving such problems. Moreover, the beauty of the proposed scheme is that it can provide the approximate solution of the given NPDE on continuous values of time in the solution domain, once the unknown parameters are achieved.
Author Contributions
Conceived and designed the experiments: SAM IQM. Performed the experiments: SAM. Analyzed the data: SAM IMQ MA ANM IH. Contributed reagents/materials/analysis tools: SAM MA IH. Wrote the paper: SAM. Read and polished the paper: SAM IMQ ANM MA IH.
References
- 1. Jiwari R (2012) Quasilinearization approach for numerical simulation of Burgers' equation. Computer Physics Communications 183: 2413–2423.
- 2. Jiwari R, Mittal RC, Sharma KK (2013) A numerical scheme based on weighted average differential quadrature method for the numerical solution of Burgers' equation. Applied Mathematics and Computation 219: 6680–6691.
- 3. Mittal RC, Jiwari R, Sharma KK (2013) A numerical scheme based on differential quadrature method to solve time dependent Burgers' equation. Engineering Computations 30 (1): 117–131.
- 4. Mittal RC, Jiwari Ram (2012) A differential quadrature method for solving Burgers'-type equation. International Journal of Numerical Methods for Heat and Fluid Flow 22 (7): 880–895.
- 5. Mittal RC, Jiwari R (2009) Study of Burger-Huxley Equation by Differential Quadrature Method. International Journal od Applied Mathematics and Mechanics5(8): 1–9.
- 6. Mittal RC, Jiwar R (2009) Differential Quadrature Method for Two Dimensional Burgers' Equations. International Journal of Computational Methods in Engineering Science and Mechanics10: 450–459.
- 7. Jiwari R, Pandit S, Mittal RC (2012) Numerical simulation of two-dimensional sine-Gordon solitons by differential quadrature method. Computer Physics Communications 183: 600–616.
- 8. Mittal RC, Tripathi A (2014) Numerical solutions of generalized Burgers—Fisher and generalized Burgers—Huxley equations using collocation of cubic B-splines.International Journal of Computer Mathematics http://dx.doi.org/10.1080/00207160.2014.920834.
- 9. Kheiri H, Ebadi DG (2010) Application of the (G′/G)-expansion method for the Burgers, Fisher, and Burgers-Fisher equations, Acta Universitatis Apulensis 24: 35–44.
- 10. Nawaz R, Ullah H, Islam S, Idrees M (2013) Application of optimal homotopy asymptotic method to Burger equations. Journal of Applied Mathematics http://dx.doi.org/10.1155/2013/387478 pmid:24415902
- 11. Ismail HNA, Raslan K, Abd Rabboh AA (2004) Adomian decomposition method for Burger’s—Huxley and Burger’s—Fisher equations. Applied Mathematics and Computation 159: 291–301.
- 12. Rashidi MM, Ganji DD, Dinarvand S (2009) Explicit analytical solutions of the generalized Burger and Burger—Fisher equations by homotopy perturbation method. Numerical Methods for Partial Differential Equations 25: 409–417.
- 13. Khattak AJ (2009) A computational meshless method for the generalized Burger’s—Huxley equation. Applied Mathematical Modelling 33: 3718–3729.
- 14. Javidi M (2006) Modified pseudospectral method for generalized Burger’s-Fisher equation. International Mathematical Forum 1(32): 1555–1564.
- 15. Behzadi SS (2011) Numerical solution for solving Burger’s-Fisher equation by iterative methods. Mathematical and Computational Applications 6(2): 443–455.
- 16. Moghimi M, Hejazi FSA (2007) Variational iteration method for solving generalized Burger—Fisher and Burger equations. Chaos, Solitons and Fractals 33: 1756–1761.
- 17. Sari M (2011) Differential quadrature solutions of the generalized Burgers-Fisher equation with a strong stability preserving high-order time integration. Mathematical and Computational Applications 16(2): 477–486.
- 18. He JH, Wu XH (2006) Exp-function method for nonlinear wave equations. Chaos, Solitons and Fractals 30: 700–708.
- 19. Xu ZH, Xian DQ (2010) Application of Exp-function method to generalized Burgers-Fisher equation. Acta Mathematicae Applicatae Sinica, English Series 26(4): 669–676.
- 20. Öziş T, Köroğlu C (2008) A novel approach for solving the Fisher equation using Exp-function method. Physics Letters A 372: 3836–3840.
- 21. Chun C. (2008) Application of Exp-function method to the generalized Burgers-Huxley equation. Journal of Physics 96: 012217.
- 22. Ebaid AE (2009) Generalization of He’s Exp-function method and new exact solutions for Burgers equation. Z. Naturforsch 64a: 604–608.
- 23. Hu M, Jia Z, Chen Q, Jia S (2014) Exact solutions for nonlinear wave equations by the Exp-function method. Abstract and Applied Analysis:
- 24. Assas LMB (2009) New exact solutions for the Kawahara equation using Exp-function method. Journal of Computational and Applied Mathematics 233: 97–102.
- 25. Malik SA, Qureshi IM, Amir M, Haq I (2014) Numerical solution to nonlinear biochemical reaction model using hybrid polynomial basis differential evolution technique. Advanced Studies in Biology 6(3): 99–113.
- 26. Malik SA, Qureshi IM, Amir M, Haq I (2014) Nature inspired computational technique for the numerical solution of nonlinear singular boundary value problems arising in physiology. The Scientific World Journal:
- 27. Khan JA, Raja MAZ, Qureshi IM (2011) Novel approach for a van der pol oscillator in the continuous time domain. Chinese Physics Letters 28 (11): 110205.
- 28. Arqub OA, Abo-Hammour Z, Momani S, Shawagfeh N (2012) Solving singular two-point boundary value problems using continuous genetic algorithm. Abstract and Applied Analysis:
- 29. Caetano C, Reis JL Jr, Amorim J, Lemes MR, Pino AD Jr (2011) Using neural networks to solve nonlinear differential equations in atomic and molecular physics. International Journal of Quantum Chemistry 111: 2732–2740.
- 30. Malik SA, Qureshi IM, Zubair M, Haq I (2012) Solution to force-free and forced duffing-van der pol oscillator using memetic computing. Journal of Basic and Applied Scientific Research 2(11): 11136–11148.
- 31. Malik SA, Qureshi IM, Zubair M, Amir M (2013) Numerical solution to Troesch’s problem using hybrid heuristic computing. Journal of Basic and Applied Scientific Research 3(7): 10–16.
- 32. Malik SA, Qureshi IM, Zubair M, Amir M (2013) Hybrid heuristic computational approach to the Bratu problem. Research Journal of Recent Sciences 2(10): 1–8.
- 33. Malek A, Beidokhti RS (2006) Numerical solution for high order differential equations using a hybrid neural network—optimization method. Applied Mathematics and Computation 183: 260–271.
- 34. Raja MAZ, Khan JA, Qureshi IM (2011) A new stochastic approach for solution of Riccati differential equation of fractional order. Annals of Mathematics and Artificial Inteigence:
- 35. Behrang MA, Ghalambaz M, Assareh E, Noghrehabadi AR (2011) A New Solution for Natural Convection of Darcian Fluid about a Vertical Full Cone Embedded in Porous Media Prescribed Wall Temperature by using a Hybrid Neural Network-Particle Swarm Optimization Method. World Academy of Science, Engineering, and Technology 49: 1098–1103.
- 36. Mitchell M (1995) Genetic algorithms: an overview. Complexity 1 (1): 31–39.
- 37. Ebaid A (2012) An improvement on the Exp-function method when balancing the highest order linear and nonlinear terms, Journal of Mathematical Analysis and Applications 392: 1–5.