On the stability of explicit finite difference methods for advection–diffusion equations

In this article we study the stability of explicit finite difference discretization of advection–diffusion equations (ADE) with arbitrary order of accuracy in the context of method of lines. The analysis first focuses on the stability of the system of ordinary differential equations that is obtained by discretizing the ADE in space and then extends to fully discretized methods in combination with explicit Runge–Kutta methods. In particular, we prove that all stable semi-discretization of the ADE leads to a conditionally stable fully discretized method as long as the time-integrator is at least first-order accurate, whereas high-order spatial discretization of the advection equation cannot yield a stable method if the temporal order is too low. In the second half of the article, the analysis and the stability results are extended to a partially dissipative wave system, which serves as a model for common practice in many fluid mechanics applications that incorporate a viscous stress in the momentum equation but no heat dissipation in the energy equation. Finally, the major theoretical predictions are verified by numerical examples.     

A multigrid‐based shifted Laplacian preconditioner for a fourth‐order Helmholtz discretization

In this paper, an iterative solution method for a fourth‐order accurate discretization of the Helmholtz equation is presented. The method is a generalization of that presented in (SIAM J. Sci. Comput. 2006; 27 :1471–1492), where multigrid was employed as a preconditioner for a Krylov subspace iterative method. The multigrid preconditioner is based on the solution of a second Helmholtz operator with a complex‐valued shift. In particular, we compare preconditioners based on a point‐wise Jacobi smoother with those using an ILU(0) smoother, we compare using the prolongation operator developed by de Zeeuw in (J. Comput. Appl. Math. 1990; 33 :1–27) with interpolation operators based on algebraic multigrid principles, and we compare the performance of the Krylov subspace method Bi‐conjugate gradient stabilized with the recently introduced induced dimension reduction method, IDR(s). These three improvements are combined to yield an efficient solver for heterogeneous problems. Copyright © 2009 John Wiley & Sons, Ltd.     

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.     

Comparison between the shifted-Laplacian preconditioning and the controllability methods for computational acoustics

Processes that can be modelled with numerical calculations of acoustic pressure fields include medical and industrial ultrasound, echo sounding, and environmental noise. We present two methods for making these calculations based on Helmholtz equation. The first method is based directly on the complex-valued Helmholtz equation and an algebraic multigrid approximation of the discretized shifted-Laplacian operator; i.e. the damped Helmholtz operator as a preconditioner. The second approach returns to a transient wave equation, and finds the time-periodic solution using a controllability technique. We concentrate on acoustic problems, but our methods can be used for other types of Helmholtz problems as well. Numerical experiments show that the control method takes more CPU time, whereas the shifted-Laplacian method has larger memory requirement.     

Improved upwind discretization of the advection equation

The simplest upwind discretization of the advection equation is only first‐order accurate in time and space and very diffusive. In this article, the first‐order upwind method is improved by changing its basis functions. The resulting scheme, called exponentially fitted, proves to be more accurate in both space and time. In addition, it inherits some qualitative behaviors of the advection equation. The proposed approach is able to be generalized for more complicated problems provided that appropriate relations between the fitting parameters of the method are imposed. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 773–787, 2014     

A note on finite difference discretizations for Poisson equation on a disk

A simple second‐order finite difference treatment of polar coordinate singularity for Poisson equation on a disk is presented. By manipulating the grid point locations, we can successfully avoid finding numerical boundary condition at the origin so that the resulting matrix is simpler than traditional schemes. The treatments for Dirichlet and Neumann boundary problems are slightly different by adjusting the radial mesh width. Furthermore, the present discretization can be applied with slight modifications to Helmholtz‐type equations. The numerical evidence shows that the second‐order accuracy can also be preserved. © 2001 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 17: 199–203, 2001     

Nonstandard finite difference schemes for Michaelis–Menten type reaction‐diffusion equations

We compare and investigate the performance of the exact scheme of the Michaelis–Menten (M–M) ordinary differential equation with several new nonstandard finite difference (NSFD) schemes that we construct using Mickens' rules. Furthermore, the exact scheme of the M–M equation is used to design several dynamically consistent NSFD schemes for related reaction‐diffusion equations, advection‐reaction equations, and advection‐reaction‐diffusion equations. Numerical simulations that support the theory and demonstrate computationally the power of NSFD schemes are presented. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

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.     

On the Numerical Solution to a Nonlinear Wave Equation Associated with the First Painlev′e Equation: an Operator-Splitting Approach

