Parametric spline functions for the solution of the one time fractional Burgers’ equation

This paper aims to present a general framework of the cubic parametric spline functions to develop a numerical method for obtaining an approximate solution for the time fractional Burgers’ equation. The truncation error of the method is theoretically analyzed. Using Von Neumann method, the proposed method is also shown to be conditionally stable. Two numerical examples are then included to illustrate the practical implementation of the proposed method. The obtained results reveal that the proposed technique is very effective, convenient and quite accurate to such considered problems.     

Numerical solutions of partial differential equations by discrete homotopy analysis method

This paper introduces a discrete homotopy analysis method (DHAM) to obtain approximate solutions of linear or nonlinear partial differential equations (PDEs). The DHAM can take the many advantages of the continuous homotopy analysis method. The proposed DHAM also contains the auxiliary parameter ?, which provides a simple way to adjust and control the convergence region of solution series. The convergence of the DHAM is proved under some reasonable hypotheses, which provide the theoretical basis of the DHAM for solving nonlinear problems. Several examples, including a simple diffusion equation and two-dimensional Burgers’ equations, are given to investigate the features of the DHAM. The numerical results obtained by this method have been compared with the exact solutions. It is shown that they are in good agreement with each other.     

A meshless method for Burgers’ equation using MQ-RBF and high-order temporal approximation

In this paper, a new numerical method is proposed to solve one-dimensional Burgers’ equation using multiquadric (MQ) radial basis function (RBF) for spatial approximation and a second-order compact finite difference scheme for temporal approximation. The numerical results obtained by this way for different Reynolds number have been compared with the existing numerical schemes to show the accuracy and efficiency of the approach. To show the superiority of this meshless method, numerical experiments with non-uniform MQ interpolation node distribution are also performed.     

Toward a modified variational iteration method

The variational iteration method (VIM) attracted much attention in the past few years as a promising method for solving nonlinear differential equations. It is shown in this paper that the application of VIM to a special kind of nonlinear differential equations leads to calculation of unneeded terms and more time consumed in repeated calculations for series solutions. A modified VIM is introduced to eliminate the shortcomings; and its effectiveness is illustrated by some examples.     

Numerical solution of the Burgers’ equation by automatic differentiation

We compute the solution of the one-dimensional Burgers’ equation by marching the solution in time using a Taylor series expansion. Our approach does not require symbolic manipulation and does not involve the solution of a system of linear or non-linear algebraic equations. Instead, we use recursive formulas obtained from the differential equation to calculate exact values of the derivatives needed in the Taylor series. We illustrate the effectiveness of our method by solving four test problems with known exact solutions. The numerical solutions we obtain are in excellent agreement with the exact solutions, while being superior to other previously reported numerical solutions.     

A numerical assessment of parabolic partial differential equations using Haar and Legendre wavelets

In this paper we present two new numerically stable methods based on Haar and Legendre wavelets for one- and two-dimensional parabolic partial differential equations (PPDEs). This work is the extension of the earlier work ,  and  from one- and two-dimensional boundary-value problems to one- and two- dimensional PPDEs. Two generic numerical algorithms are derived in two phases. In the first stage a numerical algorithm is derived by using Haar wavelets and then in the second stage Haar wavelets are replaced by Legendre wavelets in quest for better accuracy. In the proposed methods the time derivative is approximated by first order forward difference operator and space derivatives are approximated using Haar (Legendre) wavelets. Improved accuracy is obtained in the form of wavelets decomposition. The solution in this process is first obtained on a coarse grid and then refined towards higher accuracy in the high resolution space. Accuracy wise performance of the Legendre wavelets collocation method (LWCM) is better than the Haar wavelets collocation method (HWCM) for problems having smooth initial data or having no shock phenomena in the solution space. If sharp transitions exists in the solution space or if there is a discontinuity between initial and boundary conditions, LWCM loses its accuracy in such cases, whereas HWCM produces a stable solution in such cases as well. Contrary to the existing methods, the accuracy of both HWCM and LWCM do not degrade in case of Neumann’s boundary conditions. A distinctive feature of the proposed methods is its simple applicability for a variety of boundary conditions. Performances of both HWCM and LWCM are compared with the most recent methods reported in the literature. Numerical tests affirm better accuracy of the proposed methods for a range of benchmark problems.     

An efficient computational method for the optimal control problem for the Burgers equation

