Using generating functions to convert an implicit (3,3) finite difference method to an explicit form on diffusion equation with different boundary conditions

In this article, our main goal is to develop an idea to convert an implicit (3,3) ??-scheme finite difference method to an explicit form for both linear and nonlinear diffusion equations and also for nonlinear advection-diffusion equation with different boundary conditions. Accordingly, we assist power series generating functions which are a routine method in discrete mathematics. Also, the stability analysis of ??–scheme to implement in nonlinear advection–diffusion equation has been investigated. Finally, the new approach has been implemented for Fisher, reaction–diffusion, Burgers and coupled Burgers equations as test problems to verify the ability and efficiency of the method proposed in this paper.     

A Legendre spectral element method (SEM) based on the modified bases for solving neutral delay distributed‐order fractional damped diffusion‐wave equation

The main purpose of the current paper is to propose a new numerical scheme based on the spectral element procedure for simulating the neutral delay distributed‐order fractional damped diffusion‐wave equation. To this end, the temporal direction has been discretized by a finite difference formula with convergence order where 1<α<2. In the next, to obtain a full‐discrete scheme, we apply the spectral finite element method on the spatial direction. Furthermore, the unconditional stability of semidiscrete scheme and convergence order of full‐discrete scheme of new technique are discussed. Finally, 2 test problems have been considered to demonstrate the ability and efficiency of the proposed numerical technique.     

Rate of convergence of finite difference approximations for degenerate ordinary differential equations

In this paper we study finite difference approximations for the following linear stationary convection-diffusion equations:

where is allowed to be degenerate. We first propose a new weighted finite difference scheme, motivated by approximating the diffusion process associated with the equation in the strong sense. We show that, under certain conditions, this scheme converges with the first order rate and that such a rate is sharp. To the best of our knowledge, this is the first sharp result in the literature. Moreover, by using the connection between our scheme and the standard upwind finite difference scheme, we get the rate of convergence of the latter, which is also new.

     

Convergence analysis of high-order compact alternating direction implicit schemes for the two-dimensional time fractional diffusion equation

High-order compact finite difference method with operator-splitting technique for solving the two dimensional time fractional diffusion equation is considered in this paper. The Caputo derivative is evaluated by the L1 approximation, and the second order derivatives with respect to the space variables are approximated by the compact finite differences to obtain fully discrete implicit schemes. Alternating Direction Implicit (ADI) method is used to split the original problem into two separate one dimensional problems. One scheme is given by replacing the unknowns by the values on the previous level directly and a correction term is added for another scheme. Theoretical analysis for the first scheme is discussed. The local truncation error is analyzed and the stability is proved by the Fourier method. Using the energy method, the convergence of the compact finite difference scheme is proved. Numerical results are provided to verify the accuracy and efficiency of the two proposed algorithms. For the order of the temporal derivative lies in different intervals $\left(0,\frac{1}{2}\right)$ or $\left[\frac{1}{2},1\right)$ , corresponding appropriate scheme is suggested.     

An implicit scheme for singularly perturbed parabolic problem with retarded terms arising in computational neuroscience

A class of time‐dependent singularly perturbed convection‐diffusion problems with retarded terms arising in computational neuroscience is considered. In particular, a numerical scheme for the parabolic convection‐diffusion problem where the second‐order derivative with respect to the spatial direction is multiplied by a small perturbation parameter and the shifts are of is constructed. The Taylor series expansion is used to tackle the shift terms. The continuous problem is semidiscretized using the Crank‐Nicolson finite difference method in the temporal direction and the resulting set of ordinary differential equations is discretized using a midpoint upwind finite difference scheme on an appropriate piecewise uniform mesh, which is dense in the boundary layer region. It is shown that the proposed numerical scheme is second‐order accurate in time and almost first‐order accurate in space with respect to the perturbation parameter . To validate the computational results and efficiency of the method some numerical examples are encountered and the numerical results are compared with some existing results. It is observed that the numerical approximations are fairly good irrespective of the size of the delay and the advance till they are of . The effect of the shifts on the boundary layer has also been observed.     