The main goal of this article is to discuss the numerical solution to a nonlinear wave equation associated with the first of the celebrated Painlevé transcendent ordinary differential equations. In order to solve numerically the above equation, whose solutions blow up in finite time, the authors advocate a numerical methodology based on the Strang’s symmetrized operator-splitting scheme. With this approach, one can decouple nonlinearity and differential operators, leading to the alternate solution at every time step of the equation as follows: (i) The first Painlevé ordinary differential equation, (ii) a linear wave equation with a constant coefficient. Assuming that the space dimension is two, the authors consider a fully discrete variant of the above scheme, where the space-time discretization of the linear wave equation sub-steps is achieved via a Galerkin/finite element space approximation combined with a second order accurate centered time discretization scheme. To handle the nonlinear sub-steps, a second order accurate centered explicit time discretization scheme with adaptively variable time step is used, in order to follow accurately the fast dynamic of the solution before it blows up. The results of numerical experiments are presented for different coefficients and boundary conditions. They show that the above methodology is robust and describes fairly accurately the evolution of a rather “violent” phenomenon.     

Understanding Saul'yev‐type unconditionally stable schemes from exponential splitting

Saul'yev‐type asymmetric schemes have been widely used in solving diffusion and advection equations. In this work, we show that Saul'yev‐type schemes can be derived from the exponential splitting of the semidiscretized equation which fundamentally explains their unconditional stability. Furthermore, we show that optimal schemes are obtained by forcing each scheme's amplification factor to match that of the exact amplification factor. A new second‐order explicit scheme is found for solving the advection equation with the identical amplification factor as the implicit Crank–Nicolson algorithm. Other new schemes for solving the advection–diffusion equation are also derived.© 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 1961–1983, 2014     

An expansion theorem for two‐dimensional elastic waves and its application

We prove an Atkinson–Wilcox‐type expansion for two‐dimensional elastic waves in this paper. The approach developed on the two‐dimensional Helmholtz equation will be applied in the proof. When the elastic fields are involved, the situation becomes much harder due to two wave solutions propagating at different phase velocities. In the last section, we give an application about the reconstruction of an obstacle from the scattering amplitude. Copyright © 2006 John Wiley & Sons, Ltd.     

Development of a numerical phase optimized upwinding combined compact difference scheme for solving the Camassa–Holm equation with different initial solitary waves

In this article, the solution of Camassa–Holm (CH) equation is solved by the proposed two‐step method. In the first step, the sixth‐order spatially accurate upwinding combined compact difference scheme with minimized phase error is developed in a stencil of four points to approximate the first‐order derivative term. For the purpose of retaining both of the long‐term accurate Hamiltonian property and the geometric structure inherited in the CH equation, the time integrator used in this study should be able to conserve symplecticity. In the second step, the Helmholtz equation governing the pressure‐like variable is approximated by the sixth‐order accurate three‐point centered compact difference scheme. Through the fundamental and numerical verification studies, the integrity of the proposed high‐order scheme is demonstrated. Another aim of this study is to reveal the wave propagation nature for the investigated shallow water equation subject to different initial wave profiles, whose peaks take the smooth, peakon, and cuspon forms. The transport phenomena for the cases with/without inclusion of the linear first‐order advection term κu_x in the CH equation will be addressed. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 1645–1664, 2015     

Collocation discretization for an integral equation in ocean acoustics with depth‐dependent speed of sound

We analyze two collocation schemes for the Helmholtz equation with depth‐dependent sonic wave velocity, modeling time‐harmonic acoustic wave propagation in a three‐dimensional inhomogeneous ocean of finite height. Both discretization schemes are derived from a periodized version of the Lippmann‐Schwinger integral equation that equivalently describes the sound wave. The eigenfunctions of the corresponding periodized integral operator consist of trigonometric polynomials in the horizontal variables and eigenfunctions to some Sturm‐Liouville operator linked to the background profile of the sonic wave velocity in the vertical variable. Applying an interpolation projection onto a space spanned by finitely many of these eigenfunctions to either the unknown periodized wave field or the integral operator yields two different collocation schemes. A convergence estimate of Sloan [J. Approx. Theory, 39:97–117, 1983] on non‐polynomial interpolation allows to show converge of both schemes, together with algebraic convergence rates depending on the smoothness of the inhomogeneity and the source. Copyright © 2016 John Wiley & Sons, Ltd.     

