اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدRobust Algebraic multilevel preconditioning in $H(mathrm{curl})$ and $H(mathrm{div})$
147
0
0.0
(
0
)
تأليف
S. K. Tomar
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
An algebraic multilevel iteration method for solving system of linear algebraic equations arising in $H(mathrm{curl})$ and $H(mathrm{div})$ spaces are presented. The algorithm is developed for the discrete problem obtained by using the space of lowest order Nedelec and Raviart-Thomas-Nedelec elements. The theoretical analysis of the method is based only on some algebraic sequences and generalized eigenvalues of local (element-wise) problems. In the hierarchical basis framework, explicit recursion formulae are derived to compute the element matrices and the constant $gamma$ (which measures the quality of the space splitting) at any given level. It is proved that the proposed method is robust with respect to the problem parameters, and is of optimal order complexity. Supporting numerical results, including the case when the parameters have jumps, are also presented.
قيم البحث
اقرأ أيضاً
This paper presents the use of element-based algebraic multigrid (AMGe) hierarchies, implemented in the ParELAG (Parallel Element Agglomeration Algebraic Multigrid Upscaling and Solvers) library, to produce multilevel preconditioners and solvers for
H(curl) and H(div) formulations. ParELAG constructs hierarchies of compatible nested spaces, forming an exact de Rham sequence on each level. This allows the application of hybrid smoothers on all levels and AMS (Auxiliary-space Maxwell Solver) or ADS (Auxiliary-space Divergence Solver) on the coarsest levels, obtaining complete multigrid cycles. Numerical results are presented, showing the parallel performance of the proposed methods. As a part of the exposition, this paper demonstrates some of the capabilities of ParELAG and outlines some of the components and procedures within the library.
We present algebraic multilevel iteration (AMLI) methods for isogeometric discretization of scalar second order elliptic problems. The construction of coarse grid operators and hierarchical complementary operators are given. Moreover, for a uniform m
esh on a unit interval, the explicit representation of B-spline basis functions for a fixed mesh size $h$ is given for $p=2,3,4$ and for $C^{0}$- and $C^{p-1}$-continuity. The presented methods show $h$- and (almost) $p$-independent convergence rates. Supporting numerical results for convergence factor and iterations count for AMLI cycles ($V$-, linear $W$-, nonlinear $W$-) are provided. Numerical tests are performed, in two-dimensions on square domain and quarter annulus, and in three-dimensions on quarter thick ring.
Edge (or Nedelec) finite elements are theoretically sound and widely used by the computational electromagnetics community. However, its implementation, specially for high order methods, is not trivial, since it involves many technicalities that are n
ot properly described in the literature. To fill this gap, we provide a comprehensive description of a general implementation of edge elements of first kind within the scientific software project FEMPAR. We cover into detail how to implement arbitrary order (i.e., $p$-adaptive) elements on hexahedral and tetrahedral meshes. First, we set the three classical ingredients of the finite element definition by Ciarlet, both in the reference and the physical space: cell topologies, polynomial spaces and moments. With these ingredients, shape functions are automatically implemented by defining a judiciously chosen polynomial pre-basis that spans the local finite element space combined with a change of basis to automatically obtain a canonical basis with respect to the moments at hand. Next, we discuss global finite element spaces putting emphasis on the construction of global shape functions through oriented meshes, appropriate geometrical mappings, and equivalence classes of moments, in order to preserve the inter-element continuity of tangential components of the magnetic field. Finally, we extend the proposed methodology to generate global curl-conforming spaces on non-conforming hierarchically refined (i.e., $h$-adaptive) meshes with arbitrary order finite elements. Numerical results include experimental convergence rates to test the proposed implementation.
We present a class of discretisation spaces and H(div)-conformal elements that can be built on any polytope. Bridging the flexibility of the Virtual Element spaces towards the elements shape with the divergence properties of the Raviart-Thomas elemen
ts on the boundaries, the designed frameworks offer a wide range of H(div)-conformal discretisations. As those elements are set up through degrees of freedom, their definitions are easily amenable to the properties the approximated quantities are wished to fulfil. Furthermore, we show that one straightforward restriction of this general setting share its properties with the classical Raviart-Thomas elements at each interface, for any order and any polytopial shape. Then, we investigate the shape of the basis functions corresponding to particular elements in the two dimensional case.
For irrotational dust the shear tensor is consistently diagonalizable with its covariant time derivative: $sigma_{ab}=0=dot{sigma}_{ab},; a eq b$, if and only if the divergence of the magnetic part of the Weyl tensor vanishes: $div~H = 0$. We show he
re that in that case, the consistency of the Ricci constraints requires that the magnetic part of the Weyl tensor itself vanishes: $H_{ab}=0$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
