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     

Minimum time‐step criteria for the Galerkin finite element methods applied to one‐dimensional parabolic partial differential equations

The finite element method has been well established for numerically solving parabolic partial differential equations (PDEs). Also it is well known that a too large time step should not be chosen in order to obtain a stable and accurate numerical solution. In this article, accuracy analysis shows that a too small time step should not be chosen either for some time‐stepping schemes. Otherwise, the accuracy of the numerical solution cannot be improved or can even be worsened in some cases. Furthermore, the so‐called minimum time step criteria are established for the Crank‐Nicolson scheme, the Galerkin‐time scheme, and the backward‐difference scheme used in the temporal discretization. For the forward‐difference scheme, no minimum time step exists as far as the accuracy is concerned. In the accuracy analysis, no specific initial and boundary conditions are invoked so that such established criteria can be applied to the parabolic PDEs subject to any initial and boundary conditions. These minimum time step criteria are verified in a series of numerical experiments for a one‐dimensional transient field problem with a known analytical solution. The minimum time step criteria developed in this study are useful for choosing appropriate time steps in numerical simulations of practical engineering problems. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

Wavelet Galerkin schemes for higher order time dependent partial differential equations

Fourth‐order derivatives appearing in different linear and nonlinear transient higher order multidimensional equations modeling several physical problems have always posed computational challenges to widely prevailing numerical approaches such as FDM, FEM, and so forth. In this study, we address the issue effectively using the special features of Daubechies wavelets such as orthogonality, compact support, arbitrary regularity, high‐order vanishing moments, and good localization. An efficient compression strategy is proposed to reduce the computational cost significantly. Implicitly stable backward Euler scheme is used for time marching the evolving solution. A priori error estimates have been derived to prove the convergence of the numerical scheme. The proposed approach is successfully tested on few linear and nonlinear multidimensional PDEs.     

A compact difference scheme combined with extrapolation techniques for solving a class of neutral delay parabolic differential equations

In this work, we present an implicit compact difference scheme for solving a class of neutral delay parabolic differential equations (NDPDEs). The unique solvability and unconditional stability of the scheme are proved. The temporal accuracy of the scheme is improved by using different Richardson extrapolation techniques for linear and nonlinear problems, and fourth-order accuracy in both temporal and spatial dimensions is obtained. Finally, numerical experiments are conducted to verify the accuracy and efficiency of the algorithms.     

三维泊松方程基于Richardson外推法的高阶紧致差分方法

基于Richardson外推法提出了数值求解三维泊松方程的高阶紧致差分方法.方法通过利用四阶和六阶紧致差分格式,分别在细网格和粗网格上求解,然后利用Richardson外推技术和算子插值方法,得到三维泊松方程在细网格上的六阶和八阶精度的数值解.数值实验结果验证了该方法的精确性和有效性.     

Convergence and stability estimates in difference setting for time-fractional parabolic equations with functional delay

A class of one-dimensional time-fractional parabolic differential equations with delay effects of functional type in the time component is numerically investigated in this work. To that end, a compact difference scheme is constructed for the numerical solution of those equations based on the idea of separating the current state and the prehistory function. In these terms, the prehistory function is approximated by means of an appropriate interpolation–extrapolation operator. A discrete form of the fractional Gronwall inequality is employed to provide an optimal error estimate. The existence and uniqueness of the numerical solutions, the order of approximation error for the constructed scheme, the stability and the order of convergence are mathematically investigated in this work.     

A high‐order finite difference discretization strategy based on extrapolation for convection diffusion equations

We propose a new high‐order finite difference discretization strategy, which is based on the Richardson extrapolation technique and an operator interpolation scheme, to solve convection diffusion equations. For a particular implementation, we solve a fine grid equation and a coarse grid equation by using a fourth‐order compact difference scheme. Then we combine the two approximate solutions and use the Richardson extrapolation to compute a sixth‐order accuracy coarse grid solution. A sixth‐order accuracy fine grid solution is obtained by interpolating the sixth‐order coarse grid solution using an operator interpolation scheme. Numerical results are presented to demonstrate the accuracy and efficacy of the proposed finite difference discretization strategy, compared to the sixth‐order combined compact difference (CCD) scheme, and the standard fourth‐order compact difference (FOC) scheme. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 18–32, 2004.     

