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

09/27/2022
by   Ryoki Endo, et al.
0

A computer-assisted proof is proposed for the Laplacian eigenvalue minimization problems over triangular domains under diameter constraints. The proof utilizes recently developed guaranteed computation methods for both eigenvalues and eigenfunctions of differential operators. The paper also provides an elementary and concise proof of the Hadamard shape derivative, which helps to validate the monotonicity of eigenvalue with respect to shape parameters. 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/23/2022

Eigenvalue bounds of the Kirchhoff Laplacian

We prove that each eigenvalue l(k) of the Kirchhoff Laplacian K of a gra...
research
03/18/2020

Computation of Tight Enclosures for Laplacian Eigenvalues

Recently, there has been interest in high-precision approximations of th...
research
06/27/2022

A homogeneous Rayleigh quotient with applications in gradient methods

Given an approximate eigenvector, its (standard) Rayleigh quotient and h...
research
05/23/2022

On trajectories of complex-valued interior transmission eigenvalues

This paper investigates properties of complex-valued eigenvalue trajecto...
research
06/18/2020

PU-CPI solution of Laplacian eigenvalue problems

The purpose of this article is to approximately compute the eigenvalues ...
research
12/20/2022

On the computation of analytic sensitivities of eigenpairs in isogeometric analysis

The eigenmodes of resonating structures, e.g., electromagnetic cavities,...
research
11/24/2021

A global quadratic speed-up for computing the principal eigenvalue of Perron-like operators

We consider a new algorithm in light of the min-max Collatz-Wielandt for...

Please sign up or login with your details

Forgot password? Click here to reset