Fast evaluation of modular functions using Newton iterations and the AGM

DOI10.1090/S0025-5718-2011-01880-6MaRDI QIDQ3015060zbMATH OpenOpenAlexFDO

Authors Régis Dupont

Publication date 8 July 2011

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/s0025-5718-2011-01880-6

zbMATH Keywords

AGMmodular functionsNewton iterationsnumerical evaluation

Mathematics Subject Classification ID

Modular and automorphic functions (11F03) Holomorphic modular forms of integral weight (11F11) Number-theoretic algorithms; complexity (11Y16) Analytic computations (11Y35) Elliptic functions and integrals (33E05) Computation of special functions and constants, construction of tables (65D20)

Recommendations

• Computing Jacobi's theta in quasi-linear time
• Computing modular polynomials in quasi-linear time
• Short addition sequences for theta functions
• On the Computational Complexity of Modular Symbols
• Rapid computation of \(L\)-functions for modular forms

Cites work

• How to Compute the Coefficients of the Elliptic Modular Functionj(z)
• scientific article; zbMATH DE number 3987351 (Why is no real title available?)
• scientific article; zbMATH DE number 2086890 (Why is no real title available?)
• scientific article; zbMATH DE number 3446982 (Why is no real title available?)
• scientific article; zbMATH DE number 3198945 (Why is no real title available?)
• MPFR
• Tata lectures on theta. I: Introduction and motivation: Theta functions in one variable. Basic results on theta functions in several variables. With the assistance of C. Musili, M. Nori, E. Previato, and M. Stillman
• The arithmetic-geometric mean of Gauss
• The complexity of class polynomial computation via floating point approximations

Cited in

(17)

• Efficient computation of multidimensional theta functions
• The complex AGM, periods of elliptic curves over \(\mathbb C\) and complex elliptic logarithms
• Computing Igusa class polynomials
• Computing class polynomials for abelian surfaces
• Computing theta functions in quasi-linear time in genus two and above
• The complexity of class polynomial computation via floating point approximations
• Computing modular polynomials in quasi-linear time
• On the evaluation of some sparse polynomials
• Computing Jacobi's theta in quasi-linear time
• Short addition sequences for theta functions
• On the computation of class polynomials with ``thetanullwerte`` and its applications to the unit group computation
• On Newton–Raphson Iteration for Multiplicative Inverses Modulo Prime Powers
• Computing the truncated theta function via Mordell integral
• scientific article; zbMATH DE number 7055484 (Why is no real title available?)
• Certified Newton schemes for the evaluation of low-genus theta functions
• Modular polynomials on Hilbert surfaces
• Class polynomials for nonholomorphic modular functions

Describes a project that uses

Uses Software

• gmp
• MPC
• MPFR

This page was built for publication: Fast evaluation of modular functions using Newton iterations and the AGM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3015060)