Computer difference scheme for a singularly perturbed elliptic convection–diffusion equation in the presence of perturbations

被引:0
|
作者
G. I. Shishkin
机构
[1] Russian Academy of Sciences,Krasovskii Institute of Mathematics and Mechanics, Ural Branch
关键词
singularly perturbed boundary value problem; elliptic convection–diffusion equation; boundary layer; standard difference scheme on uniform meshes; perturbations of data of the grid problem; computer perturbations; maximum norm; stability of schemes to perturbations; conditioning of schemes; computer scheme; reliable difference scheme;
D O I
暂无
中图分类号
学科分类号
摘要
A grid approximation of a boundary value problem for a singularly perturbed elliptic convection–diffusion equation with a perturbation parameter ε, ε ∈ (0,1], multiplying the highest order derivatives is considered on a rectangle. The stability of a standard difference scheme based on monotone approximations of the problem on a uniform grid is analyzed, and the behavior of discrete solutions in the presence of perturbations is examined. With an increase in the number of grid nodes, this scheme does not converge -uniformly in the maximum norm, but only conditional convergence takes place. When the solution of the difference scheme converges, which occurs if N1-1N2-1 ≪ ε, where N1 and N2 are the numbers of grid intervals in x and y, respectively, the scheme is not -uniformly well-conditioned or ε-uniformly stable to data perturbations in the grid problem and to computer perturbations. For the standard difference scheme in the presence of data perturbations in the grid problem and/or computer perturbations, conditions imposed on the “parameters” of the difference scheme and of the computer (namely, on ε, N1,N2, admissible data perturbations in the grid problem, and admissible computer perturbations) are obtained that ensure the convergence of the perturbed solutions as N1,N2 → ∞, ε ∈ (0,1]. The difference schemes constructed in the presence of the indicated perturbations that converges as N1,N2 → ∞ for fixed ε, ε ∈ (0,1, is called a computer difference scheme. Schemes converging ε-uniformly and conditionally converging computer schemes are referred to as reliable schemes. Conditions on the data perturbations in the standard difference scheme and on computer perturbations are also obtained under which the convergence rate of the solution to the computer difference scheme has the same order as the solution of the standard difference scheme in the absence of perturbations. Due to this property of its solutions, the computer difference scheme can be effectively used in practical computations.
引用
下载
收藏
页码:815 / 832
页数:17
相关论文
共 50 条