z-logo
open-access-imgOpen Access
Convergence and scatter of cluster density profiles
Author(s) -
Diemand Jürg,
Moore Ben,
Stadel Joachim
Publication year - 2004
Publication title -
monthly notices of the royal astronomical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.058
H-Index - 383
eISSN - 1365-2966
pISSN - 0035-8711
DOI - 10.1111/j.1365-2966.2004.08094.x
Subject(s) - physics , radius , resolution (logic) , radius of convergence , cluster (spacecraft) , virial theorem , convergence (economics) , logarithm , asymptote , cusp (singularity) , series (stratigraphy) , astrophysics , function (biology) , high resolution , computational physics , geometry , mathematical analysis , mathematics , paleontology , computer security , remote sensing , artificial intelligence , evolutionary biology , galaxy , geology , computer science , economics , biology , programming language , economic growth , power series
We present new results from a series of ΛCDM simulations of cluster mass haloes resolved with high force and mass resolution. These results are compared with recently published simulations from groups using various codes including pkdgrav , art , tpm , grape and gadget . Careful resolution tests show that with 25 million particles within the high‐resolution region we can resolve to about 0.3 per cent of the virial radius and that convergence in radius is proportional to the mean interparticle separation. The density profiles of 26 high‐resolution clusters obtained with the different codes and from different initial conditions agree very well. The average logarithmic slope at one per cent of the virial radius is γ= 1.26 with a scatter of ±0.17 . Over the entire resolved regions the density profiles are well fitted by a smooth function that asymptotes to a central cusp ρ∝ r −γ , where we find γ= 1.16 ± 0.14 from the mean of the fits to our six highest‐resolution clusters.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here