Pointwise control of the viscous Burgers equation in one spatial dimension is studied with the objective of minimizing the distance between the final state function and target profile along with the energy of the control. An efficient computational method is proposed for solving such problems, which is based on special orthonormal functions that satisfy the associated boundary conditions. Employing these orthonormal functions as a basis of a modal expansion method, the solution space is limited to the smallest lower subspace that is sufficient to describe the original problem. Consequently, the Burgers equation is reduced to a set of a minimal number of ordinary nonlinear differential equations. Thus, by the modal expansion method, the optimal control of a distributed parameter system described by the Burgers equation is converted to the optimal control of lumped parameter dynamical systems in finite dimension. The time-variant control is approximated by a finite term of the Fourier series whose unknown coefficients and frequencies giving an optimal solution are sought, thereby converting the optimal control problem into a mathematical programming problem. The solution space obtained is based on control parameterization by using the Runge–Kutta method. The efficiency of the proposed method is examined using a numerical example for various target functions.     

A mesh-free method for the numerical solution of the KdV–Burgers equation

This paper formulates a simple classical radial basis functions (RBFs) collocation (Kansa) method for the numerical solution of the nonlinear dispersive and dissipative KdV–Burgers’ (KdVB) equation. The computed results show implementation of the method to nonlinear partial differential equations. This method has an edge over traditional methods such as finite-difference and finite element methods because it does not require a mesh to discretize the problem domain, and a set of scattered nodes in the domain of influence provided by initial data is required for the realization of the method. Accuracy of the method is assessed in terms of error norms _L2,_L∞$L_2\text{,}{L}_{\infty }$, number of nodes in the domain of influence, parameter dependent RBFs and time step length. Numerical experiments demonstrate accuracy and robustness of the method for solving nonlinear dispersive and dissipative problems.     

Numerical solution of Burgers’ equation by the Sobolev gradient method

Burgers’ equation is solved numerically with Sobolev gradient methods. A comparison is shown with other numerical schemes presented in this journal, such as modified Adomian method (MAM) [1] and by a variational method (VM) which is based on the method of discretization in time [2]. It is shown that the Sobolev gradient methods are highly efficient while at the same time retaining the simplicity of steepest descent algorithms.     

Error analysis of approximate solutions of non-linear Burgers’ equation

This paper deals with application of the maximum principle for differential equations to the finite difference method for determining upper and lower approximate solutions of the non-linear Burgers’ equation and their error range. In term of mathematical architecture, the paper is based on the maximum principle for parabolic differential equations to establish monotonic residual relations of the Burgers’ equation; and in terms of numerical method, it applies the finite difference method to discretize the equation, followed by use of the proposed Residual Correction Method for obtaining its optimal solutions under constraint conditions for inequalities. Derived by using this approach, the upper and lower transient approximate solutions are not just useful in analyzing the range of the maximum possible error between them and the analytic solutions correctly, and the numerical validations also indicate good accuracy in mean values of the upper and lower approximate solutions.     

A compact finite difference method for the solution of the generalized Burgers–Fisher equation

In this article, numerical solutions of the generalized Burgers–Fisher equation are obtained using a compact finite difference method with minimal computational effort. To verify this, a combination of a sixth‐order compact finite difference scheme in space and a low‐storage third‐order total variation diminishing Runge–Kutta scheme in time have been used. The computed results with the use of this technique have been compared with the exact solution to show the accuracy of it. The approximate solutions to the equation have been computed without transforming the equation and without using linearization. Comparisons indicate that there is a very good agreement between the numerical solutions and the exact solutions in terms of accuracy. The present method is seen to be a very good alternative to some existing techniques for realistic problems. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2010     

Analytic continuation of Taylor series and the boundary value problems of some nonlinear ordinary differential equations

We compare and discuss the respective efficiency of three methods (with two variants for each of them), based respectively on Taylor (Maclaurin) series, Padé approximants and conformal mappings, for solving quasi-analytically a two-point boundary value problem of a nonlinear ordinary differential equation (ODE). Six configurations of ODE and boundary conditions are successively considered according to the increasing difficulties that they present. After having indicated that the Taylor series method almost always requires the recourse to analytical continuation procedures to be efficient, we use the complementarity of the two remaining methods (Padé and conformal mapping) to illustrate their respective advantages and limitations. We emphasize the importance of the existence of solutions with movable singularities for the efficiency of the methods, particularly for the so-called Padé-Hankel method. (We show that this latter method is equivalent to pushing a movable pole to infinity.) For each configuration, we determine the singularity distribution (in the complex plane of the independent variable) of the solution sought and show how this distribution controls the efficiency of the two methods. In general the method based on Padé approximants is easy to use and robust but may be awkward in some circumstances whereas the conformal mapping method is a very fine method which should be used when high accuracy is required.     

