Study of the contraction flow using grid generation technique

We study a model procedure to solve the incompressible Navier-Stokes equations on the flow inside contraction geometry. The governing equations are expressed in the primitive variable formulation. A rectangular computational plane is arises by elliptic grid generation technique. The numerical solution is based on a technique of automatic numerical generation of a curvilinear coordinate system. By transformed the governing equation into computational plane. The time dependent momentum equations are solved explicitly for the velocity field using the explicit marching procedure, the continuity equation is applied at each grid point in the solution of pressure equation, while the successive over relaxation (SOR) method is used for the Neumann problem for pressure. We will apply the technique on several irregular-shape.     

Nonstandard methods for the convective transport equation with nonlinear reactions

A new nonstandard Lagrangian method is constructed for the one-dimensional, transient convective transport equation with nonlinear reaction terms. An “exact” time-stepping scheme is developed with zero local truncation error with respect to time. The scheme is based on nonlocal treatment of nonlinear reactions, and when applied at each spatial grid point gives the new fully discrete numerical method. This approach leads to solutions free from the numerical instabilities that arise because of incorrect modeling of derivatives and nonlinear reaction terms. Algorithms are developed that preserve the properties of the numerical solution in the case of variable velocity fields by using nonuniform spatial grids. Effects of different interpolation techniques are examined and numerical results are presented to demonstrate the performance of the proposed new method. © 1998 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 14: 467–485, 1998     

Numerical solution for the KdV equation based on similarity reductions

The present paper is devoted to the development of a new scheme to solve the KdV equation locally on sub-domains using similarity reductions for partial differential equations. Each sub-domain is divided into three-grid points. The ordinary differential equation deduced from the similarity reduction can be linearized, integrated analytically and then used to approximate the flux vector in the KdV equation. The arbitrary constants in the analytical solution of the similarity equation can be determined in terms of the dependent variables at the grid points in each sub-domain. This approach eliminates the difficulties associated with boundary conditions for the similarity reductions over the whole solution domain. Numerical results are obtained for two test problems to show the behavior of the solution of the problems. The computed results are compared with other numerical results.     

Preliminary tests of a hybrid numerical-asymptotic method for solving nonlinear advection-diffusion equations in a domain limited by a self-adjusting boundary

An advection-diffusion equation is examined in which the diffusion coefficient is proportional to a positive power of the dependent variable, h. Because the diffusion coefficient is zero where h is zero, it is believed that the domain where h ≠ 0 expands at a finite velocity, u_η, which must be calculated in an appropriate way if an accurate numerical solution technique is to be implemented. An asymptotic study leads to a local approximation of u_η. The latter is then utilized in a finite volume solution of an axisymmetric problem where an exact solution can be obtained. The accuracy of the numerical results is excellent. Some peculiarities of the numerical solution are highlighted, and it is shown that they are due to the simplistic nature of the axisymmetric problem solved, which may be partly responsible for the high quality of the numerical results. Although the preliminary results are very encouraging, further testing of the method is needed, especially in fully two-dimensional cases.     

Multiresolution algorithms for the numerical solution of hyperbolic conservation laws

Given any scheme in conservation form and an appropriate uniform grid for the numerical solution of the initial value problem for one-dimensional hyperbolic conservation laws we describe a multiresolution algorithm that approximates this numerical solution to a prescribed tolerance in an efficient manner. To do so we consider the grid-averages of the numerical solution for a hierarchy of nested diadic grids in which the given grid is the finest, and introduce an equivalent multiresolution representation. The multiresolution representation of the numerical solution consists of its grid-averages for the coarsest grid and the set of errors in predicting the grid-averages of each level of resolution in this hierarchy from those of the next coarser one. Once the numerical solution is resolved to our satisfaction in a certain locality of some grid, then the prediction errors there are small for this particular grid and all finer ones; this enables us to compress data by setting to zero small components of the representation which fall below a prescribed tolerance. Therefore instead of computing the time-evolution of the numerical solution on the given grid we compute the time-evolution of its compressed multiresolution representation. Algorithmically this amounts to computing the numerical fluxes of the given scheme at the points of the given grid by a hierarchical algorithm which starts with the computation of these numerical fluxes at the points of the coarsest grid and then proceeds through diadic refinements to the given grid. At each step of refinement we add the values of the numerical flux at the center of the coarser cells. The information in the multiresolution representation of the numerical solution is used to determine whether the solution is locally well-resolved. When this is the case we replace the costly exact value of the numerical flux with an accurate enough approximate value which is obtained by an inexpensive interpolation from the coarser grid. The computational efficiency of this multiresolution algorithm is proportional to the rate of data compression (for a prescribed level of tolerance) that can be achieved for the numerical solution of the given scheme.     

