A New Halo Finding Method for N-body Simulations
نویسنده
چکیده
We have developed a new halo finding method, Physically Self-Bound (PSB) group finding algorithm, which can efficiently identify halos located even at crowded regions. This method combines two physical criteria such as the tidal radius of a halo and the total energy of each particle to find member particles. No subtle dependence of halo mass functions on various parameters of the PSB method has been found. Two hierarchical meshes are used to increase the speed and the power of halo identification in the parallel computing environments. First, a coarse mesh with cell size equal to the mean particle separation lmean is used to obtain the density field over the whole simulation box. Mesh cells having density contrast higher than a local cutoff threshold δLOC are extracted and linked together for those adjacent to each other. This produces local-cell groups. We analyze the group of particles located at each local-cell group region separately. This treatment makes the halo finding method easily implemented on the parallel computing environments since each computational rank takes the halo identification job in each particle group independently. Second, a finer mesh is used to obtain density field within each local-cell group and to identify halos. We set the cell size of the refined mesh to be twice the gravitational force softening length ǫ. The density peaks in the fine mesh are the halo candidates. Based on the fine mesh, we split particles into many groups located in the density shells with different density levels. If a density shell contains only one density peak, its particles are assigned to the density peak. But in the case of a density shell surrounding at least two density peaks, we use both the tidal radii of halo candidates enclosed by the shell and the total energy criterion to find physically bound particles with respect to each halo. We have tested the PSB using a binary halo model against other popular halo finding methods, such as the Friend-of-Friend (FoF), Spherical Overdensity (SO), DENMAX, and HOP. Similar to DENMAX and HOP, the PSB method can efficiently identify small halos embedded in a large halo, while the FoF and the SO do not resolve such small halos. We apply our new halo finding method to a 1Giga particle simulation of the ΛCDM model and compare the resulting mass function with those of previous studies. The abundance of physically self-bound halos is larger at the low mass scale and smaller at the high mass scale than proposed by the Jenkins et al. (2001) who used the FoF and SO methods. Subject headings: Cosmology: N-body simulation: halo : halo-finding methods: Numerical
منابع مشابه
Halo World : Tools for Parallel Cluster Finding inAstrophysical N - body
Cosmological N-body simulations on parallel computers produce large datasets | gigabytes at each instant of simulated cosmological time, and hundreds of gigabytes over the course of a simulation. These large datasets require further analysis before they can be compared to astronomical observations. The \Halo World" tools include two methods for performing halo nding: identifying all of the grav...
متن کاملNon-Gaussian Halo Bias Re-examined: Mass-dependent Amplitude from the Peak-Background Split and Thresholding
Recent results of N-body simulations have shown that current theoretical models are not able to correctly predict the amplitude of the scale-dependent halo bias induced by primordial non-Gaussianity, for models going beyond the simplest, local quadratic case. Motivated by these discrepancies, we carefully examine three theoretical approaches based on (1) the statistics of thresholded regions, (...
متن کاملNew Results on Bar - Halo Interactions
In this paper I argue that, far from necessarily hindering bar formation in disc galaxies, inner haloes may stimulate it. This constitutes a new instability mechanism by which bars can grow. To show this I use a number of N-body simulations whose initial conditions have identical discs and more or less concentrated haloes. They show that the bar that grows in the more halo-dominated environment...
متن کاملOptimal Softening for N -body Halo Simulations
We propose to determine the optimal softening length in N -body halo simulations by minimizing the ensemble-average acceleration error at a small radius r0. This strategy ensures that the error never exceeds the optimal value beyond r0. Furthermore, we derive semi-analytic formulae for calculating the acceleration error due to the discreteness of particles and softened gravity, which are valida...
متن کاملFinding the polar decomposition of a matrix by an efficient iterative method
Theobjective in this paper to study and present a new iterative method possessing high convergence order for calculating the polar decompostion of a matrix. To do this, it is shown that the new scheme is convergent and has high convergence. The analytical results are upheld via numerical simulations and comparisons.
متن کامل