A monotone scheme for Hamilton–Jacobi equations via the nonstandard finite difference method

A usual way of approximating Hamilton–Jacobi equations is to couple space finite element discretization with time finite difference discretization. This classical approach leads to a severe restriction on the time step size for the scheme to be monotone. In this paper, we couple the finite element method with the nonstandard finite difference method, which is based on Mickens' rule of nonlocal approximation. The scheme obtained in this way is unconditionally monotone. The convergence of the new method is discussed and numerical results that support the theory are provided. Copyright © 2009 John Wiley & Sons, Ltd.     

多边形网格上扩散方程新的单调格式

 本文在星形多边形网格上, 构造了扩散方程新的单调有限体积格式.该格式与现有的基于非线性两点流的单调格式的主要区别是, 在网格边的法向流离散模板中包含当前边上的点, 在推导离散法向流的表达式时采用了定义于当前边上的辅助未知量, 这样既可适应网格几何大变形, 同时又兼顾了当前网格边上物理量的变化. 在光滑解情形证明了离散法向流的相容性.对于具有强各向异性、非均匀张量扩散系数的扩散方程, 证明了新格式是单调的, 即格式可以保持解析解的正性. 数值结果表明在扭曲网格上, 所构造的格式是局部守恒和保正的, 对光滑解有高于一阶的精度, 并且, 针对非平衡辐射限流扩散问题, 数值结果验证了新格式在计算效率和守恒精度上优于九点格式.     

Crank-Nicolson拟合有限体积法定价机制转换下的欧式期权（英文）

This paper develops and analyses a novel numerical scheme to price European options under regime switching model which is governed by a system of partial differential equations(PDEs).To numerically solve these PDEs,we introduce a fitted finite volume method for the spatial discretization,coupled with the Crank-Nicolson time stepping scheme.We show that this scheme is consistent,stable and monotone,and hence the convergence of the numerical solution to the viscosity solution of the continuous problem is guaranteed.Numerical experiments are presented to demonstrate the accuracy,efficiency and robustness of the new numerical method.     

状态转换下欧式Merton跳扩散期权定价的拟合有限体积方法

本文主要研究状态转换下欧式Merton跳扩散期权定价模型的拟合有限体积方法.针对该定价模型中的偏积分-微分方程,空间方向采用拟合有限体积方法离散,时间方向构造Crank-Nicolson格式.理论证明了数值格式的一致性、稳定性和单调性,因此收敛至原连续问题的解.数值实验验证了新方法的稳健性,有效性和收敛性.     

Application of nonconforming finite elements to solving advection—diffusion problems

The paper investigates some nonconforming finite elements and nonconforming finite element schemes for solving an advection—diffusion equation. This investigation is aimed at finding new schemes for solving parabolic equations. The study uses a finite element method, variational-difference schemes, and test calculations. Two types of schemes are examined: one is obtained with the help of the Bubnov—Galerkin method from a weak problem determination (nonmonotone scheme), and the other one is a monotone up-stream scheme obtained from an approximate weak problem determination with a special approximation of the skew-symmetric terms.     

Convergence of Three-Step Taylor Galerkin Finite Element Scheme Based Monotone Schwarz Iterative Method for Singularly Perturbed Differential-Difference Equation

Monotone Schwarz iterative methods for parabolic partial differential equations are well known for their advantage of eliminating the search for an initial solution. In this article, we propose a monotone Schwarz iterative method for singularly perturbed parabolic retarded differential-difference equations based on a three-step Taylor Galerkin finite element scheme. The stability and ε-uniform convergence of the three-step Taylor Galerkin finite element method have been discussed. Further, by using maximum principle and induction hypothesis, the convergence of the proposed monotone Schwarz iterative method has been established.     

A splitting algorithm for a class of bilevel equilibrium problems involving nonexpansive mappings

