ASCL.net

Astrophysics Source Code Library

Making codes discoverable since 1999

ASCL Code Record

[ascl:1212.005] General complex polynomial root solver

This general complex polynomial root solver, implemented in Fortran and further optimized for binary microlenses, uses a new algorithm to solve polynomial equations and 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 skipping the majority of the calculations in the great majority of cases, without risking catastrophic failure in the few cases that these are actually required.

Code site:
http://www.astrouw.edu.pl/~jskowron/cmplx_roots_sg/
Used in:
http://adsabs.harvard.edu/abs/2012RAA....12..947M
Described in:
http://adsabs.harvard.edu/abs/2012arXiv1203.1034S
Bibcode:
2012ascl.soft12005S

Views: 1535

ascl:1212.005
Add this shield to your page
Copy the above HTML to add this shield to your code's website.