Shape optimization for the Laplacian eigenvalue over triangles and its application to interpolation error analysis

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A computer-assisted proof is proposed for the Laplacian eigenvalue minimization problems over triangular domains under diameter constraints. The paper provides an elementary analysis to derive the Hadamard shape derivative formula for complicated problem settings that allow non-homogeneous Neumann boundary conditions. Moreover, an algorithm to rigorously evaluate the Hadamard formula is proposed by utilizing the guaranteed computation for both eigenvalues and eigenfunctions of differential operators, which is recently developed by the second author. Besides the model homogeneous Dirichlet eigenvalue problem, the eigenvalue problem associated with a non-homogeneous Neumann boundary condition, which is related to the Crouzeix–Raviart interpolation error constant, is considered. The computer-assisted proof tells that among the triangles with the unit diameter, the equilateral triangle minimizes the first eigenvalue for each concerned eigenvalue problem.

Cite

CITATION STYLE

APA

Endo, R., & Liu, X. (2023). Shape optimization for the Laplacian eigenvalue over triangles and its application to interpolation error analysis. Journal of Differential Equations, 376, 750–772. https://doi.org/10.1016/j.jde.2023.09.016

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free