A higher order difference method for singularly perturbed parabolic partial differential equations

This paper studies a higher order numerical method for the singularly perturbed parabolic convection-diffusion problems where the diffusion term is multiplied by a small perturbation parameter. In general, the solutions of these type of problems have a boundary layer. Here, we generate a spatial adaptive mesh based on the equidistribution of a positive monitor function. Implicit Euler method is used to discretize the time variable and an upwind scheme is considered in space direction. A higher order convergent solution with respect to space and time is obtained using the postprocessing based extrapolation approach. It is observed that the convergence is independent of perturbation parameter. This technique enhances the order of accuracy from first order uniform convergence to second order uniform convergence in space as well as in time. Comparative study with the existed meshes show the highly effective behavior of the present method.     

A high‐order ADI finite difference scheme for a 3D reaction‐diffusion equation with neumann boundary condition

In this article, we extend the fourth‐order compact boundary scheme in Liao et al. (Numer Methods Partial Differential Equations 18 (2002), 340–354) to a 3D problem and then combine it with the fourth‐order compact alternating direction implicit (ADI) method in Gu et al. (J Comput Appl Math 155 (2003), 1–17) to solve the 3D reaction‐diffusion equation with Neumann boundary condition. First, the reaction‐diffusion equation is solved with a compact fourth‐order finite difference method based on the Padé approximation, which is then combined with the ADI method and a fourth‐order compact scheme to approximate the Neumann boundary condition, to obtain fourth order accuracy in space. The accuracy in the temporal dimension is improved to fourth order by applying the Richardson extrapolation technique, although the unconditional stability of the numerical method is proved, and several numerical examples are presented to demonstrate the accuracy and efficiency of the proposed new algorithm. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

Lattice Boltzmann methods for solving partial differential equations of exotic option pricing

This paper establishes a lattice Boltzmann method (LBM) with two amending functions for solving partial differential equations (PDEs) arising in Asian and lookback options pricing. The time evolution of stock prices can be regarded as the movement of randomizing particles in different directions, and the discrete scheme of LBM can be interpreted as the binomial models. With the Chapman-Enskog multi-scale expansion, the PDEs are recovered correctly from the continuous Boltzmann equation and the computational complexity is O(N), where N is the number of space nodes. Compared to the traditional LBM, the coefficients of equilibrium distribution and amending functions are taken as polynomials instead of constants. The stability of LBM is studied via numerical examples and numerical comparisons show that the LBM is as accurate as the existing numerical methods for pricing the exotic options and takes much less CPU time.     

New higher-order compact finite difference schemes for 1D heat conduction equations

In this paper, we present two higher-order compact finite difference schemes for solving one-dimensional (1D) heat conduction equations with Dirichlet and Neumann boundary conditions, respectively. In particular, we delicately adjust the location of the interior grid point that is next to the boundary so that the Dirichlet or Neumann boundary condition can be applied directly without discretization, and at the same time, the fifth or sixth-order compact finite difference approximations at the grid point can be obtained. On the other hand, an eighth-order compact finite difference approximation is employed for the spatial derivative at other interior grid points. Combined with the Crank–Nicholson finite difference method and Richardson extrapolation, the overall scheme can be unconditionally stable and provides much more accurate numerical solutions. Numerical errors and convergence rates of these two schemes are tested by two examples.     

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.     

Analysis on two approaches for high order accuracy finite difference computation

We analyze two approaches for enhancing the accuracy of the standard second order finite difference schemes in solving one dimensional elliptic partial differential equations. These are the fourth order compact difference scheme and the fourth order scheme based on the Richardson extrapolation techniques. We study the truncation errors of these approaches and comment on their regularity requirements and computational costs. We present numerical experiments to demonstrate the validity of our analysis.     

基于PDE和几何曲率流驱动扩散的图像分析与处理

本文介绍由变分优化模型导出的偏微分方程(PDEs)模型与几何曲率流驱动扩散在图像恢复方面的应用，以及多种非线性异质扩散模型，讨论了PDEs模型在图像分析与处理方面的优点，理论与实验结果表明，要恢复得到商质量的图像，PDEs模型的利用是极为必要的．文中还介绍了求解PDEs模型的数值方案．其中，曲率计算是一个关键问题，其结果直接参与自适应扩散的控制．详细总结了基于有限差分和水平集方法，求解藕合非线性异质扩散模型方程的数值方案，追求高质量图像、高精度计算方法、降低计算复杂性是本文处理方法不断进步的发展动力。     

