Jacobiens, jacobiennes et stabilit\'e num\'erique

Publication date 9 June 2006

General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Complexity and performance of numerical algorithms (65Y20) Holomorphic modular forms of integral weight (11F11) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Hecke-Petersson operators, differential operators (one variable) (11F25) Fourier coefficients of automorphic forms (11F30) Number-theoretic algorithms; complexity (11Y16) Analytic computations (11Y35)

Abstract: This paper is concerned with the complexity and stability of arithmetic operations in the jacobian variety of curves over the field of complex numbers, as the genus grows to infinity. We focus on modular curves. Efficient and stable computation in the jacobian of modular curves is useful for computing coefficients of modular forms in deterministic polynomial time. This work is part of my contribution to Edixhoven's program for solving this problem.

This page was built for publication: Jacobiens, jacobiennes et stabilit\'e num\'erique

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