2012
DOI: 10.48550/arxiv.1203.1034
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

General Complex Polynomial Root Solver and Its Further Optimization for Binary Microlenses

J. Skowron,
A. Gould

Abstract: We present a new algorithm to solve polynomial equations, and publish its code, which is 1.6-3 times faster than the ZROOTS subroutine that is commercially available from Numerical Recipes, depending on application. The largest improvement, when compared to naive solvers, comes from a fail-safe procedure that permits us to skip the majority of the calculations in the great majority of cases, without risking catastrophic failure in the few cases that these are actually required. Second, we identify a discrimina… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
29
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 21 publications
(30 citation statements)
references
References 11 publications
(18 reference statements)
0
29
0
Order By: Relevance
“…Our method is particularly appealing for hypersurfaces like (2.1) because intersecting a hypersurface with a linear space of dimension 1 reduces to solving a single univariate polynomial equation. This can be done very efficiently, for instance using the algorithm from [26], and so for hypersurfaces we can easily generate large sample sets.…”
Section: Methodsmentioning
confidence: 99%
“…Our method is particularly appealing for hypersurfaces like (2.1) because intersecting a hypersurface with a linear space of dimension 1 reduces to solving a single univariate polynomial equation. This can be done very efficiently, for instance using the algorithm from [26], and so for hypersurfaces we can easily generate large sample sets.…”
Section: Methodsmentioning
confidence: 99%
“…The number and position of the circles is decided so as to match the target accuracy (Bozza 2010). All these techniques are fully implented in the current version of VBBinaryLensing, with the basic inversion of the lens equation realized by the algorithm by Skowron & Gould (2012).…”
Section: Contour Integration In Binary Lensingmentioning
confidence: 99%
“…• Witt & Mao (1995) method when the source is far enough from the caustics. In particular, in order to solve the fifthorder polynomial equation we employed the root finder by Skowron & Gould (2012).…”
Section: Event Simulationmentioning
confidence: 99%