اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدVlasov-Poisson in 1D: waterbags
87
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We revisit in one dimension the waterbag method to solve numerically Vlasov-Poisson equations. In this approach, the phase-space distribution function $f(x,v)$ is initially sampled by an ensemble of patches, the waterbags, where $f$ is assumed to be constant. As a consequence of Liouville theorem it is only needed to follow the evolution of the border of these waterbags, which can be done by employing an orientated, self-adaptive polygon tracing isocontours of $f$. This method, which is entropy conserving in essence, is very accurate and can trace very well non linear instabilities as illustrated by specific examples. As an application of the method, we generate an ensemble of single waterbag simulations with decreasing thickness, to perform a convergence study to the cold case. Our measurements show that the system relaxes to a steady state where the gravitational potential profile is a power-law of slowly varying index $beta$, with $beta$ close to $3/2$ as found in the literature. However, detailed analysis of the properties of the gravitational potential shows that at the center, $beta > 1.54$. Moreover, our measurements are consistent with the value $beta=8/5=1.6$ that can be analytically derived by assuming that the average of the phase-space density per energy level obtained at crossing times is conserved during the mixing phase. These results are incompatible with the logarithmic slope of the projected density profile $beta-2 simeq -0.47$ obtained recently by Schulz et al. (2013) using a $N$-body technique. This sheds again strong doubts on the capability of $N$-body techniques to converge to the correct steady state expected in the continuous limit.
قيم البحث
اقرأ أيضاً
We study analytically the collapse of an initially smooth, cold, self-gravitating collisionless system in one dimension. The system is described as a central S shape in phase-space surrounded by a nearly stationary halo acting locally like a harmonic
background on the S. To resolve the dynamics of the S under its self-gravity and under the influence of the halo, we introduce a novel approach using post-collapse Lagrangian perturbation theory. This approach allows us to follow the evolution of the system between successive crossing times and to describe in an iterative way the interplay between the central S and the halo. Our theoretical predictions are checked against measurements in entropy conserving numerical simulations based on the waterbag method. While our post-collapse Lagrangian approach does not allow us to compute rigorously the long term behavior of the system, i.e. after many crossing times, it explains the close to power-law behavior of the projected density observed in numerical simulations. Pushing the model at late time suggests that the system could build at some point a very small flat core, but this is very speculative. This analysis shows that understanding the dynamics of initially cold systems requires a fine grained approach for a correct description of their very central part. The analyses performed here can certainly be extended to spherical symmetry.
We propose a new semi-Lagrangian Vlasov-Poisson solver. It employs elements of metric to follow locally the flow and its deformation, allowing one to find quickly and accurately the initial phase-space position $Q(P)$ of any test particle $P$, by exp
anding at second order the geometry of the motion in the vicinity of the closest element. It is thus possible to reconstruct accurately the phase-space distribution function at any time $t$ and position $P$ by proper interpolation of initial conditions, following Liouville theorem. When distorsion of the elements of metric becomes too large, it is necessary to create new initial conditions along with isotropic elements and repeat the procedure again until next resampling. To speed up the process, interpolation of the phase-space distribution is performed at second order during the transport phase, while third order splines are used at the moments of remapping. We also show how to compute accurately the region of influence of each element of metric with the proper percolation scheme. The algorithm is tested here in the framework of one-dimensional gravitational dynamics but is implemented in such a way that it can be extended easily to four or six-dimensional phase-space. It can also be trivially generalised to plasmas.
Resolving numerically Vlasov-Poisson equations for initially cold systems can be reduced to following the evolution of a three-dimensional sheet evolving in six-dimensional phase-space. We describe a public parallel numerical algorithm consisting in
representing the phase-space sheet with a conforming, self-adaptive simplicial tessellation of which the vertices follow the Lagrangian equations of motion. The algorithm is implemented both in six- and four-dimensional phase-space. Refinement of the tessellation mesh is performed using the bisection method and a local representation of the phase-space sheet at second order relying on additional tracers created when needed at runtime. In order to preserve in the best way the Hamiltonian nature of the system, refinement is anisotropic and constrained by measurements of local Poincare invariants. Resolution of Poisson equation is performed using the fast Fourier method on a regular rectangular grid, similarly to particle in cells codes. To compute the density projected onto this grid, the intersection of the tessellation and the grid is calculated using the method of Franklin and Kankanhalli (1993) generalised to linear order. As preliminary tests of the code, we study in four dimensional phase-space the evolution of an initially small patch in a chaotic potential and the cosmological collapse of a fluctuation composed of two sinusoidal waves. We also perform a warm dark matter simulation in six-dimensional phase-space that we use to check the parallel scaling of the code.
We construct (modified) scattering operators for the Vlasov-Poisson system in three dimensions, mapping small asymptotic dynamics as $tto -infty$ to asymptotic dynamics as $tto +infty$. The main novelty is the construction of modified wave operators,
but we also obtain a new simple proof of modified scattering. Our analysis is guided by the Hamiltonian structure of the Vlasov-Poisson system. Via a pseudo-conformal inversion we recast the question of asymptotic behavior in terms of local in time dynamics of a new equation with singular coefficients which is approximately integrated using a generating function.
We introduce a deterministic discrete-particle simulation approach, the Linearly-Transformed Particle-In-Cell (LTPIC) method, that employs linear deformations of the particles to reduce the noise traditionally associated with particle schemes. Formal
ly, transforming the particles is justified by local first order expansions of the characteristic flow in phase space. In practice the method amounts to using deformation matrices within the particle shape functions; these matrices are updated via local evaluations of the forward numerical flow. Because it is necessary to periodically remap the particles on a regular grid to avoid excessively deforming their shapes, the method can be seen as a development of Denavits Forward Semi-Lagrangian (FSL) scheme [J. Denavit, J. Comp. Physics 9, 75 (1972)]. However, it has recently been established [M. Campos Pinto, Smooth particle methods without smoothing, arXiv:1112.1859 (2012)] that the underlying Linearly-Transformed Particle scheme converges for abstract transport problems, with no need to remap the particles; deforming the particles can thus be seen as a way to significantly lower the remapping frequency needed in the FSL schemes, and hence the associated numerical diffusion. To couple the method with electrostatic field solvers, two specific charge deposition schemes are examined, and their performance compared with that of the standard deposition method. Finally, numerical 1d1v simulations involving benchmark test cases and halo formation in an initially mismatched thermal sheet beam demonstrate some advantages of our LTPIC scheme over the classical PIC and FSL methods. Benchmarked test cases also indicate that, for numerical choices involving similar computational effort, the LTPIC method is capable of accuracy comparable to or exceeding that of state-of-the-art, high-resolution Vlasov schemes.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
