Papers › Computing eigenvalues of the Laplacian on rough domains
Computing eigenvalues of the Laplacian on rough domains
Frank Rösler, Alexei Stepanenko
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.
We prove a general Mosco convergence theorem for bounded Euclidean domains satisfying a set of mild geometric hypotheses. For bounded domains, this notion implies norm-resolvent convergence for the Dirichlet Laplacian which in turn ensures spectral convergence. A key element of the proof is the development of a novel, explicit Poincar\'e-type inequality. These results allow us to construct a universal algorithm capable of computing the eigenvalues of the Dirichlet Laplacian on a wide class of rough domains. Many domains with fractal boundaries, such as the Koch snowflake and certain filled Julia sets, are included among this class. Conversely, we construct a counter example showing that there does not exist a universal algorithm of the same type capable of computing the eigenvalues of the Dirichlet Laplacian on an arbitrary bounded domain.
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