2012
DOI: 10.1016/j.apnum.2012.01.005
|View full text |Cite
|
Sign up to set email alerts
|

A posteriori error estimates for non-conforming approximation of eigenvalue problems

Abstract: Abstract. We consider the approximation of eigenvalue problem for the laplacian by the Crouzeix-Raviart non conforming finite elements in two and three dimensions.Extending known techniques for source problems, we introduce a posteriori error estimators for eigenvectors and eigenvalues. We prove that the error estimator is equivalent to the energy norm of the eigenvector error up to higher order terms. Moreover, we prove that our estimator provides an upper bound for the error in the approximation of the first… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
28
0
3

Year Published

2014
2014
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 21 publications
(31 citation statements)
references
References 11 publications
0
28
0
3
Order By: Relevance
“…To any element vVhnc, we associate an element truev~Vhc obtained by averaging the value of v at the vertices of the triangulation scriptTh. Namely, following , for each internal vertex , we consider all elements KiscriptTh for i=1,,M which share the vertex P and define truev~(P)=i=1Mwiv|Ki(P), where w i are suitable weights such that i=1Mwi=1. Lemma The following estimates hold true with constants C independent of h v~0Cv0v~0Chv0v~v0Chh(v~v)0. Proof Let be a vertex of the mesh.…”
Section: Error Estimates For the Eigenfunctionsmentioning
confidence: 85%
See 1 more Smart Citation
“…To any element vVhnc, we associate an element truev~Vhc obtained by averaging the value of v at the vertices of the triangulation scriptTh. Namely, following , for each internal vertex , we consider all elements KiscriptTh for i=1,,M which share the vertex P and define truev~(P)=i=1Mwiv|Ki(P), where w i are suitable weights such that i=1Mwi=1. Lemma The following estimates hold true with constants C independent of h v~0Cv0v~0Chv0v~v0Chh(v~v)0. Proof Let be a vertex of the mesh.…”
Section: Error Estimates For the Eigenfunctionsmentioning
confidence: 85%
“…In Section 3, we study the error estimates for the eigenfunctions, and, recalling the results of , we show that the results extend in a natural way to the case of multiple eigenvalues. In Section 4, using some special tools adapted from , we extend the estimates for the eigenvalues to the general case of multiplicity q ≥1.…”
Section: Introductionmentioning
confidence: 99%
“…Let, for any subset K ⊆ T, For simple eigenvalues this type of error estimator was introduced in [29]. The adaptive algorithm is driven by this computable error estimator and runs the following loop.…”
Section: Adaptive Algorithm and Contraction Propertymentioning
confidence: 99%
“…Up to now, a lot of studies of (1) have been devoted to the finite element methods (FEMs for short). For example, [1,2,5,6] estimated the lower and upper bounds for the eigenvalues; [7,9,10] derived asymptotic expansions and extrapolations for the eigenvalues; [13] discussed a posteriori error estimates by utilizing a nonconforming element; [15][16][17][18][19] developed the adaptive and two-grid FEMs, respectively.…”
Section: Introductionmentioning
confidence: 99%
“…Eigenvalue problems play a very important role in mathematical physics and engineering technology, which have gradually gained more and more scholars' attention [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19]. Up to now, a lot of studies of (1) have been devoted to the finite element methods (FEMs for short).…”
Section: Introductionmentioning
confidence: 99%