Fourth‐order compact scheme for the one‐dimensional sine‐Gordon equation

Finite difference scheme to the generalized one‐dimensional sine‐Gordon equation is considered in this paper. After approximating the second order derivative in the space variable by the compact finite difference, we transform the sine‐Gordon equation into an initial‐value problem of a second‐order ordinary differential equation. Then Padé approximant is used to approximate the time derivatives. The resulting fully discrete nonlinear finite‐difference equation is solved by a predictor‐corrector scheme. Both Dirichlet and Neumann boundary conditions are considered in our proposed algorithm. Stability analysis and error estimate are given for homogeneous Dirichlet boundary value problems using energy method. Numerical results are given to verify the condition for stability and convergence and to examine the accuracy and efficiency of the proposed algorithm. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

Block‐centered upwind multistep difference method and convergence analysis for numerical simulation of oil reservoir

The three‐dimensional displacement of two‐phase flow in porous media is a preliminary problem of numerical simulation of energy science and mathematics. The mathematical model is formulated by a nonlinear system of partial differential equations to describe incompressible miscible case. The pressure is defined by an elliptic equation, and the concentration is defined by a convection‐dominated diffusion equation. The pressure generates Darcy velocity and controls the dynamic change of concentration. We adopt a conservative block‐centered scheme to approximate the pressure and Darcy velocity, and the accuracy of Darcy velocity is improved one order. We use a block‐centered upwind multistep method to solve the concentration, where the time derivative is approximated by multistep method, and the diffusion term and convection term are treated by a block‐centered scheme and an upwind scheme, respectively. The composite algorithm is effective to solve such a convection‐dominated problem, since numerical oscillation and dispersion are avoided and computational accuracy is improved. Block‐centered method is conservative, and the concentration and the adjoint function are computed simultaneously. This physical nature is important in numerical simulation of seepage fluid. Using the convergence theory and techniques of priori estimates, we derive optimal estimate error. Numerical experiments and data show the support and consistency of theoretical result. The argument in the present paper shows a powerful tool to solve the well‐known model problem.     

The method of mixed volume element‐characteristic mixed volume element and its numerical analysis for three‐dimensional slightly compressible two‐phase displacement

Numerical simulation of oil‐water two‐phase displacement is a fundamental problem in energy mathematics. The mathematical model for the compressible case is defined by a nonlinear system of two partial differential equations: (1) a parabolic equation for pressure and (2) a convection‐diffusion equation for saturation. The pressure appears within the saturation equation, and the Darcy velocity controls the saturation. The flow equation is solved by the conservative mixed volume element method. The order of the accuracy is improved by the Darcy velocity. The conservative mixed volume element with characteristics is applied to compute the saturation, that is, the diffusion is discretized by the mixed volume element and convection is computed by the method of characteristics. The method of characteristics has strong computational stability at sharp fronts and avoids numerical dispersion and nonphysical oscillation. Small time truncation error and accuracy are obtained through this method. The mixed volume element simulates diffusion, saturation, and the adjoint vector function simultaneously. By using the theory and technique of a priori estimates of differential equations, convergence of the optimal second order in norm is obtained. Numerical examples are provided to show the effectiveness and viability of this method. This method provides a powerful tool for solving challenging benchmark problems.     

Implicit‐explicit multistep finite element methods for nonlinear convection‐diffusion problems

Implicit‐explicit multistep finite element methods for nonlinear convection‐diffusion equations are presented and analyzed. In space we discretize by finite element methods. The discretization in time is based on linear multistep schemes. The linear part of the equation is discretized implicitly and the nonlinear part of the equation explicitly. The schemes are stable and very efficient. We derive optimal order error estimates. © 2001 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 17:93–104, 2001     

A high‐order Godunov method for one‐dimensional convection‐diffusion‐reaction problems

