Analytical and numerical solutions of generalized Burgers' equation via Buckingham's Pi-theorem

2005 ◽  
Vol 83 (10) ◽  
pp. 1035-1049
Author(s):  
I A Hassanien ◽  
A A Salama ◽  
H A Hosham

A generalized dimensional analysis performed by using Buckingham's Pi-theorem for the generalized Burgers' equation is presented. The application of the Buckingham Pi-theorem is used to reduce the governing partial differential equation with the boundary and initial conditions to an ordinary differential equation with appropriate corresponding conditions. By using a scaling invariant we simplify the similarity solutions, which are discussed for a specific choice of boundary conditions, and yield analytical solutions, which are in closed form. Also, using extended one-step methods of order five we solve the final ordinary differential equations. This criterion for solvability involves converting the boundary value problem to an initial value problem. PACS Nos.: 02.60.Lj, 47.27.Jv

2019 ◽  
Vol 874 ◽  
pp. 285-298 ◽  
Author(s):  
Thomasina V. Ball ◽  
Herbert E. Huppert

A wide range of initial-value problems in fluid mechanics in particular, and in the physical sciences in general, are described by nonlinear partial differential equations. Recourse must often be made to numerical solutions, but a powerful, well-established technique is to solve the problem in terms of similarity variables. A disadvantage of the similarity solution is that it is almost always independent of any specific initial conditions, with the solution to the full differential equation approaching the similarity solution for times $t\gg t_{\ast }$, for some $t_{\ast }$. But what is $t_{\ast }$? In this paper we consider the situation of viscous gravity currents and obtain useful formulae for the time of approach, $\unicode[STIX]{x1D70F}(p)$, for a number of different initial shapes, where $p$ is the percentage disagreement between the radius of the current as determined by the full numerical solution of the governing partial differential equation and the similarity solution normalised by the similarity solution. We show that for any initial shape of volume $V,\unicode[STIX]{x1D70F}\propto 1/(\unicode[STIX]{x1D6FD}V^{1/3}\unicode[STIX]{x1D6FE}_{0}^{8/3}p)$ (as $p\downarrow 0$), where $\unicode[STIX]{x1D6FD}=g\unicode[STIX]{x0394}\unicode[STIX]{x1D70C}/(3\unicode[STIX]{x1D707})$, with $g$ representing the acceleration due to gravity, $\unicode[STIX]{x0394}\unicode[STIX]{x1D70C}$ the density difference between the gravity current and the ambient, $\unicode[STIX]{x1D707}$ the dynamic viscosity of the fluid that makes up the gravity current and $\unicode[STIX]{x1D6FE}_{0}$ the initial aspect ratio. This framework can used in many other situations, including where it is not an initial condition (in time) that is studied but one valid for specified values at a special spatial coordinate.


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-25 ◽  
Author(s):  
A. H. Bhrawy ◽  
M. A. Alghamdi

A shifted Jacobi Galerkin method is introduced to get a direct solution technique for solving the third- and fifth-order differential equations with constant coefficients subject to initial conditions. The key to the efficiency of these algorithms is to construct appropriate base functions, which lead to systems with specially structured matrices that can be efficiently inverted. A quadrature Galerkin method is introduced for the numerical solution of these problems with variable coefficients. A new shifted Jacobi collocation method based on basis functions satisfying the initial conditions is presented for solving nonlinear initial value problems. Through several numerical examples, we evaluate the accuracy and performance of the proposed algorithms. The algorithms are easy to implement and yield very accurate results.


2004 ◽  
Vol 4 (2) ◽  
Author(s):  
Jon Collis ◽  
Erik S. Van Vleck

AbstractShadowing is a means of characterizing global errors in the numerical solution of initial value differential equations by allowing for small perturbations in the initial conditions. The method presented in this paper provides a technique for efficient estimation of the shadowing global error for systems that have a large number of exponentially decaying modes. The method is formulated for one-step methods and is applied to the spatial discretization of some dissipative PDEs.


2000 ◽  
Vol 5 (1) ◽  
pp. 47-63 ◽  
Author(s):  
G. Edgar Parker ◽  
James S. Sochacki

