Papers
Topics
Authors
Recent
Search
2000 character limit reached

Certified Newton schemes for the evaluation of low-genus theta functions

Published 3 Mar 2022 in math.NA, cs.NA, and math.NT | (2203.02000v1)

Abstract: Theta functions and theta constants in low genus, especially genus 1 and 2, can be evaluated at any given point in quasi-linear time in the required precision using Newton schemes based on Borchardt sequences. Our goal in this paper is to provide the necessary tools to implement these algorithms in a provably correct way. In particular, we obtain uniform and explicit convergence results in the case of theta constants in genus 1 and 2, and theta functions in genus 1: the associated Newton schemes will converge starting from approximations to N bits of precision for N=60, 300, and 1600 respectively, for all suitably reduced arguments. We also describe a uniform quasi-linear time algorithm to evaluate genus 2 theta constants on the Siegel fundamental domain. Our main tool is a detailed study of Borchardt means as multivariate analytic functions.

Citations (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.