arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.03076math.NAcs.NAphysics.comp-ph
收藏

利用渐近展开和快速傅里叶变换计算屏蔽泊松晶格格林函数的快速鲁棒方法

Fast and robust method for screened Poisson lattice Green's function using asymptotic expansion and Fast Fourier Transform

Wei Hou, Tim Colonius

AI总结:

针对二维矩形晶格屏蔽泊松方程的LGF,本文结合大系数下指数收敛渐近展开与小系数下基于FFT的一维积分梯形求积,提出快速鲁棒求值算法。

摘要:

我们研究二维矩形晶格上屏蔽泊松方程的晶格格林函数(LGF)。该LGF出现在数值分析、随机游走、固态物理及其他领域。其定义特征是屏蔽项,该项界定了不同的机制区域。当其系数较大时,我们可以用指数收敛的渐近展开精确逼近LGF,且其收敛速率随屏蔽项系数单调增加。为在系数不大时制表LGF,我们推导了LGF的一维积分表示。我们证明梯形法则能够以指数收敛逼近该积分,并提出通过快速傅里叶变换对其求值的高效算法。我们讨论了相关应用,包括计算具有一个周期方向的三维泊松方程的LGF,以及二维带杀灭随机游走的返回概率。

英文摘要:

We study the lattice Green's function (LGF) of the screened Poisson equation on a two-dimensional rectangular lattice. This LGF arises in numerical analysis, random walks, solid-state physics, and other fields. Its defining characteristic is the screening term, which defines different regimes. When its coefficient is large, we can accurately approximate the LGF with an exponentially converging asymptotic expansion, and its convergence rate monotonically increases with the coefficient of the screening term. To tabulate the LGF when the coefficient is not large, we derive a one-dimensional integral representation of the LGF. We show that the trapezoidal rule can approximate this integral with exponential convergence, and we propose an efficient algorithm for its evaluation via the Fast Fourier Transform. We discuss applications including computing the LGF of the three-dimensional Poisson equation with one periodic direction and the return probability of a two-dimensional random walk with killing.

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

↑