We propose splitting, parallel algorithms for solving strongly equilibrium problems over the intersection of a finite number of closed convex sets given as the fixed-point sets of nonexpansive mappings in real Hilbert spaces. The algorithm is a combination between the gradient method and the Mann-Krasnosel’skii iterative scheme, where the projection can be computed onto each set separately rather than onto their intersection. Strong convergence is proved. Some special cases involving bilevel equilibrium problems with inverse strongly monotone variational inequality, monotone equilibrium constraints and maximal monotone inclusions are discussed. An illustrative example involving a system of integral equations is presented.     

带非线性边界条件的反应扩散方程的数值方法

１引言近年来关于非线性抛物型方程数值解法的研究取得了许多好的结果,其中以Ｃ．Ｖ．Ｐａｏ为主的研究者们利用上、下解方法对带线性边界条件的半线性抛物型方程的有限差分系统进行了广泛的研究,提出了一系列有效的迭代算法（见［１］、［２］、［３］、［４］）．但对带非线性边界条件的半线性抛物型方程初边值问题,作者至今尚未见到有研究者将上、下解方法用在相应的差分系统上,求得数值解．其主要原因是由于边界上函数的非线性,解在边界网格点上的值未知且无法用内部网格点上的值直接表示,相应的差分系统表示形式受到影响,边界网…     

A class of two‐stage iterative methods for systems of weakly nonlinear equations

The discretizations of many differential equations by the finite difference or the finite element methods can often result in a class of system of weakly nonlinear equations. In this paper, by applying the two-tage iteration technique and in accordance with the special properties of this weakly nonlinear system, we first propose a general two-tage iterative method through the two-tage splitting of the system matrix. Then, by applying the accelerated overrelaxation (AOR) technique of the linear iterative methods, we present a two-tage AOR method, which particularly uses the AOR iteration as the inner iteration and is substantially a relaxed variant of the afore-presented method. For these two classes of methods, we establish their local convergence theories, and precisely estimate their asymptotic convergence factors under some suitable assumptions when the involved nonlinear mapping is only B-differentiable. When the system matrix is either a monotone matrix or an H-matrix, and the nonlinear mapping is a P-bounded mapping, we thoroughly set up the global convergence theories of these new methods. Moreover, under the assumptions that the system matrix is monotone and the nonlinear mapping is isotone, we discuss the monotone convergence properties of the new two-tage iteration methods, and investigate the influence of the matrix splittings as well as the relaxation parameters on the convergence behaviours of these methods. Numerical computations show that our new methods are feasible and efficient for solving the system of weakly nonlinear equations. This revised version was published online in June 2006 with corrections to the Cover Date.     

Parallel multisplitting two-stage iterative methods for large sparse systems of weakly nonlinear equations

The finite difference or the finite element discretizations of many differential or integral equations often result in a class of systems of weakly nonlinear equations. In this paper, by reasonably applying both the multisplitting and the two-stage iteration techniques, and in accordance with the special properties of this system of weakly nonlinear equations, we first propose a general multisplitting two-stage iteration method through the two-stage multiple splittings of the system matrix. Then, by applying the accelerated overrelaxation (AOR) technique of the linear iterative methods, we present a multisplitting two-stage AOR method, which particularly uses the AOR-like iteration as inner iteration and is substantially a relaxed variant of the afore-presented method. These two methods have a forceful parallel computing function and are much more suitable to the high-speed multiprocessor systems. For these two classes of methods, we establish their local convergence theories, and precisely estimate their asymptotic convergence factors under some suitable assumptions when the involved nonlinear mapping is only directionally differentiable. When the system matrix is either an H-matrix or a monotone matrix, and the nonlinear mapping is a P-bounded mapping, we thoroughly set up the global convergence theories of these new methods. Moreover, under the assumptions that the system matrix is monotone and the nonlinear mapping is isotone, we discuss the monotone convergence properties of the new multisplitting two-stage iteration methods, and investigate the influence of the multiple splittings as well as the relaxation parameters upon the convergence behaviours of these methods. Numerical computations show that our new methods are feasible and efficient for parallel solving of the system of weakly nonlinear equations. This revised version was published online in August 2006 with corrections to the Cover Date.     

