arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1602.08636math.NAcs.NA
收藏

在多边形内计算拉普拉斯算子的超精确本征值

Computing ultra-precise eigenvalues of the Laplacian within polygons

Independent Researcher

Robert Jones

AI总结:

本文提出通过扩展Fox等人1967年方法,在多边形内计算拉普拉斯算子本征值,实现高精度计算,甚至达到千位精度,利用对称性简化几何并解决退化问题。

摘要:

在多边形内求解亥姆霍兹方程的主要困难源于非解析顶点。通过与Fox、Henrici和Moler 1967年论文几乎相同的方法,证明此类本征值计算可以扩展到前所未有的精度,通常超过百位,有时超过千位。发现增加特征函数展开项数时,近似本征值可能在精确本征值上下交替,从而提供新的本征值边界方法。必须利用对称性简化几何,减少非解析顶点并解开退化问题。此处考虑的对称简化多边形最多有一个非解析顶点,从该顶点可见所有边。每个多边形边独立施加狄利克雷、Neumann或周期型边界条件。完整形状包括正多边形和一些具有凹角的多边形(如切方、L形、五角星)。获得L形、正五边形和正六边形的最低狄利克雷本征值的千位结果。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