2000 character limit reached
Numerical Evaluation of Elliptic Functions, Elliptic Integrals and Modular Forms (1806.06725v1)
Published 18 Jun 2018 in cs.NA and cs.MS
Abstract: We describe algorithms to compute elliptic functions and their relatives (Jacobi theta functions, modular forms, elliptic integrals, and the arithmetic-geometric mean) numerically to arbitrary precision with rigorous error bounds for arbitrary complex variables. Implementations in ball arithmetic are available in the open source Arb library. We discuss the algorithms from a concrete implementation point of view, with focus on performance at tens to thousands of digits of precision.