Papers › ELISa: A new tool for fast modelling of eclipsing binaries
ELISa: A new tool for fast modelling of eclipsing binaries
Michal Čokina, Miroslav Fedurco, Štefan Parimucha
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, fast, and easy to use tool for modelling light and radial velocity curves of close eclipsing binaries with built-in methods for solving an inverse problem. The main goal of ELISa (Eclipsing binary Learning and Interactive System) is to provide an acceptable compromise between computational speed and precision during the fitting of light curves and radial velocities of eclipsing binaries. The package is entirely written in the Python programming language in a modular fashion, making it easy to install, modify, and run on various operating systems. ELISa implements Roche geometry and the triangulation process to model a surface of the eclipsing binary components, where the surface parameters of each surface element are treated separately. Surface symmetries and approximations based on the similarity between surface geometries were used to reduce the runtime during light curve calculation significantly. ELISa implements the least square trust region reflective algorithm and Markov-chain Monte Carlo optimisation methods to provide the built-in capability to determine parameters of the binary system from photometric observations and radial velocities. The precision and speed of the light curve generator were evaluated using various benchmarks. We conclude that ELISa maintains an acceptable level of accuracy to analyse data from ground-based and space-based observations, and it provides a significant reduction in computational time compared to the current widely used tools for modelling eclipsing binaries.
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