Computing ultra-precise eigenvalues of the Laplacian within polygons

Abstract

The classic eigenvalue problem of the Laplace operator inside a variety of polygons is numerically solved by using a method nearly identical to that used by Fox, Henrici, and Moler in their 1967 paper. It is demonstrated that such eigenvalue calculations can be extended to unprecedented precision, often to well over a hundred digits, or even thousands of digits. To work well, geometric symmetry must be exploited. The de-symmetrized fundamental domains (usually triangular) considered here have at most one non-analytic vertex. Dirichlet, Neumann, and periodic-type edge conditions are independently imposed on each symmetry-reduced polygon edge. The method of particular solutions is used whereby an eigenfunction is expanded in an N-term Fourier-Bessel series about the non-analytic vertex and made to match at a set of N points on the boundary. Under the right conditions, the so-called point-matching determinant has roots that approximate eigenvalues. A key observation is that by increasing the number of terms in the expansion, the approximate eigenvalue may be made to alternate above and below, while approaching what is presumed to be the exact eigenvalue. This alternation effectively provides a new method to bound eigenvalues, by inspection. Specific examples include Dirichlet and Neumann eigenvalues within polygons with re-entrant angles (L-shape, cut-square, 5-point star) and the regular polygons. Thousand-digit results are reported for the lowest Dirichlet eigenvalues of the L-shape, and regular pentagon and hexagon.