Higher order numerical approximation for time dependent singularly perturbed differential‐difference convection‐diffusion equations

In this article, we develop a higher order numerical approximation for time dependent singularly perturbed differential‐difference convection‐diffusion equations. A priori bounds on the exact solution and its derivatives, which are useful for the error analysis of the numerical method are given. We approximate the retarded terms of the model problem using Taylor's series expansion and the resulting time‐dependent singularly perturbed problem is discretized by the implicit Euler scheme on uniform mesh in time direction and a special hybrid finite difference scheme on piecewise uniform Shishkin mesh in spatial direction. We first prove that the proposed numerical discretization is uniformly convergent of , where and denote the time step and number of mesh‐intervals in space, respectively. After that we design a Richardson extrapolation scheme to increase the order of convergence in time direction and then the new scheme is proved to be uniformly convergent of . Some numerical tests are performed to illustrate the high‐order accuracy and parameter uniform convergence obtained with the proposed numerical methods.     

Pointwise error estimates for a streamline diffusion scheme on a Shishkin mesh for a convection-diffusion problem

We analyze a streamline diffusion scheme on a special piecewiseunform mesh for a model time-dependent convection–diffusionproblem. The method with piecewise linear elements is shownto be convergent, independently of the diffusion parameter,with a pointwise accuracy of almost order 5/4 outside the boundarylayer and almost order 3/4 inside the boundary layer. Numericalresults are also given. stynes{at}bureau.ucc.ie     

Existence and stability of stationary profiles of the lw scheme

In this paper we study the behavior of difference schemes approximating solutions with shocks of scalar conservation laws When a difference scheme introduces artificial numerical diffusion, for example the Lax-Friedrichs scheme, we experience smearing of the shocks, whereas when a scheme introduces numerical dispersion, for example the Lax-Wendroff scheme, we experience oscillations which decay exponentially fast on both sides of the shock. In his dissertation. Gray Jennings studied approximation by monotone schemes. These contain artificial viscosity and are first-order accurate; they are known to be contractive in the sense of any l^p norm. Jennings showed existence and l¹ stability of traveling discrete smeared shocks for such schemes. Here we study similar questions for the Lax-Wendroff scheme without artificial viscosity; this is a nonmonotone, second-order accurate scheme. We prove existence of a one-parameter family of stationary profiles. We also prove stability of these profiles for small perturbations in the sense of a suitably weighted l² norm. The proof relies on studying the linearized Lax-Wendroff scheme.     

An Estimate of the Convergence Rate for Difference Schemes for the First Boundary-Value Problem in Elasticity Theory for Domains of an Arbitrary Shape

In this article, using the method of dummy domains and operators of exact difference schemes, we construct a difference scheme for the first boundary-value problem in elasticity theory. The scheme, for domains of an arbitrary shape, has the order of accuracy O(h^1/2)with respect to the norm of W ₂ ¹ ().     

A fast numerical method for block lower triangular Toeplitz with dense Toeplitz blocks system with applications to time-space fractional diffusion equations

Based on the circulant-and-skew-circulant representation of Toeplitz matrix inversion and the divide-and-conquer technique, a fast numerical method is developed for solving N-by-N block lower triangular Toeplitz with M-by-M dense Toeplitz blocks system with \(\mathcal {O}(MN\log N(\log N+\log M))\) complexity and \(\mathcal {O}(NM)\) storage. Moreover, the method is employed for solving the linear system that arises from compact finite difference scheme for time-space fractional diffusion equations with significant speedup. Numerical examples are given to show the efficiency of the proposed method.     

A compact ADI scheme for the two dimensional time fractional diffusion‐wave equation in polar coordinates

In this article, we consider finite difference schemes for two dimensional time fractional diffusion‐wave equations on an annular domain. The problem is formulated in polar coordinates and, therefore, has variable coefficients. A compact alternating direction implicit scheme with accuracy order is derived, where τ, h₁, h₂ are the temporal and spatial step sizes, respectively. The stability and convergence of the proposed scheme are studied using its matrix form by the energy method. Numerical experiments are presented to support the theoretical results. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 1692–1712, 2015     

