J. R. C. C. C. Correia, C. J. A. P. Martins
Abstract
Topological defects form at cosmological phase transitions by the Kibble mechanism, with cosmic strings—one-dimensional defects—being the most studied example. A rigorous analysis of their astrophysical consequences is limited by the availability of accurate numerical simulations, and therefore by hardware resources and computation time. Improving the speed and efficiency of existing codes is therefore important. All current cosmic string simulations were performed on Central Processing Units. In previous work we presented a General Purpose Graphics Processing Unit implementation of the evolution of cosmological domain wall networks. Here we discuss an analogous implementation for local Abelian-Higgs string networks. We discuss the implementation algorithm (including the discretisation used and how to calculate network averaged quantities) and then showcase its performance and current bottlenecks. We validate the code by directly comparing our results for the canonical scaling properties of the networks in the radiation and matter eras with those in the literature, finding very good agreement. We finally highlight possible directions for improving the scalability of the code.
Keywords
Cosmology: topological defects; Field theory simulations; Cosmic string networks; Methods: numerical; Methods: GPU computing; Physics - Computational Physics; Astrophysics - Cosmology and Nongalactic Astrophysics; General Relativity and Quantum Cosmology;
Astronomy and Computing
Volume 32
2020 July
