Abstract

Abstract We present a two-dimensional particle–particle–particle-mesh (P3M) algorithm with an optimized Green’s function and adaptive softening length for gravitational lensing studies in N-body simulations. The analytical form of the optimized Green’s function G ˆ ( k ) is given. The softening schemes (S) are studied for both the particle-mesh (PM) and the particle–particle (PP) calculations in order for accurate force calculation and suppression of the particle discreteness effect. Our method is two orders of magnitude more accurate than the simple PM algorithm with the poor man’s Green’s function (∝ 1/k 2) at a scale of a few mesh cells or smaller. The force anisotropy is also much smaller than the conventional PM calculation. We can achieve a force accuracy better than 0.1% at all scales with our algorithm, which makes it an ideal (accurate and fast) algorithm for microlensing studies. When we apply the algorithm to computing weak and strong lensing quantities in N-body simulations, the errors are dominated by the Poisson noise caused by particle discreteness. The Poisson noise can be suppressed by smoothing out the particle distribution, which can be achieved by simply choosing an adaptive softening length in the PP calculation. We have presented a criterion to set the adaptive softening length. Our algorithm is also applicable to cosmological simulations. We provide a python implementation P3Mlens for this algorithm.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.