Papers › Fast simulations of extragalactic microlensing
Fast simulations of extragalactic microlensing
V. N. Shalyapin, R. Gil-Merino, L. J. Goicoechea
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We present a new and very fast method for producing microlensing magnification maps at high optical depths. It is based on the combination of two approaches: (a) the two-dimensional Poisson solver for a deflection potential and (b) inverse polygon mapping. With our method we extremely reduce the computing time for the generation of magnification patterns and avoid the use of highly demanding computer resources. For example, the generation of a magnification map of size 2000 x 2000 pixels, covering a region of 20 Einstein radii, takes a few seconds on a state-of-the-art laptop. The method presented here will facilitate the massive production of magnification maps for extragalactic microlensing studies within the forthcoming surveys without the need for large computer clusters. The modest demand of computer power and a fast execution time allow the code developed here to be placed on a standard server and thus provide the public online access through a web-based interface.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections