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

Approximate integer programming is the following: For a convex body $K \subseteq \mathbb{R}^n$, either determine whether $K \cap \mathbb{Z}^n$ is empty, or find an integer point in the convex body scaled by $2$ from its center of gravity…

Fast Fourier transform algorithms are an arsenal of effective tools for solving various problems of analysis and high-speed processing of signals of various natures. Almost all of these algorithms are designed to process sequences of…

Let $k$ be an odd integer $\ge 3$ and $N$ a positive integer such that $4 \mid N$. Let $\chi$ be an even Dirichlet character modulo $N$. Shimura decomposes the space of half-integral weight cusp forms $S_{k/2}(N,\chi)$ as a direct sum of…

We consider a version of Shor's quantum factoring algorithm such that the quantum Fourier transform is replaced by an extremely simple one where decomposition coefficients take only the values of $1,i,-1,-i$. In numerous calculations which…

We present a super-high-efficiency approximate computing scheme for series sum and discrete Fourier transform. The summation of a series sum or a discrete Fourier transform is approximated by summing over part of the terms multiplied by…

In this paper, we present the fast computational algorithms for the Jacobi sums of orders $l^2$ and $2l^{2}$ with odd prime $l$ by formulating them in terms of the minimum number of cyclotomic numbers of the corresponding orders. We also…

In this paper, we investigate the conditional large values of the quadratic Dirichlet $L$-functions near the central point $s=1/2$. When $\sigma $ closes to $1/2$ within a suitable range, we show that $L(\sigma, \chi_d)$ have the…

Let $f$ be a holomorphic or Maass cusp forms for $ \rm SL_2(\mathbb{Z})$ with normalized Fourier coefficients $\lambda_f(n)$ and \bna r_{\ell}(n)=\#\left\{(n_1,\cdots,n_{\ell})\in \mathbb{Z}^2:n_1^2+\cdots+n_{\ell}^2=n\right\}. \ena Let…

Debugging accumulation of floating-point errors is hard; ideally, computer should track it automatically. Here we consider twofold approximation of an exact real with value + error pair of floating-point numbers. Normally, value + error sum…

We present an algorithm computing the determinant of an integer matrix A. The algorithm is introspective in the sense that it uses several distinct algorithms that run in a concurrent manner. During the course of the algorithm partial…

We address the question of computing one selected term of an algebraic power series. In characteristic zero, the best algorithm currently known for computing the $N$th coefficient of an algebraic series uses differential equations and has…

We present in this paper two different classes of general $K$-splitting algorithms for solving finite-dimensional convex optimization problems. Under the assumption that the function being minimized has a Lipschitz continuous gradient, we…

Fourier series of smooth, non-periodic functions on $[-1,1]$ are known to exhibit the Gibbs phenomenon, and exhibit overall slow convergence. One way of overcoming these problems is by using a Fourier series on a larger domain, say $[-T,T]$…

We review existing methods for implementing smooth functions f(A) of a sparse Hermitian matrix A on a quantum computer, and analyse a further combination of these techniques which has some advantages of simplicity and resource consumption…

This paper introduces the theory and hardware implementation of two new algorithms for computing a single component of the discrete Fourier transform. In terms of multiplicative complexity, both algorithms are more efficient, in general,…

Let $q\geqslant2$ be an integer, $\chi$ be any non-principal character mod $q$, and $H=H(q)\leqslant q.$ In this paper the authors prove some estimates for character sums of the form…

It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…

We consider the computation of Bernoulli, Tangent (zag), and Secant (zig or Euler) numbers. In particular, we give asymptotically fast algorithms for computing the first n such numbers in O(n^2.(log n)^(2+o(1))) bit-operations. We also give…

The graph Fourier transform (GFT) is in general dense and requires O(n^2) time to compute and O(n^2) memory space to store. In this paper, we pursue our previous work on the approximate fast graph Fourier transform (FGFT). The FGFT is…

An algorithm is given to efficiently compute $L$-functions with large conductor in a restricted range of the critical strip. Examples are included for about 21000 dihedral Galois representations with conductor near $10^7$. The data shows…