Adaptive hybrid high-order method for guaranteed lower eigenvalue bounds

From MaRDI portal





This paper is dedicated to a new hybrid high-order (HHO) eigensolver to directly compute guaranteed lower eigenvalue bounds (GLB) for the Laplacian. The work is organized as follows. Section 1 is an Introduction. Stability constants and estimates, numerical comparison, and conjecture are given in Section 2. In Section 3, the modified HHO method and the discrete eigenvalue problem are introduced. Triangulation, discrete spaces, and HHO methodology are provided there too. Lower eigenvalue bounds are established in Section 4. A priori error analysis and a posteriori error analysis are presented in Sections 5 and 6, respectively. Section 7 is dedicated to numerical examples. Three numerical benchmarks for the approximation of Dirichlet eigenvalues of the Laplacian on nonconvex domains are presented. The algebraic eigenvalue problem is realized with the iterative solver \texttt{eigs} from the MATLAB standard library. L-shaped domain, isospectral domain, and Dumbbell-slit domain variants are considered. Some conclusions are also given. Finally, an Appendix provides details of the proof of the main theorem of the paper.



Cites work









This page was built for publication: Adaptive hybrid high-order method for guaranteed lower eigenvalue bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562905)