Finite difference reaction diffusion equations with nonlinear boundary conditions

This article is concerned with numerical solutions of finite difference systems of reaction diffusion equations with nonlinear internal and boundary reaction functions. The nonlinear reaction functions are of general form and the finite difference systems are for both time-dependent and steady-state problems. For each problem a unified system of nonlinear equations is treated by the method of upper and lower solutions and its associated monotone iterations. This method leads to a monotone iterative scheme for the computation of numerical solutions as well as an existence-comparison theorem for the corresponding finite difference system. Special attention is given to the dynamical property of the time-dependent solution in relation to the steady-state solutions. Application is given to a heat-conduction problem where a nonlinear radiation boundary condition obeying the Boltzmann law of cooling is considered. This application demonstrates a bifurcation property of two steady-state solutions, and determines the dynamic behavior of the time-dependent solution. Numerical results for the heat-conduction problem, including a test problem with known analytical solution, are presented to illustrate the various theoretical conclusions. © 1995 John Wiley & Sons, Inc.     

Higher-order compact finite difference method for systems of reaction–diffusion equations

This paper is concerned with a compact finite difference method for solving systems of two-dimensional reaction–diffusion equations. This method has the accuracy of fourth-order in both space and time. The existence and uniqueness of the finite difference solution are investigated by the method of upper and lower solutions, without any monotone requirement on the nonlinear term. Three monotone iterative algorithms are provided for solving the resulting discrete system efficiently, and the sequences of iterations converge monotonically to a unique solution of the system. A theoretical comparison result for the various monotone sequences is given. The convergence of the finite difference solution to the continuous solution is proved, and Richardson extrapolation is used to achieve fourth-order accuracy in time. An application is given to an enzyme–substrate reaction–diffusion problem, and some numerical results are presented to demonstrate the high efficiency and advantages of this new approach.     

Numerical solutions for some coupled systems of nonlinear boundary value problems

Summary In the well-known Volterra-Lotka model concerning two competing species with diffusion, the densities of the species are governed by a coupled system of reaction diffusion equations. The aim of this paper is to present an iterative scheme for the steady state solutions of a finite difference system which corresponds to the coupled nonlinear boundary value problems. This iterative scheme is based on the method of upper-lower solutions which leads to two monotone sequences from some uncoupled linear systems. It is shown that each of the two sequences converges to a nontrivial solution of the discrete equations. The model under consideration may have one, two or three nonzero solutions and each of these solutions can be computed by a suitable choice of initial iteration. Numerical results are given for these solutions under both the Dirichlet boundary condition and the mixed type boundary condition.     

Iterative approximation of zeroes of monotone operators and system of generalized mixed equilibrium problems

In this paper, we construct a new iterative scheme by hybrid method for approximation of common element of set of zeroes of a finite family of ??-inverse-strongly monotone operators and set of common solutions to a system of generalized mixed equilibrium problems in a 2-uniformly convex real Banach space which is also uniformly smooth. Then, we prove strong convergence of the scheme to a common element of the two sets.     

求解带非线性边界条件的反应扩散方程数值解的组合迭代方法

1　引　　言我们首先考虑如下抛物型方程ｕｔ-ＤΔｕ =ｆ(ｘ ,ｔ ,ｕ) (ｔ∈ ( 0 ,Ｔ],ｘ∈Ω ) ｕ/ ν+ βｕ =ｇ(ｘ ,ｔ ,ｕ) (ｔ∈ ( 0 ,Ｔ],ｘ∈ Ω )ｕ(ｘ ,0 ) =ψ(ｘ) (ｘ∈Ω )( 1 .1 )其中Ｔ为正常数 ,Ω 是ＲＰ 空间的有界区域 记ＱＴ=Ω × ( 0 ,Ｔ],ＳＴ= Ω × ( 0 ,Ｔ],假设在ＱＴ上Ｄ≡ｄ(ｘ ,ｔ) >0 ,在ＳＴ 上β≡β(ｘ ,ｔ)≥ 0 又设 ｆ(ｘ ,ｔ,ｕ) ,ｇ(ｘ ,ｔ,ｕ)为关于ｕ的非线性函数 ,且对ｘ ,ｔ各参数满足Ｈ¨ｏｌｄｅｒ连续条件 将 ( 1 .1 )离散化之后我们得到相应的有限差分系统 ,当 ｇ(ｘ ,ｔ,ｕ)为ｕ的线性…     