Simulation of the Plasma-Sheath Equation on Condensing Grids

We consider the numerical solution of a Tonks–Langmuir integro-differential equation with an Emmert kernel, which describes the behavior of the potential both in the main plasma volume and in the thin boundary (Langmuir) layer. In the volume plasma the potential varies insignificantly, while in the thin layer near the wall (the sheath) it experiences rapid variation. To correctly resolve the behavior of the sheath solution, the numerical region is partitioned into several intervals with a uniform discrete grid in each interval. The interval lengths and the grid increments are successively halved. The second derivative is approximated at the halving points using a nonsymmetrical stencil, which ensures second-order approximation. Near the boundary of the numerical region a step-doubling condensation grid is used, which also ensures second-order approximation of the second-derivative operator. The condensation grid and the numerical algorithm are constructed. Some numerical results are reported.     

Numerical analysis of a continuous Galerkin method for damped sine-Gordon equation

In this article, we discuss the numerical solution for the two-dimensional (2-D) damped sine-Gordon equation by using a space–time continuous Galerkin method. This method allows variable time steps and space mesh structures and its discrete scheme has good stability which are necessary for adaptive computations on unstructured grids. Meanwhile, it can easily get the higher-order accuracy in both space and time directions. The existence and uniqueness to the numerical solution are strictly proved and a priori error estimate in maximum-norm is given without any space–time grid conditions attached. Also, we prove that if the mesh in each time level is generated in a reasonable way, we can get the optimal order of convergence in both temporal and spatial variables. Finally, the convergence rates are presented and analyzed by some numerical experiments to illustrate the validity of the scheme.     

Well-balanced unstaggered central schemes for one and two-dimensional shallow water equation systems

We propose a new well-balanced unstaggered central finite volume scheme for hyperbolic balance laws with geometrical source terms. In particular we construct a new one and two-dimensional finite volume method for the numerical solution of shallow water equations on flat/variable bottom topographies. The proposed scheme evolves a non-oscillatory numerical solution on a single grid, avoids the time consuming process of solving Riemann problems arising at the cell interfaces, and is second-order accurate both in space and time. Furthermore, the numerical scheme follows a well-balanced discretization that first discretizes the geometrical source term according to the discretization of the flux terms, and then mimics the surface gradient method and discretizes the water height according to the discretization of the water level. The resulting scheme exactly satisfies the C-property at the discrete level. The proposed scheme is then applied and classical one and two-dimensional shallow water equation problems with flat or variable bottom topographies are successfully solved. The obtained numerical results are in good agreement with corresponding ones appearing in the recent literature, thus confirming the potential and efficiency of the proposed method.     

New stochastic model for dispersion in heterogeneous porous media: 1. Application to unbounded domains

A new model of solute dispersion in porous media that avoids Fickian assumptions and that can be applied to variable drift velocities as in non-homogeneous or geometrically constricted aquifers, is presented. A key feature is the recognition that because drift velocity acts as a driving coefficient in the kinematical equation that describes random fluid displacements at the pore scale, the use of Ito calculus and related tools from stochastic differential equation theory (SPDE) is required to properly model interaction between pore scale randomness and macroscopic change of the drift velocity. Solute transport is described by formulating an integral version of the solute mass conservation equations, using a probability density. By appropriate linking of this to the related but distinct probability density arising from the kinematical SPDE, it is shown that the evolution of a Gaussian solute plume can be calculated, and in particular its time-dependent variance and hence dispersivity. Exact analytical solutions of the differential and integral equations that this procedure involves, are presented for the case of a constant drift velocity, as well as for a constant velocity gradient. In the former case, diffusive dispersion as familiar from the advection–dispersion equation is recovered. However, in the latter case, it is shown that there are not only reversible kinematical dispersion effects, but also irreversible, intrinsically stochastic contributions in excess of that predicted by diffusive dispersion. Moreover, this intrinsic contribution has a non-linear time dependence and hence opens up the way for an explanation of the strong observed scale dependence of dispersivity.     

