Computing ultra-precise eigenvalues of the Laplacian within polygons
From MaRDI portal
Abstract: The main difficulty in solving the Helmholtz equation within polygons is due to non-analytic vertices. 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, very often to well over a hundred digits, and sometimes to over a thousand digits. A curious observation is that as one increases the number of terms in the eigenfunction expansion, the approximate eigenvalue may be made to alternate above and below the exact eigenvalue. This alternation provides a new method to bound eigenvalues, by inspection. Symmetry must be exploited to simplify the geometry, reduce the number of non-analytic vertices and disentangle degeneracies. The symmetry-reduced polygons considered here have at most one non-analytic vertex from which all edges can be seen. Dirichlet, Neumann, and periodic-type edge conditions, are independently imposed on each polygon edge. The full shapes include the regular polygons and some with re-entrant angles (cut-square, L-shape, 5-point star). Thousand-digit results are obtained for the lowest Dirichlet eigenvalue of the L-shape, and regular pentagon and hexagon.
Recommendations
- Eigenvalues of the Laplacian on regular polygons and polygons resulting from their dissection
- Computing experiments in the problem on eigenvalues for the operator of Laplace in the polygonal domain
- Reviving the Method of Particular Solutions
- High-precision eigenvalue bound for the Laplacian with singularities
- Verified eigenvalue evaluation for the Laplacian over polygonal domains of arbitrary shape
Cites work
- An exponentially convergent nonpolynomial finite element method for time-harmonic scattering from polygons
- Approximations and Bounds for Eigenvalues of Elliptic Operators
- Bounds for Eigenvalues and Eigenvectors of Symmetric Operators
- Bounds to eigenvalues of the Laplacian on L-shaped domain by variational methods
- Computed eigenmodes of planar regions
- Cutoff Wavenumbers and Modes of Hexagonal Waveguides
- Eigenvalue Characterization and Computation for the Laplacian on General 2-D Domains
- Eigenvalues of the Laplacian in Two Dimensions
- Eigenvalues of the Laplacian on regular polygons and polygons resulting from their dissection
- Erweiterte Symmetrieeigenschaften von Lösungen gewisser linearer Rand- und Eigenwertprobleme.
- Fast computation of high-frequency Dirichlet eigenmodes via spectral flow of the interior Neumann-to-Dirichlet map
- Generic spectral simplicity of polygons
- High order eigenvalues for the Helmholtz equation in complicated non-tensor domains through Richardson extrapolation of second order finite differences
- Reviving the Method of Particular Solutions
- The Bending, Buckling, and Flexural Vibration of Simply Supported Polygonal Plates by Point-Matching
- The Laplacian eigenvalues of a polygon
- The On-Line Encyclopedia of Integer Sequences
Cited in
(22)- Computing experiments in the problem on eigenvalues for the operator of Laplace in the polygonal domain
- The Laplacian eigenvalues of a polygon
- On Courant’s Nodal Domain Property for Linear Combinations of Eigenfunctions Part II
- Can we compute Laplace eigenvalues well, like computing \(\pi\)?
- Efficient spectral and spectral element methods for eigenvalue problems of Schrödinger equations with an inverse square potential
- High-accuracy calculation of eigenvalues of the Laplacian in an ellipse (with Neumann boundary condition)
- Verified eigenvalue evaluation for the Laplacian over polygonal domains of arbitrary shape
- Spectral bounds of the difference Laplace operator in non-rectangular regions
- On the honeycomb conjecture for a class of minimal convex partitions
- On accuracy of approximate boundary and distributed \(H^1\) shape gradient flows for eigenvalue optimization
- Computation of Laplacian eigenvalues of two-dimensional shapes with dihedral symmetry
- An unstructured spectral element method for the Laplace eigenvalue problem on regular polygons
- Computing the solutions of the van der Pol equation to arbitrary precision
- High-precision eigenvalue bound for the Laplacian with singularities
- A counterexample to Payne's nodal line conjecture with few holes
- Reviving the Method of Particular Solutions
- Computation of tight enclosures for Laplacian eigenvalues
- A meshless Chebyshev collocation method for eigenvalue problems of the Helmholtz equation
- Laplace eigenvalues on regular polygons: a series in \(1/N\)
- On the polygonal Faber-Krahn inequality
- Computations of Eigenvalue Avoidance in Planar Domains
- Eigenvalues of the Laplacian on regular polygons and polygons resulting from their dissection
This page was built for publication: Computing ultra-precise eigenvalues of the Laplacian within polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1693585)
