Second order elliptic systems with boundary conditions of Dirichlet, Neumann’s or Newton’s type are solved by means of linear finite elements on regular uniform triangulations. Error estimates of the optimal order are proved for the averaged gradient on any fixed interior subdomain, provided the problem under consideration is regular in a certain sense.
We consider the local projection finite element method for the discretization of a scalar convection-diffusion equation with a divergence-free convection field. We introduce a new fluctuation operator which is defined using an orthogonal projection with respect to a weighted inner product. We prove that the bilinear form corresponding to the discrete problem satisfies an inf-sup condition with respect to the SUPG norm and derive an error estimate for the discrete solution.
We prove that penalization of constraints occuring in the linear elliptic Neumann problem yields directly the exact solution for an arbitrary set of penalty parameters. In this case there is a continuum of Lagrange's multipliers. The proposed penalty method is applied to calculate the magnetic field in the window of a transformer.
Discretization of second order elliptic partial differential equations by discontinuous Galerkin method often results in numerical schemes with penalties. In this paper we analyze these penalized schemes in the context of quite general triangular meshes satisfying only a semiregularity assumption. A new (modified) penalty term is presented and theoretical properties are proven together with illustrative numerical results.
The space of divergence-free functions with vanishing normal flux on the boundary is approximated by subspaces of finite elements that have the same property. The easiest way of generating basis functions in these subspaces is considered.
We prove that the finite element method for one-dimensional problems yields no discretization error at nodal points provided the shape functions are appropriately chosen. Then we consider a biharmonic problem with mixed boundary conditions and the weak solution . We show that the Galerkin approximation of based on the so-called biharmonic finite elements is independent of the values of in the interior of any subelement.
We consider FE-grid optimization in elliptic unilateral boundary value problems. The criterion used in grid optimization is the total potential energy of the system. It is shown that minimization of this cost functional means a decrease of the discretization error or a better approximation of the unilateral boundary conditions. Design sensitivity analysis is given with respect to the movement of nodal points. Numerical results for the Dirichlet-Signorini problem for the Laplace equation and the...
We deal with a class of elliptic eigenvalue problems (EVPs) on a rectangle Ω ⊂ R^2 , with periodic or semi–periodic boundary conditions (BCs) on ∂Ω. First, for both types of EVPs, we pass to a proper variational formulation which is shown to fit into the general framework of abstract EVPs for symmetric, bounded, strongly coercive bilinear forms in Hilbert spaces, see, e.g., [13, §6.2]. Next, we consider finite element methods (FEMs) without and with numerical quadrature. The aim of the paper is...
We propose an analogue of the maximum angle condition (commonly used in finite element analysis for triangular and tetrahedral meshes) for the case of prismatic elements. Under this condition, prisms in the meshes may degenerate in certain ways, violating the so-called inscribed ball condition presented by P. G. Ciarlet (1978), but the interpolation error remains of the order in the -norm for sufficiently smooth functions.
The present paper deals with the numerical solution of the nonlinear heat equation. An iterative method is suggested in which the iterations are obtained by solving linear heat equation. The convergence of the method is proved under very natural conditions on given input data of the original problem. Further, questions of convergence of the Galerkin method applied to the original equation as well as to the linear equations in the above mentioned iterative method are studied.