arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1805.04463gr-qcastro-ph.COphysics.comp-ph
收藏

量子引力和宇宙学的高性能算法

High Performance Algorithms for Quantum Gravity and Cosmology

William J. Cunningham

摘要:

大规模的数值实验在今天的理论物理中是司空见惯的。本文描述的高性能算法是已知的用于表示和分析通过集合或图形很好地建模的系统的最紧凑、最有效的方法。在研究了这些实现如何最大化指令吞吐量和优化内存访问模式后,我们将它们应用于因果集量子引力,其中时空由偏序集表示。我们建立在低水平集和图形算法,以优化因果集作用的计算,然后讨论如何测量离散时空的边界。然后,我们研究这些算法的更广泛的适用性,以贪婪的信息路由随机几何图形嵌入洛伦兹流形,这需要我们找到新的封闭形式的解决方案,在Friedmann-Lemaitre-Robertson-Walker时空的测地线微分方程。最后,我们考虑真空选择问题,在弦论,我们表明一个网络为中心的方法产生的真空选择的动力学机制,在多元宇宙学的背景下。这些算法对许多物理系统具有广泛的适用性,并且它们通过将仿真运行时间减少几个数量级来改进现有方法。

英文摘要:

Large scale numerical experiments are commonplace today in theoretical physics. The high performance algorithms described herein are the most compact, efficient methods known for representing and analyzing systems modeled well by sets or graphs. After studying how these implementations maximize instruction throughput and optimize memory access patterns, we apply them to causal set quantum gravity, in which spacetime is represented by a partially ordered set. We build upon the low-level set and graph algorithms to optimize the calculation of the causal set action, and then discuss how to measure boundaries of a discrete spacetime. We then examine the broader applicability of these algorithms to greedy information routing in random geometric graphs embedded in Lorentzian manifolds, which requires us to find new closed-form solutions to the geodesic differential equations in Friedmann-Lemaitre-Robertson-Walker spacetimes. Finally, we consider the vacuum selection problem in string theory, where we show a network-centered approach yields a dynamical mechanism for vacuum selection in the context of multiverse cosmology. These algorithms have broad applicability to many physical systems, and they improve existing methods by reducing simulation runtimes by orders of magnitude.

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

↑