اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFast Identification of Bound Structures in Large N-body Simulations
54
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present an algorithm which is designed to allow the efficient identification and preliminary dynamical analysis of thousands of structures and substructures in large N-body simulations. First we utilise a refined density gradient system (based on DENMAX) to identify the structures, and then apply an iterative approximate method to identify unbound particles, allowing fast calculation of bound substructures. After producing a catalog of separate energetically bound substructures we check to see which of these are energetically bound to adjacent substructures. For such bound complex subhalos, we combine components and check if additional free particles are also bound to the union, repeating the process iteratively until no further changes are found. Thus our subhalos can contain more than one density maximum, but the scheme is stable: starting with a small smoothing length initially produces small structures which must be combined later, and starting with a large smoothing length produces large structures within which sub-substructure is found. We apply this algorithm to three simulations. Two which are using the TPM algorithm by Bode et al. (2000) and one on a simulated halo by Diemand (2004). For all these halos we find about 5-8% of the mass in substructures.
قيم البحث
اقرأ أيضاً
Direct $N$-body simulations of star clusters are accurate but expensive, largely due to the numerous $mathcal{O} (N^2)$ pairwise force calculations. To solve the post-million-body problem, it will be necessary to use approximate force solvers, such a
s tree codes. In this work, we adapt a tree-based, optimized Fast Multipole Method (FMM) to the collisional $N$-body problem. The use of a rotation-accelerated translation operator and an error-controlled cell opening criterion leads to a code that can be tuned to arbitrary accuracy. We demonstrate that our code, Taichi, can be as accurate as direct summation when $N> 10^4$. This opens up the possibility of performing large-$N$, star-by-star simulations of massive stellar clusters, and would permit large parameter space studies that would require years with the current generation of direct summation codes. Using a series of tests and idealized models, we show that Taichi can accurately model collisional effects, such as dynamical friction and the core-collapse time of idealized clusters, producing results in strong agreement with benchmarks from other collisional codes such as NBODY6++GPU or PeTar. Parallelized using OpenMP and AVX, Taichi is demonstrated to be more efficient than other CPU-based direct $N$-body codes for simulating large systems. With future improvements to the handling of close encounters and binary evolution, we clearly demonstrate the potential of an optimized FMM for the modeling of collisional stellar systems, opening the door to accurate simulations of massive globular clusters, super star clusters, and even galactic nuclei.
We discuss the relation between the output of Newtonian N-body simulations on scales that approach or exceed the particle horizon to the description of General Relativity. At leading order, the Zeldovich approximation is correct on large scales, coin
ciding with the General Relativistic result. At second order in the initial metric potential, the trajectories of particles deviate from the second order Newtonian result and hence the validity of 2LPT initial conditions should be reassessed when used in very large simulations. We also advocate using the expression for the synchronous gauge density as a well behaved measure of density fluctuations on such scales.
In the next decade, cosmological surveys will have the statistical power to detect the absolute neutrino mass scale. N-body simulations of large-scale structure formation play a central role in interpreting data from such surveys. Yet these simulatio
ns are Newtonian in nature. We provide a quantitative study of the limitations to treating neutrinos, implemented as N-body particles, in N-body codes, focusing on the error introduced by neglecting special relativistic effects. Special relativistic effects are potentially important due to the large thermal velocities of neutrino particles in the simulation box. We derive a self-consistent theory of linear perturbations in Newtonian and non-relativistic neutrinos and use this to demonstrate that N-body simulations overestimate the neutrino free-streaming scale, and cause errors in the matter power spectrum that depend on the initial redshift of the simulations. For $z_{i} lesssim 100$, and neutrino masses within the currently allowed range, this error is $lesssim 0.5%$, though represents an up to $sim 10%$ correction to the shape of the neutrino-induced suppression to the cold dark matter power spectrum. We argue that the simulations accurately model non-linear clustering of neutrinos so that the error is confined to linear scales.
The aim of this paper is to clarify the notion and cause of overmerging in N-body simulations, and to present analytical estimates for its timescale. Overmerging is the disruption of subhaloes within embedding haloes due to {it numerical} problems co
nnected with the discreteness of N-body dynamics. It is shown that the process responsible for overmerging is particle-subhalo two-body heating. Various solutions to the overmerging problem are discussed
Gravitational N-body simulations, that is numerical solutions of the equations of motions for N particles interacting gravitationally, are widely used tools in astrophysics, with applications from few body or solar system like systems all the way up
to galactic and cosmological scales. In this article we present a summary review of the field highlighting the main methods for N-body simulations and the astrophysical context in which they are usually applied.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
