Computing the lower and upper bounds of Laplace eigenvalue problem: by combining conforming and nonconforming finite element methods

Abstract

This article is devoted to computing the lower and upper bounds of the Laplace eigenvalue problem. By using the special nonconforming finite elements, i.e., enriched Crouzeix-Raviart element and extension $Q_1^{\mathrm{rot}}$, we get the lower bound of the eigenvalue. Additionally, we also use conforming finite elements to do the postprocessing to get the upper bound of the eigenvalue. The postprocessing method need only to solve the corresponding source problems and a small eigenvalue problem if higher order postprocessing method is implemented. Thus, we can obtain the lower and upper bounds of the eigenvalues simultaneously by solving eigenvalue problem only once. Some numerical results are also presented to validate our theoretical analysis.

19 pages, 4 figures

Cited by in corpus (5)

• Two-sided bounds for eigenvalues of differential operators with applications to Friedrichs', Poincaré, trace, and similar constants
• Sign-preserving of principal eigenfunctions in P1 finite element approximation of eigenvalue problems of second-order elliptic operators
• Adaptive finite element approximations of the first eigenpair associated with $p$-Laplacian
• Lower eigenvalue bounds with hybrid high-order methods
• Fully guaranteed and computable error bounds on the energy for periodic Kohn-Sham equations with convex density functionals