arXiv 2001.028352020-01-09hep-lat

扭曲Eguchi-Kawai模型的高阶数值随机扰动计算

Towards higher order numerical stochastic perturbation computation applied to the twisted Eguchi-Kawai model

Antonio González-Arroyo, Issaku Kanamori, Ken-Ichi Ishikawa, Kanata Miyahana, Masanori Okawa, Ryoichiro Ueno

备注：: 7 pages, 6 figures, talk presented at the 37th International Symposium on Lattice Field Theory (Lattice 2019), 16-22 June 2019, Wuhan, China

摘要：

在arXiv：1902.09847中，我们利用数值随机扰动理论（NSPT）计算了四维扭曲Eguchi-Kawai模型的威尔逊圈到$O(g^8)$的扰动系数.在这次演讲中，我们提出了一个进展报告的高阶计算高达$O(g^{63})$，为此，我们应用快速傅立叶变换（FFT）为基础的卷积算法的多项式矩阵的乘法在NSPT的目的是高阶计算。我们比较了基于FFT的卷积算法的仅CPU版本和GPU版本的两种实现，并发现在$O(g^{31})$上使用SU（$N=225$）的NSPT算法的计算速度提高了9倍。的扰动阶依赖的计算时间，我们调查它到$O(g^{63})$，显示出一个温和的标度行为的截断阶。

英文摘要：

We have evaluated perturbation coefficients of Wilson loops up to $O(g^8)$ for the four-dimensional twisted Eguchi-Kawai model using the numerical stochastic perturbation theory (NSPT) in arXiv:1902.09847. In this talk we present a progress report on the higher order calculation up to $O(g^{63})$, for which we apply a fast Fourier transformation (FFT) based convolution algorithm to the multiplication of polynomial matrices in the NSPT aiming for higher order calculation. We compare two implementations with the CPU-only version and the GPU version of the FFT based convolution algorithm, and find a factor 9 improvement on the computational speed of the NSPT algorithm with SU($N=225$) at $O(g^{31})$. The perturbation order dependence of the computational time, we investigate it up to $O(g^{63})$, shows a mild scaling behavior on the truncation order.

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

摘要：

英文摘要：

相关论文