Related papers: A Fast Algorithm to Compute l(1/2, f x \chi_q)

We consider Dirichlet $L$-functions $L(s, \chi)$ where $\chi$ is a non-principal quadratic character to the modulus $q$. We make explicit a result due to Pintz and Stephens by showing that $|L(1, \chi)|\leq \frac{1}{2}\log q$ for all $q\geq…

In this work, we extend the fractional linear multistep methods in [C. Lubich, SIAM J. Math. Anal., 17 (1986), pp.704--719] to the tempered fractional integral and derivative operators in the sense that the tempered fractional derivative…

This paper presents a quantum algorithm for efficiently computing partial sums and specific weighted partial sums of quantum state amplitudes. Computation of partial sums has important applications, including numerical integration,…

We report on some extensive computations and experiments concerning the moments of quadratic Dirichlet $L$-functions at the critical point. We computed the values of $L(1/2,\chi_d)$ for $- 5\times 10^{10} < d < 1.3 \times 10^{10}$ in order…

We present a polynomial time algorithm to compute any fixed number of the highest coefficients of the Ehrhart quasi-polynomial of a rational simplex. Previously such algorithms were known for integer simplices and for rational polytopes of…

Let $q\ge3$ be an integer, $\chi$ be a Dirichlet character modulo $q$, and $L(s,\chi)$ denote the Dirichlet $L$-functions corresponding to $\chi$. In this paper, we show some special function series, and give some new identities for the…

This paper shows that it is possible to improve the computational cost, the memory requirements and the accuracy of Quick Fourier Transform (QFT) algorithm for power-of-two FFT (Fast Fourier Transform) just introducing a slight modification…

Let $q$ be a positive integer ($\geq 2$), $\chi$ be a Dirichlet character modulo $q$, $L(s, \chi)$ be the attached Dirichlet $L$-function, and let $L^\prime(s, \chi)$ denote its derivative with respect to the complex variable $s$. Let $t_0$…

Given a Dirichlet character $\chi$ modulo $q$ and its associated $L$-function, $L(s,\chi)$, we provide an explicit version of Burgess' estimate for $|L(s, \chi)|$. We use partial summation to provide bounds along the vertical lines $\Re{s}…

We have rediscovered a simple algorithm to compute the mathematical constant \[ \pi=3.14159265\cdots. \] The algorithm had been known for a long time but it might not be recognized as a fast, practical algorithm. The time complexity of it…

In the classical theory of cubic interpolation splines there exists an algorithm which works with only $O\left( n\right)$ arithmetic operations. Also, the smoothing cubic splines may be computed via the algorithm of Reinsch which reduces…

In recent years there has been a renewed interest in finding fast algorithms to compute accurately the linear canonical transform (LCT) of a given function. This is driven by the large number of applications of the LCT in optics and signal…

In this paper, we extend the work of Humphries and Khan [HK20] to establish an explicit version of Watson--Ichino formula for $L(1/2,f\otimes\mathrm{ad} g)$, where $f$ is a Hecke--Maass form and $g$ is a CM newform.

We introduce a new deterministic factoring algorithm, which could be described in the cryptographically fashionable term of "factoring with hints": we show that, given the knowledge of the factorisations of $O(N^{1/3+\epsilon})$ terms…

The classical division algorithm for polynomials requires $O(n^2)$ operations for inputs of size $n$. Using reversal technique and Newton iteration, it can be improved to $O({M}(n))$, where ${M}$ is a multiplication time. But the method…

A fast simple O(\log n) iteration algorithm for individual Lucas numbers is given. This is faster than using Fibonacci based methods because of the structure of Lucas numbers. Using a sqrt 5 conversion factor on Lucus numbers gives a faster…

In this paper we address the problem of computing asymptotic formulae for the expected values and second moments of central values of primitive Dirichlet $L$-functions $L(1/2,\chi_{8d}\otimes\psi)$ when $\psi$ is a fixed even primitive…

We present an algorithm to compute values L(s) and derivatives of L-functions of motivic origin numerically to required accuracy. Specifically, the method applies to any L-series whose Gamma-factor is a product of any number of…

A precise estimation of the computational complexity in Shor's factoring algorithm under the condition that the large integer we want to factorize is composed by the product of two prime numbers, is derived by the results related to number…

We present a simple and fast algorithm for computing the $N$-th term of a given linearly recurrent sequence. Our new algorithm uses $O(\mathsf{M}(d) \log N)$ arithmetic operations, where $d$ is the order of the recurrence, and…