High‐order finite difference schemes for numerical solutions of the generalized Burgers–Huxley equation

In this article, up to tenth‐order finite difference schemes are proposed to solve the generalized Burgers–Huxley equation. The schemes based on high‐order differences are presented using Taylor series expansion. To establish the numerical solutions of the corresponding equation, the high‐order schemes in space and a fourth‐order Runge‐Kutta scheme in time have been combined. Numerical experiments have been conducted to demonstrate the high‐order accuracy of the current algorithms with relatively minimal computational effort. The results showed that use of the present approaches in the simulation is very applicable for the solution of the generalized Burgers–Huxley equation. The current results are also seen to be more accurate than some results given in the literature. The proposed algorithms are seen to be very good alternatives to existing approaches for such physical applications. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1313‐1326, 2011     

A nonstandard finite difference scheme for contaminant transport with kinetic langmuir sorption

This study focuses on a contaminant transport model with Langmuir sorption under nonequilibrium conditions. The numerical instabilities of the standard finite difference schemes including the upwind method are investigated. By using the nonstandard finite difference method, a better finite difference model is constructed. The numerical simulation on a specific system configuration proves the advantages of the new finite difference model. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 767–785, 2011     

Parameter choice methods using minimization schemes

Regularization is typically based on the choice of some parametric family of nearby solutions, and the choice of this family is a task in itself. Then, a suitable parameter must be chosen in order to find an approximation of good quality. We focus on the second task. There exist deterministic and stochastic models for describing noise and solutions in inverse problems. We will establish a unified framework for treating different settings for the analysis of inverse problems, which allows us to prove the convergence and optimality of parameter choice schemes based on minimization in a generic way. We show that the well known quasi-optimality criterion falls in this class. Furthermore we present a new parameter choice method and prove its convergence by using this newly established tool.     

Superconvergence analysis of finite element method for Poisson–Nernst–Planck equations

This article concerns with the superconvergence analysis of bilinear finite element method (FEM) for nonlinear Poisson–Nernst–Planck (PNP) equations. By employing high accuracy integral identities together with mean value technique, the superclose estimates in H¹‐norm are derived for the semi‐discrete and the backward Euler fully‐discrete schemes, which improve the suboptimal error estimate in L²‐norm in the previous literature. Furthermore, the global superconvergence results in H¹‐norm are obtained through interpolation postprocessing approach. Finally, a numerical example is provided to confirm the theoretical analysis.     

On explicit order 1.5 approximations with varying coefficients: The case of super-linear diffusion coefficients

A conjecture appears in Kumar and Sabanis (2016), in the form of a remark, where it is stated that it is possible to construct, in a specified way, any high order explicit numerical schemes to approximate the solutions of SDEs with superlinear coefficients. We answer this conjecture to the positive for the case of order 1.5 approximations and show that the suggested methodology works. Moreover, we explore the case of having Hölder continuous derivatives for the diffusion coefficients.     

Gearhart–Koshy acceleration for affine subspaces

The method of cyclic projections finds nearest points in the intersection of finitely many affine subspaces. To accelerate convergence, Gearhart & Koshy proposed a modification which, in each iteration, performs an exact line search based on minimising the distance to the solution. When the subspaces are linear, the procedure can be made explicit using feasibility of the zero vector. This work studies an alternative approach which does not rely on this fact, thus providing an efficient implementation in the affine setting.     

使用多色合成激光场拓展高次谐波谱平台区域的宽度

本文提出了一种多色合成激光方案用来有效的提高高次谐波谱平台区域的宽度. 我们首先通过在800nm基本激光脉冲上添加一束或者两束控制激光脉冲在理论上得到双色以及三色合成激光场;其次,通过求解一维含时薛定谔方程,计算得到了在多色合成激光场条件下的高次谐波谱,计算结果表明,多色合成激光场方案可以有效的拓展高次谐波谱的平台区域;最后,我们结合电子的经典回碰动能分布以及时频分布,分析了在多色场条件下高次谐波谱平台区域拓宽的机理和微观机制.     

Numerical solution of the Boltzmann equation by time relaxed Monte Carlo (TRMC) methods

A new family of Monte Carlo schemes has been recently introduced for the numerical solution of the Boltzmann equation of rarefied gas dynamics (SIAM J. Sci. Comput. 2001; 23 :1253–1273). After a splitting of the equation the time discretization of the collision step is obtained from the Wild sum expansion of the solution by replacing high‐order terms in the expansion with the equilibrium Maxwellian distribution. The corresponding time relaxed Monte Carlo (TRMC) schemes allow the use of time steps larger than those required by direct simulation Monte Carlo (DSMC) and guarantee consistency in the fluid‐limit with the compressible Euler equations. Conservation of mass, momentum, and energy are also preserved by the schemes. Applications to a two‐dimensional gas dynamic flow around an obstacle are presented which show the improvement in terms of computational efficiency of TRMC schemes over standard DSMC for regimes close to the fluid‐limit. Copyright © 2005 John Wiley & Sons, Ltd.     

Stencils with isotropic discretization error for differential operators

We derive stencils, i.e., difference schemes, for differential operators for which the discretization error becomes isotropic in the lowest order. We treat the Laplacian, Bilaplacian (= biharmonic operator), and the gradient of the Laplacian both in two and three dimensions. For three dimensions ??(h²) results are given while for two dimensions both ??(h²) and ??(h⁴) results are presented. The results are also available in electronic form as a Mathematica file. It is shown that the extra computational cost of an isotropic stencil usually is less than 20%. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

A high‐order accurate method for two‐dimensional incompressible viscous flows

A high‐order accurate solution method for complex geometries is developed for two‐dimensional flows using the stream function–vorticity formulation. High‐order accurate spectrally optimized compact schemes along with appropriate boundary schemes are used for spatial discretization while a two‐level backward Euler implicit scheme is used for the time integration. The linear system of equations for stream function and vorticity are solved by an inner iteration while contravariant velocities constitute outer iterations. The effect of curvilinear grids on the solution accuracy is studied. The method is used to compute Cartesian and inclined driven cavity, flow in a triangular cavity and viscous flow in constricted channel. Benchmark‐like accuracy is obtained in all the problems with fewer grid points compared to reported studies. Copyright © 2006 John Wiley & Sons, Ltd.