A class of linear elliptic operators has an important qualitative property, the so-called maximum principle. In this paper we investigate how this property can be preserved on the discrete level when an interior penalty discontinuous Galerkin method is applied for the discretization of a 1D elliptic operator. We give mesh conditions for the symmetric and for the incomplete method that establish some connection between the mesh size and the penalty parameter. We then investigate the sharpness of these conditions. The theoretical results are illustrated with numerical examples.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
We develop implicit a posteriori error estimators for elliptic boundary value problems. Local problems are formulated for the error and the corresponding Neumann type boundary conditions are approximated using a new family of gradient averaging procedures. Convergence properties of the implicit error estimator are discussed independently of residual type error estimators, and this gives a freedom in the choice of boundary conditions. General assumptions are elaborated for the gradient averaging which define a family of implicit a posteriori error estimators. We will demonstrate the performance and the favor of the method through numerical experiments.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.