Also available in a new collection from PSIpress, Algorithmic reflections: Selected works 1 Unified algorithms for polylogarithm, L-series, and zeta variants Richard E. Crandall1 March 26, 2012 In memory of gentle colleague Jerry Keiper 1953-1995 Abstract: We describe a general computational scheme for evaluation of a wide class of number-theoretical functions. We avoid asymptotic expansions in favor of manifestly convergent series that lend themselves naturally to rigorous error bounds. By employing three fundamental series algorithms we achieve a unified strategy to compute the various functions via parameter selection. This work amounts to a compendium of methods to establish extreme-precision results as typify modern experimental mathematics. A fortu- itous byproduct of this unified approach is automatic analytic continuation over complex parameters. Another byproduct is a host of converging series for various fundamental constants. 1Center for Advanced Computation, Reed College.
[email protected] Also available in a new collection from PSIpress, Algorithmic reflections: Selected works 2 Contents 1 Motivation 4 1.1 Acknowledgements and disclaimer . 5 2 Representations of the Lerch transcendent 5 2.1 Bernoulli-series representation of Lerch Φ . 7 2.2 Bernoulli multisectioning . 10 2.3 Erd´elyi-seriesrepresentation for Lerch Φ . 10 2.4 Riemann-splitting representation for Lerch variant Φ . 11 3 Riemann zeta function 14 3.1 Riemann{Siegel formula and Dirichlet L-functions . 14 3.2 Riemann-zeta derivatives . 15 3.3 Gamma- and incomplete-gamma calculus . 16 3.4 Γ and its derivatives . 16 3.5 Incomplete gamma and its outer derivatives . 17 3.6 Stark{Keiper and other \summation form" strategies .