Computer difference scheme for a singularly perturbed elliptic convection–diffusion equation in the presence of perturbations

A grid approximation of a boundary value problem for a singularly perturbed elliptic convection–diffusion equation with a perturbation parameter ε, ε ∈ (0,1], multiplying the highest order derivatives is considered on a rectangle. The stability of a standard difference scheme based on monotone approximations of the problem on a uniform grid is analyzed, and the behavior of discrete solutions in the presence of perturbations is examined. With an increase in the number of grid nodes, this scheme does not converge -uniformly in the maximum norm, but only conditional convergence takes place. When the solution of the difference scheme converges, which occurs if N ₁ ^-1 N ₂ ^-1 ? ε, where N ₁ and N ₂ are the numbers of grid intervals in x and y, respectively, the scheme is not -uniformly well-conditioned or ε-uniformly stable to data perturbations in the grid problem and to computer perturbations. For the standard difference scheme in the presence of data perturbations in the grid problem and/or computer perturbations, conditions imposed on the “parameters” of the difference scheme and of the computer (namely, on ε, N ₁,N ₂, admissible data perturbations in the grid problem, and admissible computer perturbations) are obtained that ensure the convergence of the perturbed solutions as N ₁,N ₂ → ∞, ε ∈ (0,1]. The difference schemes constructed in the presence of the indicated perturbations that converges as N ₁,N ₂ → ∞ for fixed ε, ε ∈ (0,1, is called a computer difference scheme. Schemes converging ε-uniformly and conditionally converging computer schemes are referred to as reliable schemes. Conditions on the data perturbations in the standard difference scheme and on computer perturbations are also obtained under which the convergence rate of the solution to the computer difference scheme has the same order as the solution of the standard difference scheme in the absence of perturbations. Due to this property of its solutions, the computer difference scheme can be effectively used in practical computations.     

Some upwinding techniques for finite element approximations of convection-diffusion equations

Summary A uniform framework for the study of upwinding schemes is developed. The standard finite element Galerkin discretization is chosen as the reference discretization, and differences between other discretization schemes and the reference are written as artificial diffusion terms. These artificial diffusion terms are spanned by a four dimensional space of element diffusion matrices. Three basis matrices are symmetric, rank one diffusion operators associated with the edges of the triangle; the fourth basis matrix is skew symmetric and is associated with a rotation by /2. While finite volume discretizations may be written as upwinded Galerkin methods, the converse does not appear to be true. Our approach is used to examine several upwinding schemes, including the streamline diffusion method, the box method, the Scharfetter-Gummel discretization, and a divergence-free scheme.The work of this author was supported by the Office of Naval Research under contract N00014-89J-1440The work of this author was supported through KWF-Landis/Gyr Grant 1496, AT & T Bell Laboratories, and Cray Research     

The method of Garabedian

Summary In this paper, the method of Garabedian is applied to finite difference equations derived from the elliptic diffusion operator –D + over rectangular and triangular nets. An example is given for which GARABEDIAN'S method yields a useless result.     

A two‐grid method for mixed finite‐element solution of reaction‐diffusion equations

We present a scheme for solving two‐dimensional, nonlinear reaction‐diffusion equations, using a mixed finite‐element method. To linearize the mixed‐method equations, we use a two grid scheme that relegates all the Newton‐like iterations to a grid Δ_H much coarser than the original one Δ_h, with no loss in order of accuracy so long as the mesh sizes obey . The use of a multigrid‐based solver for the indefinite linear systems that arise at each coarse‐grid iteration, as well as for the similar system that arises on the fine grid, allows for even greater efficiency. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 317–332, 1999     

A rate of convergence bound of regular-grid difference schemes for elliptical equations with discontinuous coefficients

Exact difference scheme operators are applied to construct a difference scheme for the second-order elliptical equation. The solution of this difference scheme convergence to the solution of the original problem at a rate O(h) in theW ₂ ¹()- grid norm.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 55, pp. 21–26, 1985.