A conservative pressure-correction scheme for transient simulations of reacting flows

An algorithm is presented for numerical simulations of time-dependent low Mach number variable density flows with an arbitrary amount of scalar transport equations and a complex equation of state. The pressure-correction type algorithm is based on a segregated solution formalism. It is conservative and guarantees stable results, regardless of the difference in density between neighboring cells. Furthermore, states are predicted which exactly match the equation of state. In the one-dimensional example, considering non-premixed flames, a simplified flamesheet model is used to describe the combustion of fuel and oxidizer. We demonstrate that the predicted states exactly correspond to the equation of state. We illustrate the accuracy improvement due to higher order formulation and demonstrate grid convergence.     

High order compact solution of the one‐space‐dimensional linear hyperbolic equation

In this article, we introduce a high‐order accurate method for solving one‐space dimensional linear hyperbolic equation. We apply a compact finite difference approximation of fourth order for discretizing spatial derivative of linear hyperbolic equation and collocation method for the time component. The main property of this method additional to its high‐order accuracy due to the fourth order discretization of spatial derivative, is its unconditionally stability. In this technique the solution is approximated by a polynomial at each grid point that its coefficients are determined by solving a linear system of equations. Numerical results show that the compact finite difference approximation of fourth order and collocation method produce a very efficient method for solving the one‐space‐dimensional linear hyperbolic equation. We compare the numerical results of this paper with numerical results of (Mohanty, 3 .© 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2008     

A deterministic scheme for Smoluchowski's coagulation equation based on binary grid refinement

We present a deterministic scheme for the discrete Smoluchowski's coagulation equation based on a binary grid refinement. Starting from the binary grid Ω₀={1,2,4,8,16,. . .}, we first introduce an appropriate grid refinement by adding at each level 2^l grid points in every binary subsection of the grid Ω_l. In a next step we derive an approximate equation for the dynamic behavior on each level Ω_l based on a piecewise constant approximation of the right hand side of Smoluchowski's equation. Numerical results show that the computational effort can be drastically decreased compared to the corresponding complete integer grid. When considering unbounded kernels in Smoluchowski's equation we use an adaptive time step method to overcome numerical instabilities which may occur at the tails of the density function.     

A new fractional finite volume method for solving the fractional diffusion equation

The inherent heterogeneities of many geophysical systems often gives rise to fast and slow pathways to water and chemical movement. One approach to model solute transport through such media is by fractional diffusion equations with a space–time dependent variable coefficient. In this paper, a two-sided space fractional diffusion model with a space–time dependent variable coefficient and a nonlinear source term subject to zero Dirichlet boundary conditions is considered.Some finite volume methods to solve a fractional differential equation with a constant dispersion coefficient have been proposed. The spatial discretisation employs fractionally-shifted Grünwald formulas to discretise the Riemann–Liouville fractional derivatives at control volume faces in terms of function values at the nodes. However, these finite volume methods have not been extended to two-dimensional and three-dimensional problems in a natural manner. In this paper, a new weighted fractional finite volume method with a nonlocal operator (using nodal basis functions) for solving this two-sided space fractional diffusion equation is proposed. Some numerical results for the Crank–Nicholson fractional finite volume method are given to show the stability, consistency and convergence of our computational approach. This novel simulation technique provides excellent tools for practical problems even when a complex transition zone is involved. This technique can be extend to two-dimensional and three-dimensional problems with complex regions.     

Bäcklund transformations and soliton solutions for the KdV6 equation

Using Hirota technique, a Bäcklund transformation in bilinear form is obtained for the KdV6 equation. Furthermore, we present a modified Bäcklund transformation by a dependent variable transformation, it is shown that a new representation of N-soliton solution and some novel solutions to the KdV6 equation are derived by performing an appropriate limiting procedure on the known soliton solutions.     

A finite difference scheme for a class of singularly perturbed initial value problems for delay differential equations

This study deals with the singularly perturbed initial value problem for a quasilinear first-order delay differential equation. A numerical method is generated on a grid that is constructed adaptively from a knowledge of the exact solution, which involves appropriate piecewise-uniform mesh on each time subinterval. An error analysis shows that the method is first order convergent except for a logarithmic factor, in the discrete maximum norm, independently of the perturbation parameter. The parameter uniform convergence is confirmed by numerical computations.     

Alternating group explicit method for the diffusion equation

A new alternating group explicit method is presented for the finite difference solution of the diffusion equation. The new method uses stable asymmetric approximations to the partial differential equation which, when coupled in groups of two adjacent points on the grid, result in implicit equations which can be easily converted to explicit form and which offer many advantages. By judicious alternation of this strategy on the grid points of the domain an algorithm which possesses unconditional stability is obtained. This approach also results in more accurate solutions because of truncation error cancellations. The stability, consistency, convergence and truncation error of the new method are briefly discussed and the results of numerical experiments presented.     

Long distance wave computation using nonlinear solitary waves

A recently developed method is described to propagate short wave equation pulses over indefinite distances and through regions of varying indices of refraction, including multiple reflections. The method, “Wave Confinement”, utilizes a newly developed nonlinear partial differential equation (pde) that propagates basis functions according to the wave equation. These basis functions are generated as stable solitary waves where the discretized equation can be solved without any numerical dissipation. The method can also be used to solve for harmonic waves in the high frequency (Eikonal) limit, including multiple arrivals. The solution involves discretizing the wave equation on a uniform Eulerian grid and adding a simple nonlinear “Confinement” term. This term does not change the amplitude (integrated through each point on the pulse surface) or the propagation velocity, or arrival time, and yet results in capturing the waves as thin surfaces that propagate as thin nonlinear solitary waves and remain ∼2-3 grid cells in thickness indefinitely with no numerical spreading. A new feature described in this paper involves computing scattering of short pulses from complex objects such as complete aircraft. A simple “immersed surface” approach is used, that utilizes the same uniform grid as the propagation and avoids complex, body fitted or adaptive grid schemes.The new method should be useful in areas of wave propagation, from radar scattering and long distance communications to cell phone transmission.     

Difference schemes for the numerical solution of the heat conduction equation with aftereffect

A family of grid methods is constructed for the numerical solution of the heat conduction equation in the general form with delay; the methods are based on the idea of separating the current state and the prehistory function. A theorem is obtained on the order of convergence of the methods, which uses the technique of proving similar statements for functional differential equations and methods from the general theory of difference schemes. Results of calculating test examples with constant and variable delay are presented.     

Finite analytic numerical method for solving two‐dimensional quasi‐Laplace equation

A typical power series analytic solution of quasi‐Laplace equation in the infinitesimal angle domain around the singular point of the square cells is provided in this article. Toward the singular point, the gradient of the potential variable will tend to infinity, which is described by the first term of the power series solution. Based on this analytic solution, three finite analytic numerical methods are proposed. These methods are analogous and are constructed, respectively, when considering different numbers of the terms or using different schemes to determine the relevant parameters in the power series. Numerical examples show that all of the three finite analytic numerical methods proposed can provide rather accurate solutions than the traditional numerical methods. In contrast, when using the traditional numerical schemes to solve the quasi‐Laplace equation in a strong heterogeneous medium, the refinement ratio for the grid cell needs to increase dramatically to get an accurate result. In practical applications, subdividing each origin cell into 2 × 2 or 3 × 3 subcells is enough for the finite analytical numerical methods to get relatively accurate results. The finite analytical numerical methods are also convenient to construct the flux field with high accuracy.© 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 1755–1769, 2014     

Integrated fast and high‐accuracy computation of convection diffusion equations using multiscale multigrid method

We present an explicit sixth‐order compact finite difference scheme for fast high‐accuracy numerical solutions of the two‐dimensional convection diffusion equation with variable coefficients. The sixth‐order scheme is based on the well‐known fourth‐order compact (FOC) scheme, the Richardson extrapolation technique, and an operator interpolation scheme. For a particular implementation, we use multiscale multigrid method to compute the fourth‐order solutions on both the coarse grid and the fine grid. Then, an operator interpolation scheme combined with the Richardson extrapolation technique is used to compute a sixth‐order accurate fine grid solution. We compare the computed accuracy and the implementation cost of the new scheme with the standard nine‐point FOC scheme and Sun–Zhang's sixth‐order method. Two convection diffusion problems are solved numerically to validate our proposed sixth‐order scheme. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2011