On the new solutions of the generalized Burgers–Huxley equation

In this paper, we investigate a class of generalized Burgers–Huxley equation by employing the bifurcation method of planar dynamical systems. Firstly, we reduce the equation to a planar system via the traveling wave solution ansatz; then by computing the singular point quantities, we obtain the conditions of integrability and determine the existence of one stable limit cycle from Hopf bifurcation in the corresponding planar system. From this, some new exact solutions and a special periodic traveling wave solution, which is isolated as a limit, are obtained. Copyright © 2016 John Wiley & Sons, Ltd.     

Radial basis function collocation method for the numerical solution of the two-dimensional transient nonlinear coupled Burgers’ equations

This paper examines the numerical solution of the transient nonlinear coupled Burgers’ equations by a Local Radial Basis Functions Collocation Method (LRBFCM) for large values of Reynolds number (Re) up to 10³. The LRBFCM belongs to a class of truly meshless methods which do not need any underlying mesh but works on a set of uniform or random nodes without any a priori node to node connectivity. The time discretization is performed in an explicit way and collocation with the multiquadric radial basis functions (RBFs) are used to interpolate diffusion-convection variable and its spatial derivatives on decomposed domains. Five nodded domains of influence are used in the local support. Adaptive upwind technique [1] and [54] is used for stabilization of the method for large Re in the case of mixed boundary conditions. Accuracy of the method is assessed as a function of time and space discretizations. The method is tested on two benchmark problems having Dirichlet and mixed boundary conditions. The numerical solution obtained from the LRBFCM for different value of Re is compared with analytical solution as well as other numerical methods [15], [47] and [49]. It is shown that the proposed method is efficient, accurate and stable for flow with reasonably high Reynolds numbers.     

A novel numerical scheme for solving Burgers’ equation

In this paper, we propose a novel numerical scheme for solving Burgers’ equation. The scheme is based on a cubic spline quasi-interpolant and multi-node higher order expansion, which make the algorithm simple and easy to implement. The numerical experiments show that the proposed method produces high accurate results.     

Solving the generalized Burgers–Huxley equation using the Adomian decomposition method

In this paper, a convergence proof of the Adomian decomposition method (ADM) applied to the generalized nonlinear Burgers–Huxley equation is presented. The decomposition scheme obtained from the ADM yields an analytical solution in the form of a rapidly convergent series. The direct symbolic–numeric scheme is shown to be efficient and accurate.     

The Laplace transform and polynomial Trefftz method for a class of time dependent PDEs

In this paper, we present a new method for solving 1D time dependent partial differential equations based on the Laplace transform (LT). As a result, the problem is converted into a stationary boundary value problem (BVP) which depends on the parameter of LT. The resulting BVP is solved by the polynomial Trefftz method (PTM), which can be regarded as a meshless method. In PTM, the source term is approximated by a truncated series of Chebyshev polynomials and the particular solution is obtained from a recursive procedure. Talbot’s method is employed for the numerical inversion of LT. The method is tested with the help of some numerical examples.     

Use of 3D-transient analytical solution based on Green’s function to reduce computational time in inverse heat conduction problems

Inverse problems can be found in many areas of science and engineering and can be applied in different ways. Two examples can be cited: thermal properties estimation or heat flux function estimation in some engineering thermal process. Different techniques for the solution of inverse heat conduction problem (IHCP) can be found in literature. However, any inverse or optimization technique has a basic and common characteristic: the need to solve the direct problem solution several times. This characteristic is the cause of the great computational time consumed. In heat conduction problem, the time consumed is, usually, due to the use of numerical solutions of multidimensional models with refined mesh. In this case, if analytical solutions are available the computational time can be reduced drastically. This study presents the development and application of a 3D-transient analytical solution based on Green’s function. The inverse problem is due to the thermal properties estimation of conductors. The method is based on experimental determination of thermal conductivity and diffusivity using partially heated surface method without heat flux transducer. Originally developed to use numerical solution, this technique can, using analytical solution, estimate thermal properties faster and with better accuracy.     

Time-discretization schema for an integrodifferential Sobolev type equation with integral conditions

The appropriate discretization in time schema is considered for approximating the solution of a nonlinear integro-differential Sobolev type equation with integral conditions. We construct a discrete numerical solution of the discretized problem. Then, some a priori estimates for the approximations are derived, while the convergence of the method and the well posedness of the problem under study are established.