REVIEW 1 cited by
Abelian-Higgs Cosmic String Evolution with CUDA
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Topological defects form at cosmological phase transitions by the Kibble mechanism, with cosmic strings and superstrings having the most interesting phenomenology. 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 essential. 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 continue this paradigm shift and discuss an analogous implementation for local Abelian-Higgs strings networks. We discuss the implementation algorithm (including the discretization 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.
Forward citations
Cited by 1 Pith paper
-
Scaling solutions for current-carrying cosmic string networks. II. Biased solutions
By relaxing the unbiased-loss assumption in the CVOS model, the paper finds new asymptotic scaling solutions for current-carrying cosmic strings, some of which have no unbiased analog.
Discussion (0). Continue with ORCID to comment.