arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1609.08523math.NAcs.NA
收藏

一种用于振荡晶格求和的快速求和方法

A Fast Summation Method for Oscillatory Lattice Sums

Courant Institute of Mathematical Sciences, New York University(纽约大学柯朗数学科学研究所);National Institute of Standards and Technology(美国国家标准与技术研究院);Yale University(耶鲁大学)

Ryan Denlinger, Zydrunas Gimbutas, Leslie Greengard, Vladimir Rokhlin

AI总结:

本文提出了一种快速求和方法,用于求解具有周期边界条件的波散射问题中的晶格求和。该方法通过欧拉-麦克劳林公式和最陡下降论证,实现超代数收敛,仅需毫秒级CPU时间。

摘要:

我们提出了一种快速求和方法,用于求解在具有周期边界条件的波散射问题中出现的晶格求和类型。尽管文献中已有多种有效的算法用于此类计算,但本文的方法是新的,并导致对伍德异常的严格分析。这些异常出现在特定入射角和波频组合下,当照射光栅时,晶格求和发散。伍德于1902年发现这些异常作为频谱响应中的奇点。我们方法的主要工具是欧拉-麦克劳林公式和最陡下降论证。所得到的算法具有超代数收敛性,并且仅需要毫秒级的CPU时间。

英文摘要:

We present a fast summation method for lattice sums of the type which arise when solving wave scattering problems with periodic boundary conditions. While there are a variety of effective algorithms in the literature for such calculations, the approach presented here is new and leads to a rigorous analysis of Wood's anomalies. These arise when illuminating a grating at specific combinations of the angle of incidence and the frequency of the wave, for which the lattice sums diverge. They were discovered by Wood in 1902 as singularities in the spectral response. The primary tools in our approach are the Euler-Maclaurin formula and a steepest descent argument. The resulting algorithm has super-algebraic convergence and requires only milliseconds of CPU time.

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

↑