2000 character limit reached
DPG approximation of eigenvalue problems
Published 11 Dec 2020 in math.NA and cs.NA | (2012.06623v1)
Abstract: In this paper, the discontinuous Petrov--Galerkin approximation of the Laplace eigenvalue problem is discussed. We consider in particular the primal and ultra weak formulations of the problem and prove the convergence together with a priori error estimates. Moreover, we propose two possible error estimators and perform the corresponding a posteriori error analysis. The theoretical results are confirmed numerically and it is shown that the error estimators can be used to design an optimally convergent adaptive scheme.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.