اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAn arbitrary-order method for magnetostatics on polyhedral meshes based on a discrete de Rham sequence
88
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this work, we develop a discretisation method for the mixed formulation of the magnetostatic problem supporting arbitrary orders and polyhedral meshes. The method is based on a global discrete de Rham (DDR) sequence, obtained by patching the local spaces constructed in [Di Pietro, Droniou, Rapetti, Fully discrete polynomial de Rham sequences of arbitrary degree on polygons and polyhedra, arXiv:1911.03616] by enforcing the single-valuedness of the components attached to the boundary of each element. The first main contribution of this paper is a proof of exactness relations for this global DDR sequence, obtained leveraging the exactness of the corresponding local sequence and a topological assembly of the mesh valid for domains that do not enclose any void. The second main contribution is the formulation and well-posedness analysis of the method, which includes the proof of uniform Poincare inequalities for the discrete divergence and curl operators. The convergence rate in the natural energy norm is numerically evaluated on standard and polyhedral meshes. When the DDR sequence of degree $kge 0$ is used, the error converges as $h^{k+1}$, with $h$ denoting the meshsize.
قيم البحث
اقرأ أيضاً
The main difficulty in solving the discrete constrained problem is its poor and even ill condition. In this paper, we transform the discrete constrained problems on de Rham complex to Laplace-like problems. This transformation not only make the const
rained problems solvable, but also make it easy to use the existing iterative methods and preconditioning techniques to solving large-scale discrete constrained problems.
We develop an approach to generating degree-of-freedom maps for arbitrary order finite element spaces for any cell shape. The approach is based on the composition of permutations and transformations by cell sub-entity. Current approaches to generatin
g degree-of-freedom maps for arbitrary order problems typically rely on a consistent orientation of cell entities that permits the definition of a common local coordinate system on shared edges and faces. However, while orientation of a mesh is straightforward for simplex cells and is a local operation, it is not a strictly local operation for quadrilateral cells and in the case of hexahedral cells not all meshes are orientable. The permutation and transformation approach is developed for a range of element types, including Lagrange, and divergence- and curl-conforming elements, and for a range of cell shapes. The approach is local and can be applied to cells of any shape, including general polytopes and meshes with mixed cell types. A number of examples are presented and the developed approach has been implemented in an open-source finite element library.
In this paper, based on the idea of self-adjusting steepness based schemes[5], a two-dimensional calculation method of steepness parameter is proposed, and thus a two-dimensional self-adjusting steepness based limiter is constructed. With the applica
tion of such limiter to the over-intersection based remapping framework, a low dissipation remapping method has been proposed that can be applied to the existing ALE method.
We design a Hybrid High-Order (HHO) scheme for the Poisson problem that is fully robust on polytopal meshes in the presence of small edges/faces. We state general assumptions on the stabilisation terms involved in the scheme, under which optimal erro
r estimates (in discrete and continuous energy norms, as well as $L^2$-norm) are established with multiplicative constants that do not depend on the maximum number of faces in each element, or the relative size between an element and its faces. We illustrate the error estimates through numerical simulations in 2D and 3D on meshes designed by agglomeration techniques (such meshes naturally have elements with a very large numbers of faces, and very small faces).
We develop a geometrically intrinsic formulation of the arbitrary-order Virtual Element Method (VEM) on polygonal cells for the numerical solution of elliptic surface partial differential equations (PDEs). The PDE is first written in covariant form u
sing an appropriate local reference system. The knowledge of the local parametrization allows us to consider the two-dimensional VEM scheme, without any explicit approximation of the surface geometry. The theoretical properties of the classical VEM are extended to our framework by taking into consideration the highly anisotropic character of the final discretization. These properties are extensively tested on triangular and polygonal meshes using a manufactured solution. The limitations of the scheme are verified as functions of the regularity of the surface and its approximation.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
