Numerical solutions and analysis of diffusion for new generalized fractional Burgers equation

Author(s):  
Yufeng Xu ◽  
Om Agrawal

AbstractIn this paper, numerical solutions of Burgers equation defined by using a new Generalized Time-Fractional Derivative (GTFD) are discussed. The numerical scheme uses a finite difference method. The new GTFD is defined using a scale function and a weight function. Many existing fractional derivatives are the special cases of it. A linear recurrence relationship for the numerical solutions of the resulting system of linear equations is found via finite difference approach. Burgers equations with different fractional orders and coefficients are computed which show that this numerical method is simple and effective, and is capable of solving the Burgers equation accurately for a wide range of viscosity values. Furthermore, we study the influence of the scale and the weight functions on the diffusion process of Burgers equation. Numerical simulations illustrate that a scale function can stretch or contract the diffusion on the time domain, while a weight function can change the decay velocity of the diffusion process.

Open Physics ◽  
2013 ◽  
Vol 11 (10) ◽  
Author(s):  
Yufeng Xu ◽  
Om Agrawal

AbstractIn this paper we study a class of new Generalized Fractional Advection-Diffusion Equations (GFADEs) with a new Generalized Fractional Derivative (GFD) proposed last year. The new GFD is defined in the Caputo sense using a weight function and a scale function. The GFADE is discussed in a bounded domain, and numerical solutions for two examples consisting of a linear and a nonlinear GFADE are obtained using an implicit finite difference approach. The stability of the numerical scheme is investigated, and the order of convergence is estimated numerically. Numerical results illustrate that the finite difference scheme is simple and effective for solving the GFADEs. We investigate the influence of weight and scale functions on the diffusion of GFADEs. Linear and nonlinear stretching and contracting functions are considered. It is found that an increasing weight function increases the rate of diffusion, and a scale function can stretch or contract the diffusion on the time domain.


2010 ◽  
Vol 65 (8-9) ◽  
pp. 633-640 ◽  
Author(s):  
Rathinasamy Sakthivel ◽  
Changbum Chun ◽  
Jonu Lee

The nonlinear evolution equations with finite memory have a wide range of applications in science and engineering. The Burgers equation with finite memory transport (time-delayed) describes convection-diffusion processes. In this paper, we establish the new solitary wave solutions for the time-delayed Burgers equation. The extended tanh method and the exp-function method have been employed to reveal these new solutions. Further, we have calculated the numerical solutions of the time-delayed Burgers equation with initial conditions by using the homotopy perturbation method (HPM). Our results show that the extended tanh and exp-function methods are very effective in finding exact solutions of the considered problem and HPM is very powerful in finding numerical solutions with good accuracy for nonlinear partial differential equations without any need of transformation or perturbation


2012 ◽  
Vol 2012 ◽  
pp. 1-13 ◽  
Author(s):  
Qiaojie Li ◽  
Zhoushun Zheng ◽  
Shuang Wang ◽  
Jiankang Liu

An explicit finite difference scheme for one-dimensional Burgers equation is derived from the lattice Boltzmann method. The system of the lattice Boltzmann equations for the distribution of the fictitious particles is rewritten as a three-level finite difference equation. The scheme is monotonic and satisfies maximum value principle; therefore, the stability is proved. Numerical solutions have been compared with the exact solutions reported in previous studies. TheL2, L∞and Root-Mean-Square (RMS) errors in the solutions show that the scheme is accurate and effective.


Mathematics ◽  
2020 ◽  
Vol 8 (12) ◽  
pp. 2194
Author(s):  
Francisco I. Chicharro ◽  
Rafael A. Contreras ◽  
Neus Garrido

A straightforward family of one-point multiple-root iterative methods is introduced. The family is generated using the technique of weight functions. The order of convergence of the family is determined in its convergence analysis, which shows the constraints that the weight function must satisfy to achieve order three. In this sense, a family of iterative methods can be obtained with a suitable design of the weight function. That is, an iterative algorithm that depends on one or more parameters is designed. This family of iterative methods, starting with proper initial estimations, generates a sequence of approximations to the solution of a problem. A dynamical analysis is also included in the manuscript to study the long-term behavior of the family depending on the parameter value and the initial guess considered. This analysis reveals the good properties of the family for a wide range of values of the parameter. In addition, a numerical test on academic and engineering multiple-root functions is performed.


2017 ◽  
Vol 13 (1) ◽  
pp. 19-30 ◽  
Author(s):  
Yusuf Ucar ◽  
Nuri Murat Yagmurlu ◽  
Orkun Tasbozan

Abstract In this study, a numerical solution of the modified Burgers’ equation is obtained by the finite difference methods. For the solution process, two linearization techniques have been applied to get over the non-linear term existing in the equation. Then, some comparisons have been made between the obtained results and those available in the literature. Furthermore, the error norms L2 and L∞ are computed and found to be sufficiently small and compatible with others in the literature. The stability analysis of the linearized finite difference equations obtained by two different linearization techniques has been separately conducted via Fourier stability analysis method.


10.37236/2475 ◽  
2012 ◽  
Vol 19 (3) ◽  
Author(s):  
Tomer Kotek ◽  
James Preen ◽  
Frank Simon ◽  
Peter Tittmann ◽  
Martin Trinks

The domination polynomial $D(G,x)$ of a graph $G$ is the generating function of its dominating sets. We prove that $D(G,x)$ satisfies a wide range of reduction formulas. We show linear recurrence relations for $D(G,x)$ for arbitrary graphs and for various special cases. We give splitting formulas for $D(G,x)$ based on articulation vertices, and more generally, on splitting sets of vertices.


1980 ◽  
Vol 33 (2) ◽  
pp. 449 ◽  
Author(s):  
Kailash Kumar

The matrix elements of the linear Boltzmann collision operator are calculated in a Burnett-function basis determined by a weight function which itself describes a velocity distribution with a net drift and an anisotropic pressure (or temperature) tensor. Three different methods of calculation are described, leading to three different types of formulae. Two of these involve infinite summations, while the third involves only finite sums, but at the cost of greater complications in the summands and the integrals over cross sections. Both elastic and inelastic collisions are treated. Special cases arising from particular choices of the parameters in the weight functions are pointed out. The structure of the formulae is illustrated by means of diagrams. The work is a contribution towards establishing efficient methods of calculation based upon a better understanding of the matrix elements in such bases.


2001 ◽  
Vol 6 (3) ◽  
pp. 157-169
Author(s):  
Andreas Ruffing ◽  
Patrick Windpassinger ◽  
Stefan Panig

We revise the interrelations between the classical Black Scholes equation, the diffusion equation and Burgers equation. Some of the algebraic properties the diffusion equation shows are elaborated and qualitatively presented. The related numerical elementary recipes are briefly elucidated in context of the diffusion equation. The quality of the approximations to the exact solutions is compared throughout the visualizations. The article mainly is based on the pedagogical style of the presentations to the Novacella Easter School 2000 on Financial Mathematics.


Sign in / Sign up

Export Citation Format

Share Document