Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSloshing, Steklov and corners: Asymptotics of Steklov eigenvalues for curvilinear polygons
137
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We obtain asymptotic formulae for the Steklov eigenvalues and eigenfunctions of curvilinear polygons in terms of their side lengths and angles. These formulae are quite precise: the errors tend to zero as the spectral parameter tends to infinity. The Steklov problem on planar domains with corners is closely linked to the classical sloshing and sloping beach problems in hydrodynamics; as we show it is also related to quantum graphs. Somewhat surprisingly, the arithmetic properties of the angles of a curvilinear polygon have a significant effect on the boundary behaviour of the Steklov eigenfunctions. Our proofs are based on an explicit construction of quasimodes. We use a variety of methods, including ideas from spectral geometry, layer potential analysis, and some new techniques tailored to our problem.
rate research
Read More
In the present paper we develop an approach to obtain sharp spectral asymptotics for Steklov type problems on planar domains with corners. Our main focus is on the two-dimensional sloshing problem, which is a mixed Steklov-Neumann boundary value problem describing small vertical oscillations of an ideal fluid in a container or in a canal with a uniform cross-section. We prove a two-term asymptotic formula for sloshing eigenvalues. In particular, this confirms a conjecture posed by Fox and Kuttler in 1983. We also obtain similar eigenvalue asymptotics for other related mixed Steklov type problems, and discuss applications to the study of Steklov spectral asymptotics on polygons.
This paper studies the inverse Steklov spectral problem for curvilinear polygons. For generic curvilinear polygons with angles less than $pi$, we prove that the asymptotics of Steklov eigenvalues obtained in arXiv:1908.06455 determines, in a constructive manner, the number of vertices and the properly ordered sequence of side lengths, as well as the angles up to a certain equivalence relation. We also present counterexamples to this statement if the generic assumptions fail. In particular, we show that there exist non-isometric triangles with asymptotically close Steklov spectra. Among other techniques, we use a version of the Hadamard--Weierstrass factorisation theorem, allowing us to reconstruct a trigonometric function from the asymptotics of its roots.
In this paper, we study the bounds for discrete Steklov eigenvalues on trees via geometric quantities. For a finite tree, we prove sharp upper bounds for the first nonzero Steklov eigenvalue by the reciprocal of the size of the boundary and the diameter respectively. We also prove similar estimates for higher order Steklov eigenvalues.
We prove that the isoperimetric inequality due to Hersch-Payne-Schiffer for the n-th nonzero Steklov eigenvalue of a bounded simply-connected planar domain is sharp for all n=1,2,... The equality is attained in the limit by a sequence of simply-connected domains degenerating to the disjoint union of n identical disks. We give a new proof of this inequality for n=2 and show that it is strict in this case. Related results are also obtained for the product of two consecutive Steklov eigenvalues.
We introduce the Steklov flows on finite trees, i.e. the flows (or currents) associated with the Steklov problem. By constructing appropriate Steklov flows, we prove the monotonicity of the first nonzero Steklov eigenvalues on trees: for finite trees $g_1$ and $g_2,$ the first nonzero Steklov eigenvalue of $g_1$ is greater than or equal to that of $g_2$, provided that $g_1$ is a subgraph of $g_2.$
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
