Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 71 tok/s
Gemini 2.5 Pro 52 tok/s Pro
GPT-5 Medium 18 tok/s Pro
GPT-5 High 15 tok/s Pro
GPT-4o 101 tok/s Pro
Kimi K2 196 tok/s Pro
GPT OSS 120B 467 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

The $\texttt{Abacus}$ Cosmological $N$-body Code (2110.11392v1)

Published 21 Oct 2021 in astro-ph.CO

Abstract: We present $\texttt{Abacus}$, a fast and accurate cosmological $N$-body code based on a new method for calculating the gravitational potential from a static multipole mesh. The method analytically separates the near- and far-field forces, reducing the former to direct $1/r2$ summation and the latter to a discrete convolution over multipoles. The method achieves 70 million particle updates per second per node of the Summit supercomputer, while maintaining a median fractional force error of $10{-5}$. We express the simulation time step as an event-driven "pipeline", incorporating asynchronous events such as completion of co-processor work, Input/Output, and network communication. $\texttt{Abacus}$ has been used to produce the largest suite of $N$-body simulations to date, the $\texttt{AbacusSummit}$ suite of 60 trillion particles (Maksimova et al., 2021), incorporating on-the-fly halo finding. $\texttt{Abacus}$ enables the production of mock catalogs of the volume and resolution required by the coming generation of cosmological surveys.

Citations (46)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.