Abstract
In this paper, we propose a numerical scheme for a system of two linear singularly perturbed parabolic convection-diffusion equations. The presented numerical scheme consists of a classical backward-Euler scheme on a uniform mesh for the time discretization and an upwind finite difference scheme on an arbitrary nonuniform mesh for the spatial discretization. Then, for the time semidiscretization scheme, an a priori and an a posteriori error estimations in the maximum norm are obtained. It should be pointed out that the a posteriori error bound is suitable to design an adaptive algorithm, which is used to generate an adaptive spatial grid. It is proved that the method converges uniformly in the discrete maximum norm with first-order time and spatial accuracy, respectively, for the fully discrete scheme. At last, some numerical results are given to validate the theoretical results.
Highlights
In [13,14,15], the authors considered some special strongly coupled system of singularly perturbed convection-diffusion problems and constructed some corresponding layer-adapted mesh approaches
In this paper, we consider the following system of two linear singularly perturbed parabolic convection-diffusion equations: ⎧ ⎪⎪⎨Lε u ≡ ∂u ∂t + Lx,ε u = f(x, t),(x, t) ∈ Ω × (0, T] ≡ (0, 1) × (0, T],⎪⎪⎩uu((0x, 0) t)
5 Numerical examples and discussion we show the numerical results of two examples to verify the theoretical results
Summary
In [13,14,15], the authors considered some special strongly coupled system of singularly perturbed convection-diffusion problems and constructed some corresponding layer-adapted mesh approaches. Liu and Chen [19] constructed an adaptive moving grid method for a special strongly coupled system of two singularly perturbed convection-diffusion problems and obtained an a posteriori error estimation in maximum norm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.