Smoothing of Crank-Nicolson scheme for the two-dimensional diffusion with an integral condition

The Parabolic partial differential equations (PDEs) with nonlocal boundary conditions model various physical phenomena, e.g. chemical diffusion, thermoelasticity, heat conduction process, control theory and medicine science. This paper deals with the smoothing of the Crank-Nicolson numerical scheme for two-dimensional parabolic PDEs with nonlocal boundary conditions. We use the numerical scheme based on Padé approximations of the matrix exponential. The graphs of numerical results demonstrate the successful smoothing of the Crank-Nicolson numerical scheme.     

二维线性双曲型方程Neumann边值问题的紧交替方向隐格式

对二维Neumann边界条件的线性双曲型方程建立了紧交替方向的隐格式.利用方程和边界条件得到在空间上的三阶与五阶导数的边界值,进而在内点、边界内点和边界角点分别建立9点、6点和4点紧差分格式;通过引进新的范数和L₂范数估计L_∞范数;借助能量估计、Gronwall不等式和Schwarz不等式等技巧,详细分析了差分格式在无穷范数下关于时间和空间分别为二阶和四阶收敛性,并给出了稳定性结果;通过数值算例,验证了理论分析结果.     

A meshless method for Burgers’ equation using MQ-RBF and high-order temporal approximation

In this paper, a new numerical method is proposed to solve one-dimensional Burgers’ equation using multiquadric (MQ) radial basis function (RBF) for spatial approximation and a second-order compact finite difference scheme for temporal approximation. The numerical results obtained by this way for different Reynolds number have been compared with the existing numerical schemes to show the accuracy and efficiency of the approach. To show the superiority of this meshless method, numerical experiments with non-uniform MQ interpolation node distribution are also performed.     

Practical finite‐analytic method for solving differential equations by compact numerical schemes

Methodology for development of compact numerical schemes by the practical finite‐analytic method (PFAM) is presented for spatial and/or temporal solution of differential equations. The advantage and accuracy of this approach over the conventional numerical methods are demonstrated. In contrast to the tedious discretization schemes resulting from the original finite‐analytic solution methods, such as based on the separation of variables and Laplace transformation, the practical finite‐analytical method is proven to yield simple and convenient discretization schemes. This is accomplished by a special universal determinant construction procedure using the general multi‐variate power series solutions obtained directly from differential equations. This method allows for direct incorporation of the boundary conditions into the numerical discretization scheme in a consistent manner without requiring the use of artificial fixing methods and fictitious points, and yields effective numerical schemes which are operationally similar to the finite‐difference schemes. Consequently, the methods developed for numerical solution of the algebraic equations resulting from the finite‐difference schemes can be readily facilitated. Several applications are presented demonstrating the effect of the computational molecule, grid spacing, and boundary condition treatment on the numerical accuracy. The quality of the numerical solutions generated by the PFAM is shown to approach to the exact analytical solution at optimum grid spacing. It is concluded that the PFAM offers great potential for development of robust numerical schemes. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

Cascadic multigrid methods combined with sixth order compact scheme for poisson equation

Based on the extrapolation theory and a sixth order compact difference scheme, new extrapolation interpolation operator and extrapolation cascadic multigrid methods for two dimensional Poisson equation are presented. The new extrapolation interpolation operator is used to provide a better initial value on refined grid. The convergence of the new methods are given. Numerical experiments are shown to illustrate that the new methods have higher accuracy and efficiency.     

Chebyshev polynomial approximation for high‐order partial differential equations with complicated conditions

In this article, a new method is presented for the solution of high‐order linear partial differential equations (PDEs) with variable coefficients under the most general conditions. The method is based on the approximation by the truncated double Chebyshev series. PDE and conditions are transformed into the matrix equations, which corresponds to a system of linear algebraic equations with the unknown Chebyshev coefficients, via Chebyshev collocation points. Combining these matrix equations and then solving the system yields the Chebyshev coefficients of the solution function. Some numerical results are included to demonstrate the validity and applicability of the method. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009