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

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

2012-03-05

arxiv.org/abs/1203.1034v1

Astronomy and Astrophysics

Astrophysics

Earth and Planetary Astrophysics

29 pages, 4 figures, 1 table, 3 appendices. Open-source codes described in this paper are available in the ancillary files dir

Scientific paper

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 discriminant that enables a rational choice between Laguerre's Method and Newton's Method (or a new intermediate method) on a case-by-case basis. We briefly review the history of root solving and demonstrate that "Newton's Method" was discovered neither by Newton (1671) nor by Raphson (1690), but only by Simpson (1740). Some of the arguments leading to this conclusion were first given by the British historian of science Nick Kollerstrom in 1992, but these do not appear to have penetrated the astronomical community. Finally, we argue that Numerical Recipes should voluntarily surrender its copyright protection for non-profit applications, despite the fact that, in this particular case, such protection was the major stimulant for developing our improved algorithm.

Affiliated with

Also associated with

No associations

Rating

General Complex Polynomial Root Solver and Its Further Optimization for Binary Microlenses does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with General Complex Polynomial Root Solver and Its Further Optimization for Binary Microlenses, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and General Complex Polynomial Root Solver and Its Further Optimization for Binary Microlenses will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-536041