Improved Aberth-Ehrlich root-finding algorithm and its further application for Binary Microlensing

Abstract

In gravitational microlensing formalism and for modeling binary light curves, the key step is solving the binary lens equation. Currently, a combination of the Newton's and Laguerre's methods which was first introduced by Skowron \& Gould (SG) is used while modeling binary light curves. In this paper, we first introduce a fast root-finding algorithm for univariate polynomials based on the Aberth-Ehrlich (AE) method which was first developed in 1967 as an improvement over the Newton's method. AE algorithm has proven to be much faster than Newton's, Laguerre's and Durand-Kerner methods and unlike other root-finding algorithms, it is able to produce all the roots simultaneously. After improving the basic AE algorithm and discussing its properties, we will optimize it for solving binary lens equations, which are fifth degree polynomials with complex coefficients. Our method is about $1.8$ to $2.0$ times faster than the SG algorithm. Since, for calculating magnification factors for point-like or finite source stars, it is necessary to solve the binary lens equation and find the positions of the produced images in the image plane first, this new method will improve the speed and accuracy of binary microlensing modeling.

arXiv comment6 pages, 2 figures

References in corpus (13)

• Detecting Earth-Mass Planets with Gravitational Microlensing
• Predictions of the WFIRST Microlensing Survey I: Bound Planet Detection Rates
• MOA-cam3: a wide-field mosaic CCD camera for a gravitational microlensing survey in New Zealand
• Microlensing with advanced contour integration algorithm: Green's theorem to third order, error control, optimal sampling and limb darkening
• An Efficient Method for Modeling High Magnification Planetary Microlensing Events
• ExELS: an exoplanet legacy science proposal for the ESA Euclid mission I. Cold exoplanets
• VBBinaryLensing: a public package for microlensing light curve computation
• Two new free-floating or wide-orbit planets from microlensing
• Modeling microlensing events with MulensModel
• Illuminating Hot Jupiters in caustic crossing
• Detection of Extrasolar Planets by Gravitational Microlensing
• On the detection of free-floating planets through microlensing towards the Magellanic Clouds
• Sensitivity to habitable planets in the \textit{Roman} microlensing survey

Cited by in corpus (4)

• VBMicroLensing: three algorithms for multiple lensing with contour integration
• On the Perturbative Picture and the Chang-Refsdal Lens Approximation for Planetary Microlensing
• A differentiable binary microlensing model using adaptive contour integration method
• A GPU Code for Finding Microlensing Critical Curves and Caustics