In this article we develop a high‐order Godunov method for one‐dimensional convection‐diffusion‐reaction problems where convection dominates diffusion. The heart of this method comes from incorporating the diffusion term via the slope of the linear representation (recovery) of the solution on each grid cell. The method is conservative and explicit. Therefore, it is efficient in computing time. For constant coefficient linear convection, diffusion, and Lipschitz‐type reaction, the properties of the total variation stability and monotonicity preservation are proved. An error estimation is derived. Computational examples are presented and compared with the exact solutions. © 2000 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 16: 495–512, 2000     

A second‐order partitioned method with different subdomain time steps for the evolutionary Stokes‐Darcy system

A second‐order decoupled algorithm for the nonstationary Stokes‐Darcy system, which allows different time steps in two subregions, is proposed and analyzed in this paper. The algorithm, which is a combination of the second‐order backward differentiation formula and second‐order extrapolation method, uncouples the problem into two decoupled problems per time step. We prove the unconditional stability and long‐time stability of the decoupled scheme with different time steps and derive error estimates of this decoupled algorithm using finite element spatial discretization. Numerical experiments are provided to illustrate the accuracy, effectiveness, and stability of the decoupled algorithm and show its advantages of increasing accuracy and efficiency.     

High‐order characteristic‐tracking strategy for simulation of a nonlinear advection–diffusion equation

In this study, new high‐order backward semi‐Lagrangian methods are developed to solve nonlinear advection–diffusion type problems, which are realized using high‐order characteristic‐tracking strategies. The proposed characteristic‐tracking strategies are second‐order L‐stable and third‐order L(α)‐stable methods, which are based on a classical implicit multistep method combined with a error‐correction method. We also use backward differentiation formulas and the fourth‐order finite‐difference scheme for diffusion problem discretization in the temporal and spatial domains, respectively. To demonstrate the adaptability and efficiency of these time‐discretization strategies, we apply these methods to nonlinear advection–diffusion type problems such as the viscous Burgers' equation. Through simulations, not only the temporal and spatial accuracies are numerically evaluated but also the proposed methods are shown to be superior to the compared existing characteristic‐tracking methods under the same rates of convergence in terms of accuracy and efficiency. Finally, we have shown that the proposed method well preserves the energy and mass when the viscosity coefficient becomes zero.     

A high‐order compact ADI method for solving three‐dimensional unsteady convection‐diffusion problems

We derive a high‐order compact alternating direction implicit (ADI) method for solving three‐dimentional unsteady convection‐diffusion problems. The method is fourth‐order in space and second‐order in time. It permits multiple uses of the one‐dimensional tridiagonal algorithm with a considerable saving in computing time and results in a very efficient solver. It is shown through a discrete Fourier analysis that the method is unconditionally stable in the diffusion case. Numerical experiments are conducted to test its high order and to compare it with the standard second‐order Douglas‐Gunn ADI method and the spatial fourth‐order compact scheme by Karaa. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

Entropy dissipative one‐leg multistep time approximations of nonlinear diffusive equations

New one‐leg multistep time discretizations of nonlinear evolution equations are investigated. The main features of the scheme are the preservation of the non‐negativity and the entropy dissipation structure of the diffusive equations. The key ideas are to combine Dahlquist's G‐stability theory with entropy dissipation methods and to introduce a nonlinear transformation of variables, which provides a quadratic structure in the equations. It is shown that G‐stability of the one‐leg scheme is sufficient to derive discrete entropy dissipation estimates. The general result is applied to a cross‐diffusion system from population dynamics and a nonlinear fourth‐order quantum diffusion model, for which the existence of semidiscrete weak solutions is proved. Under some assumptions on the operator of the evolution equation, the second‐order convergence of solutions is shown. Moreover, some numerical experiments for the population model are presented, which underline the theoretical results. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 1119–1149, 2015     

Reconstructing unknown nonlinear boundary conditions in a time‐fractional inverse reaction–diffusion–convection problem

