Steklov eigenvalues of curvilinear polygons are asymptotically equal to explicit quasi-eigenvalues built from side lengths and angles, with errors tending to zero.
Eigenvalue bounds of mixed Steklov problems
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We study bounds on the Riesz means of the mixed Steklov-Neumann and Steklov-Dirichlet eigenvalue problem on a bounded domain $\Omega$ in $\mathbb{R}^n$. The Steklov-Neumann eigenvalue problem is also called the sloshing problem. We obtain two-term asymptotically sharp lower bounds on the Riesz means of the sloshing problem and also provide an asymptotically sharp upper bound for the Riesz means of mixed Steklov-Dirichlet problem. The proof of our results for the sloshing problem uses the average variational principle and monotonicity of sloshing eigenvalues. In the case of Steklov-Dirichlet eigenvalue problem, the proof is based on a well-known bound on the Riesz means of the Dirichlet fractional Laplacian and an inequality between the Dirichlet and Navier fractional Laplacian. The two-term asymptotic results for the Riesz means of mixed Steklov eigenvalue problems are discussed in the appendix which in particular show the asymptotic sharpness of the bounds we obtain.
fields
math.SP 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Sloshing, Steklov and corners: Asymptotics of Steklov eigenvalues for curvilinear polygons
Steklov eigenvalues of curvilinear polygons are asymptotically equal to explicit quasi-eigenvalues built from side lengths and angles, with errors tending to zero.