Accurate Computation of Laplace Eigenvalues by an Analytical Level Set Method
Pavel Grinfeld

TL;DR
This paper introduces an analytical level set method for highly accurate computation of Laplace eigenvalues on smooth domains by representing eigenfunctions as linear combinations of Bessel functions and adjusting parameters to fit the domain boundary.
Contribution
The paper presents a novel analytical level set approach that achieves high-precision Laplace eigenvalue computations for smooth domains, especially effective for domains like ellipses.
Findings
Coefficients decay exponentially for certain domains
Method achieves arbitrarily high accuracy for some shapes
Effective for smooth domains with modest eccentricity
Abstract
This purpose of this write-up is to share an idea for accurate computation of Laplace eigenvalues on a broad class of smooth domains. We represent the eigenfunction as a linear combination of eigenfunctions corresponding to the common eigenvalue :\EQN{6}{1}{}{0}{\RD{\CELL{u(r,\theta) =\sum_{n=0}^{N}P_{n}J_{n}(\rho) \cos n\theta,}}{1}{}{}{}}We adjust the coefficients and the parameter so that the zero level set of approximates the domain of interest. For some domains, such as ellipses of modest eccentricity, the coefficients decay exponentially and the proposed method can be used to compute eigenvalues with arbitrarily high accuracy.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsProbabilistic and Robust Engineering Design · Advanced Numerical Analysis Techniques · Computer Graphics and Visualization Techniques
