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.
The paper is devoted to verification of accuracy of approximate solutions obtained in computer simulations. This problem is strongly related to a posteriori error estimates, giving computable bounds for computational errors and detecting zones in the solution domain where such errors are too large and certain mesh refinements should be performed. A mathematical model consisting of a linear elliptic (reaction-diffusion) equation with a mixed Dirichlet/Neumann/Robin boundary condition is considered...
The paper is devoted to the problem of verification of accuracy of approximate solutions obtained in computer simulations. This problem is strongly related to a posteriori error estimates, giving computable bounds for computational errors and detecting zones in the solution domain where such errors are too large and certain mesh refinements should be performed. A mathematical model embracing nonlinear elliptic variational problems is considered in this work. Based on functional type estimates developed...
The famous Zlámal’s minimum angle condition has been widely used for construction of a regular family of triangulations (containing nondegenerating triangles) as well as in convergence proofs for the finite element method in . In this paper we present and discuss its generalization to simplicial partitions in any space dimension.
Over the past fifty years, finite element methods for the approximation of solutions of partial differential equations (PDEs) have become a powerful and reliable tool. Theoretically, these methods are not restricted to PDEs formulated on physical domains up to dimension three. Although at present there does not seem to be a very high practical demand for finite element methods that use higher dimensional simplicial partitions, there are some advantages in studying the methods independent of the...
In this note we present an algorithm for a construction of strongly regular families of triangulations for planar domains with a piecewise curved boundary. Some additional properties of the resulting triangulations are considered.
Linear tetrahedral finite elements whose dihedral angles are all nonobtuse guarantee the validity of the discrete maximum principle for a wide class of second order elliptic and parabolic problems. In this paper we present an algorithm which generates nonobtuse face-to-face tetrahedral partitions that refine locally towards a given Fichera-like corner of a particular polyhedral domain.
We solve a linear parabolic equation in , with the third nonhomogeneous boundary condition using the finite element method for discretization in space, and the -method for discretization in time. The convergence of both, the semidiscrete approximations and the fully discretized ones, is analysed. The proofs are based on a generalization of the idea of the elliptic projection. The rate of convergence is derived also for variable time step-sizes.
The maximum angle condition of J. L. Synge was originally introduced in interpolation theory and further used in finite element analysis and applications for triangular and later also for tetrahedral finite element meshes. In this paper we present some of its generalizations to higher-dimensional simplicial elements. In particular, we prove optimal interpolation properties of linear simplicial elements in that degenerate in some way.
We present an algorithm for constructing families of conforming (i.e. face-to-face) nonobtuse tetrahedral finite element meshes for convex 3D cylindrical-type domains. In fact, the algorithm produces only path-tetrahedra.
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.
We show that in dimensions higher than two, the popular "red refinement" technique, commonly used for simplicial mesh refinements and adaptivity in the finite element analysis and practice, never yields subsimplices which are all acute even for an acute father element as opposed to the two-dimensional case. In the three-dimensional case we prove that there exists only one tetrahedron that can be partitioned by red refinement into eight congruent subtetrahedra that are all similar to the original...
The paper is devoted to the problem of reliable control of accuracy of approximate solutions obtained in computer simulations. This task is strongly related to the so-called a posteriori error estimates, giving computable bounds for computational errors and detecting zones in the solution domain, where such errors are too large and certain mesh refinements should be performed. Mathematical model described by a linear elliptic (reaction-diffusion) equation with mixed boundary conditions is considered....
In this work, we present and discuss continuous and discrete maximum/minimum principles for reaction-diffusion problems with the Neumann boundary condition solved by the finite element and finite difference methods.
Page 1