This paper has focused on unknown functions identification in nonlinear boundary conditions of an inverse problem of a time‐fractional reaction–diffusion–convection equation. This inverse problem is generally ill‐posed in the sense of stability, that is, the solution of problem does not depend continuously on the input data. Thus, a combination of the mollification regularization method with Gauss kernel and a finite difference marching scheme will be introduced to solve this problem. The generalized cross‐validation choice rule is applied to find a suitable regularization parameter. The stability and convergence of the numerical method are investigated. Finally, two numerical examples are provided to test the effectiveness and validity of the proposed approach.     

An exponential high‐order compact ADI method for 3D unsteady convection–diffusion problems

In this article, we develop an exponential high order compact alternating direction implicit (EHOC ADI) method for solving three dimensional (3D) unsteady convection–diffusion equations. The method, which requires only a regular seven‐point 3D stencil similar to that in the standard second‐order methods, is second order accurate in time and fourth‐order accurate in space and unconditionally stable. The resulting EHOC ADI scheme in each alternating direction implicit (ADI) solution step corresponding to a strictly diagonally dominant matrix equation can be solved by the application of the one‐dimensional tridiagonal Thomas algorithm with a considerable saving in computing time. Numerical experiments for three test problems are carried out to demonstrate the performance of the present method and to compare it with the classical Douglas–Gunn ADI method and the Karaa's high‐order compact ADI method. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2013     

Convergence and error bound analysis for the space‐time CESE method

In this work, we study the convergence behavior of a recently developed space‐time conservation element and solution element method for solving conservation laws. In particular, we apply the method to a one‐dimensional time‐dependent convection‐diffusion equation possibly with high Peclet number. We prove that the scheme converges and we obtain an error bound. This method performs well even for strong convection dominance over diffusion with good long‐time accuracy. Numerical simulations are performed to verify the results. © 2001 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 17: 64–78, 2001     

An adaptive refinement method for convection‐diffusion problems

An adaptive finite difference method for singularly perturbed convection‐diffusion problems is presented. The method is introduced using a first‐order upwind scheme and a suitable error estimator based on the first derivatives. To obtain the grid structure needed for the cross stencil a special refinement strategy is considered. To avoid the slave points we change the stencil at the interface points from a cross to a skew one. After the convergence of the refinement algorithm we use a combination of a first order upwind and a second order central schemes to achieve higher order of convergence. Several numerical examples show the efficiency of our treatment. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Space‐time spectral collocation method for the one‐dimensional sine‐Gordon equation

In this article, we introduce a new space‐time spectral collocation method for solving the one‐dimensional sine‐Gordon equation. We apply a spectral collocation method for discretizing spatial derivatives, and then use the spectral collocation method for the time integration of the resulting nonlinear second‐order system of ordinary differential equations (ODE). Our formulation has high‐order accurate in both space and time. Optimal a priori error bounds are derived in the L²‐norm for the semidiscrete formulation. Numerical experiments show that our formulation have exponential rates of convergence in both space and time. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 670–690, 2015     

Integrable Discrete Model for One‐Dimensional Soil Water Infiltration

We propose an integrable discrete model of one‐dimensional soil water infiltration. This model is based on the continuum model by Broadbridge and White, which takes the form of nonlinear convection–diffusion equation with a nonlinear flux boundary condition at the surface. It is transformed to the Burgers equation with a time‐dependent flux term by the hodograph transformation. We construct a discrete model preserving the underlying integrability, which is formulated as the self‐adaptive moving mesh scheme. The discretization is based on linearizability of the Burgers equation to the linear diffusion equation, but the naïve discretization based on the Euler scheme which is often used in the theory of discrete integrable systems does not necessarily give a good numerical scheme. Taking desirable properties of a numerical scheme into account, we propose an alternative discrete model that produces solutions with similar accuracy to direct computation on the original nonlinear equation, but with clear benefits regarding computational cost.     

Nonintrusive reduced‐order modeling of parametrized time‐dependent partial differential equations

