DeepAI AI Chat
Log In Sign Up

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

03/03/2022
by   Jean Kieffer, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

02/23/2017

Stochastic Newton and Quasi-Newton Methods for Large Linear Least-squares Problems

We describe stochastic Newton and stochastic quasi-Newton approaches to ...
03/31/2023

How accurate does Newton have to be?

We analyze the convergence of quasi-Newton methods in exact and finite p...
11/24/2021

On the convergence of Broyden's method and some accelerated schemes for singular problems

We consider Broyden's method and some accelerated schemes for nonlinear ...
03/10/2022

Parallel inexact Newton-Krylov and quasi-Newton solvers for nonlinear elasticity

In this work, we address the implementation and performance of inexact N...
12/18/2019

Phase field fracture modelling using quasi-Newton methods and a new adaptive step scheme

We investigate the potential of quasi-Newton methods in facilitating con...
04/26/2023

The n_s-step Interpolatory (Quasi)-Stationary Subdivision Schemes and Their Interpolating Refinable Functions

Standard interpolatory subdivision schemes and their underlying interpol...
03/09/2023

Provably Convergent Plug-and-Play Quasi-Newton Methods

Plug-and-Play (PnP) methods are a class of efficient iterative methods t...