In 1988, Parker and Sochacki announced a theorem which proved that the Picard iteration, properly modified, generates the Taylor series solution to any ordinary differential equation (ODE) onℜnwith a polynomial generator. In this paper, we present an analogous theorem for partial differential equations (PDEs) with polynomial generators and analytic initial conditions. Since the domain of a solution of a PDE is a subset ofℜn, we identify one component of the domain to achieve the analogy with ODEs. The generator for the PDE must be a polynomial and autonomous with respect to this component, and no partial derivative with respect to this component can appear in the domain of the generator. The initial conditions must be given in the designated component at zero and must be analytic in the nondesignated components. The power series solution of such a PDE, whose existence is guaranteed by the Cauchy theorem, can be generated to arbitrary degree by Picard iteration. As in the ODE case these conditions can be met, for a broad class of PDEs, through polynomial projections.


10.14311/368 ◽  
2002 ◽  
Vol 42 (4) ◽  
Author(s):  
P. Koníček ◽  
M. Bednařík ◽  
M. Červenka

This paper deals with possibilities of using the generalized Burgers equation and the KZK equation to describe nonlinear waves in circular ducts. A new method for calculating of diffraction effects taking into account boundary layer effects is described. The results of numerical solutions of the model equations are compared. Finally, the limits of validity of the used model equations are discussed with respect to boundary conditions and the radius of the circular duct. The limits of applicability of the KZK equation and the GBE equation for describing nonlinear waves in tubes are discussed.


Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-12 ◽  
Author(s):  
Josef Rebenda ◽  
Zuzana Pátíková

An algorithm using the differential transformation which is convenient for finding numerical solutions to initial value problems for functional differential equations is proposed in this paper. We focus on retarded equations with delays which in general are functions of the independent variable. The delayed differential equation is turned into an ordinary differential equation using the method of steps. The ordinary differential equation is transformed into a recurrence relation in one variable using the differential transformation. Approximate solution has the form of a Taylor polynomial whose coefficients are determined by solving the recurrence relation. Practical implementation of the presented algorithm is demonstrated in an example of the initial value problem for a differential equation with nonlinear nonconstant delay. A two-dimensional neutral system of higher complexity with constant, nonconstant, and proportional delays has been chosen to show numerical performance of the algorithm. Results are compared against Matlab function DDENSD.


Axioms ◽  
2018 ◽  
Vol 7 (3) ◽  
pp. 58 ◽  
Author(s):  
Francesca Mazzia ◽  
Alessandra Sestini

The class of A-stable symmetric one-step Hermite–Obreshkov (HO) methods introduced by F. Loscalzo in 1968 for dealing with initial value problems is analyzed. Such schemes have the peculiarity of admitting a multiple knot spline extension collocating the differential equation at the mesh points. As a new result, it is shown that these maximal order schemes are conjugate symplectic, which is a benefit when the methods have to be applied to Hamiltonian problems. Furthermore, a new efficient approach for the computation of the spline extension is introduced, adopting the same strategy developed for the BS linear multistep methods. The performances of the schemes are tested in particular on some Hamiltonian benchmarks and compared with those of the Gauss–Runge–Kutta schemes and Euler–Maclaurin formulas of the same order.


2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Dawei Cheng ◽  
Wenke Wang ◽  
Xi Chen ◽  
Zaiyong Zhang

For one-dimensional (1D) nonlinear consolidation, the governing partial differential equation is nonlinear. This paper develops the finite analytic method (FAM) to simulate 1D nonlinear consolidation under different time-dependent loading and initial conditions. To achieve this, the assumption of constant initial effective stress is not considered and the governing partial differential equation is transformed into the diffusion equation. Then, the finite analytic implicit scheme is established. The convergence and stability of finite analytic numerical scheme are proven by a rigorous mathematical analysis. In addition, the paper obtains three corrected semianalytical solutions undergoing suddenly imposed constant loading, single ramp loading, and trapezoidal cyclic loading, respectively. Comparisons of the results of FAM with the three semianalytical solutions and the result of FDM, respectively, show that the FAM can obtain stable and accurate numerical solutions and ensure the convergence of spatial discretization for 1D nonlinear consolidation.


Sign in / Sign up

Export Citation Format

Share Document