Hamilton-Jacobi方程的单调有限元格式

A monotone finite element scheme is obtained by applying the finite element method to the viscosity equation of the Hamilton-Jacobi equation on unstructured meshes. Under some constraints, we show that this scheme is monotone and its numerical solution converges to the viscosity solution of the Hamilton-Jacobi equa-tion. Numerical examples test the stability and the convergence of this scheme.     

Nonstationary monotone iterative methods for nonlinear partial differential equations

A simple technique is given in this paper for the construction and analysis of monotone iterative methods for a class of nonlinear partial differential equations. With the help of the special nonlinear property we can construct nonstationary parameters which can speed up the iterative process in solving the nonlinear system. Picard, Gauss–Seidel, and Jacobi monotone iterative methods are presented and analyzed for the adaptive solutions. The adaptive meshes are generated by the 1-irregular mesh refinement scheme which together with the M-matrix of the finite element stiffness matrix lead to existence–uniqueness–comparison theorems with simple upper and lower solutions as initial iterates. Some numerical examples, including a test problem with known analytical solution, are presented to demonstrate the accuracy and efficiency of the adaptive and monotone properties. Numerical results of simulations on a MOSFET with the gate length down to 34 nm are also given.     

Monotone iterative methods for the adaptive finite element solution of semiconductor equations

Picard, Gauss–Seidel, and Jacobi monotone iterative methods are presented and analyzed for the adaptive finite element solution of semiconductor equations in terms of the Slotboom variables. The adaptive meshes are generated by the 1-irregular mesh refinement scheme. Based on these unstructured meshes and a corresponding modification of the Scharfetter–Gummel discretization scheme, it is shown that the resulting finite element stiffness matrix is an M-matrix which together with the Shockley–Read–Hall model for the generation–recombination rate leads to an existence–uniqueness–comparison theorem with simple upper and lower solutions as initial iterates. Numerical results of simulations on a MOSFET device model are given to illustrate the accuracy and efficiency of the adaptive and monotone properties of the present methods.     

A modified accelerated monotone iterative method for finite difference reaction-diffusion-convection equations

This paper is concerned with monotone algorithms for the finite difference solutions of a class of nonlinear reaction-diffusion-convection equations with nonlinear boundary conditions. A modified accelerated monotone iterative method is presented to solve the finite difference systems for both the time-dependent problem and its corresponding steady-state problem. This method leads to a simple and yet efficient linear iterative algorithm. It yields two sequences of iterations that converge monotonically from above and below, respectively, to a unique solution of the system. The monotone property of the iterations gives concurrently improving upper and lower bounds for the solution. It is shown that the rate of convergence for the sum of the two sequences is quadratic. Under an additional requirement, quadratic convergence is attained for one of these two sequences. In contrast with the existing accelerated monotone iterative methods, our new method avoids computing local maxima in the construction of these sequences. An application using a model problem gives numerical results that illustrate the effectiveness of the proposed method.     

Convergence of Finite Volume Schemes for Hamilton-Jacobi Equations with Dirichlet Boundary Conditions

We study numerical methods for time-dependent Hamilton-Jacobi equations with weak Dirichlet boundary conditions. We first propose a new class of abstract monotone approximation schemes and get a convergence rate of 1/2 . Then, according to the abstract convergence results, by newly constructing monotone finite volume approximations on interior and boundary points, we obtain convergent finite volume schemes for time-dependent Hamilton-Jacobi equations with weak Dirichlet boundary conditions. Finally give some numerical results.