We propose a nonintrusive reduced‐order modeling method based on the notion of space‐time‐parameter proper orthogonal decomposition (POD) for approximating the solution of nonlinear parametrized time‐dependent partial differential equations. A two‐level POD method is introduced for constructing spatial and temporal basis functions with special properties such that the reduced‐order model satisfies the boundary and initial conditions by construction. A radial basis function approximation method is used to estimate the undetermined coefficients in the reduced‐order model without resorting to Galerkin projection. This nonintrusive approach enables the application of our approach to general problems with complicated nonlinearity terms. Numerical studies are presented for the parametrized Burgers' equation and a parametrized convection‐reaction‐diffusion problem. We demonstrate that our approach leads to reduced‐order models that accurately capture the behavior of the field variables as a function of the spatial coordinates, the parameter vector and time. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2013     

Analysis of algebraic systems arising from fourth‐order compact discretizations of convection‐diffusion equations

We study the properties of coefficient matrices arising from high‐order compact discretizations of convection‐diffusion problems. Asymptotic convergence factors of the convex hull of the spectrum and the field of values of the coefficient matrix for a one‐dimensional problem are derived, and the convergence factor of the convex hull of the spectrum is shown to be inadequate for predicting the convergence rate of GMRES. For a two‐dimensional constant‐coefficient problem, we derive the eigenvalues of the nine‐point matrix, and we show that the matrix is positive definite for all values of the cell‐Reynolds number. Using a recent technique for deriving analytic expressions for discrete solutions produced by the fourth‐order scheme, we show by analyzing the terms in the discrete solutions that they are oscillation‐free for all values of the cell Reynolds number. Our theoretical results support observations made through numerical experiments by other researchers on the non‐oscillatory nature of the discrete solution produced by fourth‐order compact approximations to the convection‐diffusion equation. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 155–178, 2002; DOI 10.1002/num.1041     

Fractional Crank–Nicolson–Galerkin finite element scheme for the time‐fractional nonlinear diffusion equation

This article presents a finite element scheme with Newton's method for solving the time‐fractional nonlinear diffusion equation. For time discretization, we use the fractional Crank–Nicolson scheme based on backward Euler convolution quadrature. We discuss the existence‐uniqueness results for the fully discrete problem. A new discrete fractional Gronwall type inequality for the backward Euler convolution quadrature is established. A priori error estimate for the fully discrete problem in L²(Ω) norm is derived. Numerical results based on finite element scheme are provided to validate theoretical estimates on time‐fractional nonlinear Fisher equation and Huxley equation.     

Stability of a combined finite element ‐ finite volume discretization of convection‐diffusion equations

We consider a time‐dependent and a stationary convection‐diffusion equation. These equations are approximated by a combined finite element – finite volume method: the diffusion term is discretized by Crouzeix‐Raviart piecewise linear finite elements on a triangular grid, and the convection term by upwind barycentric finite volumes. In the nonstationary case, we use an implicit Euler approach for time discretization. This scheme is shown to be L²‐stable uniformly with respect to the diffusion coefficient. In addition, it turns out that stability is unconditional in the time‐dependent case. These results hold if the underlying grid satisfies a condition that is fulfilled, for example, by some structured meshes. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 28: 402–424, 2012     

A multigrid compact finite difference method for solving the one‐dimensional nonlinear sine‐Gordon equation

The aim of this paper is to propose a multigrid method to obtain the numerical solution of the one‐dimensional nonlinear sine‐Gordon equation. The finite difference equations at all interior grid points form a large sparse linear system, which needs to be solved efficiently. The solution cost of this sparse linear system usually dominates the total cost of solving the discretized partial differential equation. The proposed method is based on applying a compact finite difference scheme of fourth‐order for discretizing the spatial derivative and the standard second‐order central finite difference method for the time derivative. The proposed method uses the Richardson extrapolation method in time variable. The obtained system has been solved by V‐cycle multigrid (VMG) method, where the VMG method is used for solving the large sparse linear systems. The numerical examples show the efficiency of this algorithm for solving the one‐dimensional sine‐Gordon equation. Copyright © 2014 John Wiley & Sons, Ltd.