Analysis of Finite Element Methods for the Nonlinear Dynamic Analysis of Shells.
So far optimal error estimates on Bakhvalov-type meshes are only known for finite difference and finite element methods solving linear convection-diffusion problems in the one-dimensional case. We prove (almost) optimal error estimates for problems with exponential boundary layers in two dimensions.
Patch substructuring methods are non-overlapping domain decomposition methods like classical substructuring methods, but they use information from geometric patches reaching into neighboring subdomains condensated, on the interfaces to enhance the performance of the method, while keeping it non-overlapping. These methods are very convenient to use in practice, but their convergence properties have not been studied yet. We analyze geometric patch substructuring methods for the special case of one...
The paper is concerned with the numerical analysis of an elliptic equation in a polygon with a nonlinear Newton boundary condition, discretized by the finite element or discontinuous Galerkin methods. Using the monotone operator theory, it is possible to prove the existence and uniqueness of the exact weak solution and the approximate solution. The main attention is paid to the study of error estimates. To this end, the regularity of the weak solution is investigated and it is shown that due to...
In this paper we present two-level overlapping domain decomposition preconditioners for the finite-element discretisation of elliptic problems in two and three dimensions. The computational domain is partitioned into overlapping subdomains, and a coarse space correction is added. We present an algebraic way to define the coarse space, based on the concept of aggregation. This employs a (smoothed) aggregation technique and does not require the introduction of a coarse grid. We consider a set of assumptions...
In this paper we present two-level overlapping domain decomposition preconditioners for the finite-element discretisation of elliptic problems in two and three dimensions. The computational domain is partitioned into overlapping subdomains, and a coarse space correction is added. We present an algebraic way to define the coarse space, based on the concept of aggregation. This employs a (smoothed) aggregation technique and does not require the introduction of a coarse grid. We consider a...
We develop a new technique which, for the given smooth function, generates the anisotropic triangular grid and the corresponding polynomial approximation degrees based on the minimization of the interpolation error in the broken -seminorm. This technique can be employed for the numerical solution of boundary value problems with the aid of finite element methods. We present the theoretical background of this approach and show several numerical examples demonstrating the efficiency of the proposed...