Asymptotic behaviour and numerical approximation of optimal eigenvalues of the Robin Laplacian

Mathematics – Spectral Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We consider the problem of minimising the $n^{th}-$eigenvalue of the Robin Laplacian in $\mathbb{R}^{N}$. Although for $n=1,2$ and a positive boundary parameter $\alpha$ it is known that the minimisers do not depend on $\alpha$, we demonstrate numerically that this will not always be the case and illustrate how the optimiser will depend on $\alpha$. We derive a Wolf-Keller type result for this problem and show that optimal eigenvalues grow at most with $n^{1/N}$, which is in sharp contrast with the Weyl asymptotics for a fixed domain. We further show that the gap between consecutive eigenvalues does go to zero as $n$ goes to infinity. Numerical results then support the conjecture that for each $n$ there exists a positive value of $\alpha_{n}$ such that the $n^{\rm th}$ eigenvalue is minimised by $n$ disks for all $0<\alpha<\alpha_{n}$ and, combined with analytic estimates, that this value is expected to grow with $n^{1/N}$.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Asymptotic behaviour and numerical approximation of optimal eigenvalues of the Robin Laplacian does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Asymptotic behaviour and numerical approximation of optimal eigenvalues of the Robin Laplacian, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotic behaviour and numerical approximation of optimal eigenvalues of the Robin Laplacian will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-354885

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.