Analytical approximate solutions of Riesz fractional diffusion equation and Riesz fractional advection–dispersion equation involving nonlocal space fractional derivatives

In this paper, we consider the analytical solutions of fractional partial differential equations (PDEs) with Riesz space fractional derivatives on a finite domain. Here we considered two types of fractional PDEs with Riesz space fractional derivatives such as Riesz fractional diffusion equation (RFDE) and Riesz fractional advection–dispersion equation (RFADE). The RFDE is obtained from the standard diffusion equation by replacing the second‐order space derivative with the Riesz fractional derivative of order α∈(1,2]. The RFADE is obtained from the standard advection–dispersion equation by replacing the first‐order and second‐order space derivatives with the Riesz fractional derivatives of order β∈(0,1] and of order α∈(1,2] respectively. Here the analytic solutions of both the RFDE and RFADE are derived by using modified homotopy analysis method with Fourier transform. Then, we analyze the results by numerical simulations, which demonstrate the simplicity and effectiveness of the present method. Here the space fractional derivatives are defined as Riesz fractional derivatives. Copyright © 2015 John Wiley & Sons, Ltd.     

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 numerical solution for advection‐diffusion equation using dual reciprocity method

This article describes a numerical method based on the boundary integral equation and dual reciprocity method(DRM) for solving the one‐dimensional advection‐diffusion equations. The concept of DRM is used to convert the domain integral to the boundary that leads to an integration free method. The time derivative is approximated by the time‐stepping method. Numerical results are presented for some problems to demonstrate the usefulness and accuracy of the new approach. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

Use of Shifted Laplacian Operators for Solving Indefinite Helmholtz Equations

A shifted Laplacian operator is obtained from the Helmholtz operator by adding a complex damping. It serves as a basic tool in the most successful multigrid approach for solving highly indefinite Helmholtz equations — a Shifted Laplacian preconditioner for Krylov-type methods. Such preconditioning significantly accelerates Krylov iterations, much more so than the multigrid based on original Helmholtz equations. In this paper, we compare approximation and relaxation properties of the Helmholtz operator with and without the complex shift, and, based on our observations, propose a new hybrid approach that combines the two. Our analytical conclusions are supported by two-dimensional numerical results.     

Gauss‐Lobatto‐Legendre‐Birkhoff pseudospectral approximations for the multi‐term time fractional diffusion‐wave equation with Neumann boundaryconditions

A second‐order finite difference/pseudospectral scheme is proposed for numerical approximation of multi‐term time fractional diffusion‐wave equation with Neumann boundary conditions. The scheme is based upon the weighted and shifted Grünwald difference operators approximation of the time fractional calculus and Gauss‐Lobatto‐Legendre‐Birkhoff (GLLB) pseudospectral method for spatial discretization. The unconditionally stability and convergence of the scheme are rigorously proved. Numerical examples are carried out to verify theoretical results.     

Algorithm Research Based on the PDE Sensitivity Filter北大核心CSCD

采用PDE灵敏度滤波器可以消除连续体结构拓扑优化结果存在的棋盘格现象、数值不稳定等问题,且PDE灵敏度滤波器的实质是具有Neumann边界条件的Helmholtz偏微分方程.针对大规模PDE灵敏度滤波器的求解问题,有限元分析得到其代数方程,分别采用共轭梯度算法、多重网格算法和多重网格预处理共轭梯度算法对代数方程进行求解,并且研究精度、过滤半径以及网格数量对拓扑优化效率的影响.结果表明：与共轭梯度算法和多重网格算法相比,多重网格预处理共轭梯度算法迭代次数最少,运行时间最短,极大地提高了拓扑优化效率.     

A note on an accelerated high‐accuracy multigrid solution of the convection‐diffusion equation with high Reynolds number

We present a new strategy to accelerate the convergence rate of a high‐accuracy multigrid method for the numerical solution of the convection‐diffusion equation at the high Reynolds number limit. We propose a scaled residual injection operator with a scaling factor proportional to the magnitude of the convection coefficients, an alternating line Gauss‐Seidel relaxation, and a minimal residual smoothing acceleration technique for the multigrid solution method. The new implementation strategy is tested to show an improved convergence rate with three problems, including one with a stagnation point in the computational domain. The effect of residual scaling and the algebraic properties of the coefficient matrix arising from the fourth‐order compact discretization are investigated numerically. © 2000 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 16: 1–10, 2000