Papers › Rootin' Tootin' Efficient Ray Shootin': Creating Microlensing Magnification Maps with GPUs
Rootin' Tootin' Efficient Ray Shootin': Creating Microlensing Magnification Maps with GPUs
Luke Weisenbach
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.
The impending discovery and monitoring of hundreds of new gravitationally lensed quasars and supernovae from upcoming ground and space based large area surveys such as LSST, \textit{Euclid}, and \textit{Roman} necessitates the development of improved numerical methods for studying gravitational microlensing. We present in this work the fastest microlensing map generation code currently publicly available. We utilize graphics processing units to take advantage of the inherent parallelizable nature of creating magnification maps, in addition to using 1) the fast multipole method to reduce the runtime dependence on the number of microlenses and 2) inverse polygon mapping to reduce the number of rays required. The code is available at https://github.com/weisluke/microlensing/.
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