Sufficient conditions for uniform convergence on layer-adapted meshes for one-dimensional reaction–diffusion problems

2005 ◽  
Vol 40 (1) ◽  
pp. 23-32 ◽  
Author(s):  
Torsten Linß
2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Raffaela Capitanelli ◽  
Maria Agostina Vivaldi

AbstractIn this paper, we study asymptotic behavior of solutions to obstacle problems for p-Laplacians as {p\to\infty}. For the one-dimensional case and for the radial case, we give an explicit expression of the limit. In the n-dimensional case, we provide sufficient conditions to assure the uniform convergence of the whole family of the solutions of obstacle problems either for data f that change sign in Ω or for data f (that do not change sign in Ω) possibly vanishing in a set of positive measure.


2013 ◽  
Vol 13 (1) ◽  
pp. 79-94 ◽  
Author(s):  
Huiqing Zhu ◽  
Zhimin Zhang

Abstract. The local discontinuous Galerkin method (LDG) is considered for solving one-dimensional singularly perturbed two-point boundary value problems of reaction-diffusion type. Pointwise error estimates for the LDG approximation to the solution and its derivative are established on a Shishkin-type mesh. Numerical experiments are presented. Moreover, a superconvergence of order of the numerical traces is observed numerically.


2015 ◽  
Vol 2015 ◽  
pp. 1-9
Author(s):  
Tamás Mona ◽  
István Lagzi ◽  
Ágnes Havasi

Richardson extrapolation is a simple but powerful computational tool to enhance the accuracy of time integration methods. In the past years a few theoretical and partly practical works have been presented on this method. Detailed numerical applications of this method, however, are rarely found in the literature. Therefore, it is worth investigating whether this promising technique lives up to the expectations also in practice. In this paper we investigate the efficiency of the Richardson method in one-dimensional numerical (reaction-diffusion) problems.


2014 ◽  
Vol 07 (03) ◽  
pp. 1450030 ◽  
Author(s):  
Weihua Jiang ◽  
Xin Li ◽  
Xingfu Zou

We consider a system of partial differential equations that describes the interaction of the sterile and fertile species undergoing the sterile insect release method (SIRM). Unlike in the previous work [M. A. Lewis and P. van den Driessche, Waves of extinction from sterile insect release, Math. Biosci.5 (1992) 221–247] where the habitat is assumed to be the one-dimensional whole space ℝ, we consider this system in a bounded one-dimensional domain (interval). Our goal is to derive sufficient conditions for success of the SIRM. We show the existence of the fertile-free steady state and prove its stability. Using the releasing rate as the parameter, and by a saddle-node bifurcation analysis, we obtain conditions for existence of two co-persistence steady states, one stable and the other unstable. Biological implications of our mathematical results are that: (i) when the fertile population is at low level, the SIRM, even with small releasing rate, can successfully eradicate the fertile insects; (ii) when the fertile population is at a higher level, the SIRM can succeed as long as the strength of the sterile releasing is large enough, while the method may also fail if the releasing is not sufficient.


2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Thái Anh Nhan ◽  
Relja Vulanović

A one-dimensional linear convection-diffusion problem with a perturbation parameter ɛ multiplying the highest derivative is considered. The problem is solved numerically by using the standard upwind scheme on special layer-adapted meshes. It is proved that the numerical solution is ɛ-uniform accurate in the maximum norm. This is done by a new proof technique in which the discrete system is preconditioned in order to enable the use of the principle where “ɛ-uniform stability plus ɛ-uniform consistency implies ɛ-uniform convergence.” Without preconditioning, this principle cannot be applied to convection-diffusion problems because the consistency error is not uniform in ɛ. At the same time, the condition number of the discrete system becomes independent of ɛ due to the same preconditioner; otherwise, the condition number of the discrete system before preconditioning increases when ɛ tends to 0. We obtained such results in an earlier paper, but only for the standard Shishkin mesh. In a nontrivial generalization, we show here that the same proof techniques can be applied to the whole class of Shishkin-type meshes.


Sign in / Sign up

Export Citation Format

Share Document