ترغب بنشر مسار تعليمي؟ اضغط هنا

Convergence and optimality of higher-order adaptive finite element methods for eigenvalue clusters

116   0   0.0 ( 0 )
 نشر من قبل Andrea Bonito
 تاريخ النشر 2015
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

Proofs of convergence of adaptive finite element methods for the approximation of eigenvalues and eigenfunctions of linear elliptic problems have been given in a several recent papers. A key step in establishing such results for multiple and clustered eigenvalues was provided by Dai et. al. (2014), who proved convergence and optimality of AFEM for eigenvalues of multiplicity greater than one. There it was shown that a theoretical (non-computable) error estimator for which standard convergence proofs apply is equivalent to a standard computable estimator on sufficiently fine grids. Gallistl (2015) used a similar tool in order to prove that a standard adaptive FEM for controlling eigenvalue clusters for the Laplacian using continuous piecewise linear finite element spaces converges with optimal rate. When considering either higher-order finite element spaces or non-constant diffusion coefficients, however, the arguments of Dai et. al. and Gallistl do not yield equivalence of the practical and theoretical estimators for clustered eigenvalues. In this note we provide this missing key step, thus showing that standard adaptive FEM for clustered eigenvalues employing elements of arbitrary polynomial degree converge with optimal rate. We additionally establish that a key user-defined input parameter in the AFEM, the bulk marking parameter, may be chosen entirely independently of the properties of the target eigenvalue cluster. All of these results assume a fineness condition on the initial mesh in order to ensure that the nonlinearity is sufficiently resolved.



قيم البحث

اقرأ أيضاً

50 - Alan Demlow 2016
Numerical computation of harmonic forms (typically called harmonic fields in three space dimensions) arises in various areas, including computer graphics and computational electromagnetics. The finite element exterior calculus framework also relies e xtensively on accurate computation of harmonic forms. In this work we study the convergence properties of adaptive finite element methods (AFEM) for computing harmonic forms. We show that a properly defined AFEM is contractive and achieves optimal convergence rate beginning from any initial conforming mesh. This result is contrasted with related AFEM convergence results for elliptic eigenvalue problems, where the initial mesh must be sufficiently fine in order for AFEM to achieve any provable convergence rate.
148 - H. Chen , X. Gong , L. He 2010
In this paper, we study an adaptive finite element method for a class of a nonlinear eigenvalue problems that may be of nonconvex energy functional and consider its applications to quantum chemistry. We prove the convergence of adaptive finite elemen t approximations and present several numerical examples of micro-structure of matter calculations that support our theory.
In this paper, we study arbitrary order extended finite element (XFE) methods based on two discontinuous Galerkin (DG) schemes in order to solve elliptic interface problems in two and three dimensions. Optimal error estimates in the piecewise $H^1$-n orm and in the $L^2$-norm are rigorously proved for both schemes. In particular, we have devised a new parameter-friendly DG-XFEM method, which means that no sufficiently large parameters are needed to ensure the optimal convergence of the scheme. To prove the stability of bilinear forms, we derive non-standard trace and inverse inequalities for high-order polynomials on curved sub-elements divided by the interface. All the estimates are independent of the location of the interface relative to the meshes. Numerical examples are given to support the theoretical results.
We consider a standard elliptic partial differential equation and propose a geometric multigrid algorithm based on Dirichlet-to-Neumann (DtN) maps for hybridized high-order finite element methods. The proposed unified approach is applicable to any lo cally conservative hybridized finite element method including multinumerics with different hybridized methods in different parts of the domain. For these methods, the linear system involves only the unknowns residing on the mesh skeleton, and constructing intergrid transfer operators is therefore not trivial. The key to our geometric multigrid algorithm is the physics-based energy-preserving intergrid transfer operators which depend only on the fine scale DtN maps. Thanks to these operators, we completely avoid upscaling of parameters and no information regarding subgrid physics is explicitly required on coarse meshes. Moreover, our algorithm is agglomeration-based and can straightforwardly handle unstructured meshes. We perform extensive numerical studies with hybridized mixed methods, hybridized discontinuous Galerkin method, weak Galerkin method, and a hybridized version of interior penalty discontinuous Galerkin methods on a range of elliptic problems including subsurface flow through highly heterogeneous porous media. We compare the performance of different smoothers and analyze the effect of stabilization parameters on the scalability of the multigrid algorithm.
145 - Zhiming Chen , Ke Li , 2020
We design an adaptive unfitted finite element method on the Cartesian mesh with hanging nodes. We derive an hp-reliable and efficient residual type a posteriori error estimate on K-meshes. A key ingredient is a novel hp-domain inverse estimate which allows us to prove the stability of the finite element method under practical interface resolving mesh conditions and also prove the lower bound of the hp a posteriori error estimate. Numerical examples are included.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا