Papers › Comparable upper and lower bounds for boundary values of Neumann eigenfunctions and...
Comparable upper and lower bounds for boundary values of Neumann eigenfunctions and tight inclusion of eigenvalues
Alex Barnett, Andrew Hassell, Melissa Tacy
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
For smooth bounded domains in ℝ, we prove upper and lower L² bounds on the boundary data of Neumann eigenfunctions, and prove quasi-orthogonality of this boundary data in a spectral window. The bounds are tight in the sense that both are independent of eigenvalue; this is achieved by working with an appropriate norm for boundary functions, which includes a `spectral weight', that is, a function of the boundary Laplacian. This spectral weight is chosen to cancel concentration at the boundary that can happen for `whispering gallery' type eigenfunctions. These bounds are closely related to wave equation estimates due to Tataru. Using this, we bound the distance from an arbitrary Helmholtz parameter E>0 to the nearest Neumann eigenvalue, in terms of boundary normal-derivative data of a trial function u solving the Helmholtz equation (Δ-E)u=0. This `inclusion bound' improves over previously known bounds by a factor of E^(5/6). It is analogous to a recently improved inclusion bound in the Dirichlet case, due to the first two authors. Finally, we apply our theory to present an improved numerical implementation of the method of particular solutions for computation of Neumann eigenpairs on smooth planar domains. We show that the new inclusion bound improves the relative accuracy in a computed Neumann eigenvalue (around the $42000$th) from 9 digits to 14 digits, with little extra effort.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections