Abstract
Let $f$ be a fixed (holomorphic or Maass) modular cusp form. Let $\cq$ be a Dirichlet character mod $q$. We describe a fast algorithm that computes the value $L(1/2,f\times\chi_q)$ up to any specified precision. In the case when $q$ is smooth or highly composite integer, the time complexity of the algorithm is given by $O(1+|q|^{5/6+o(1)})$.
Original language | English |
---|---|
Pages (from-to) | 1502-1524 |
Number of pages | 23 |
Journal | Journal of Number Theory |
Volume | 133 |
Issue number | 5 |
Early online date | 23 Dec 2012 |
DOIs | |
Publication status | Published - May 2013 |
Bibliographical note
© 2012 Elsevier Inc. This is an author produced version of a paper published in Journal of Number Theory. Uploaded in accordance with the publisher's self-archiving policy.Keywords
- math.NT