Related papers: A Successive Approximation Algorithm for Computing…
We present a new elementary algorithm that takes \[ \mathrm{time} \ \ O_\epsilon\left(x^{\frac{3}{5}} (\log x)^{\frac{3}{5}+\epsilon} \right) \ \ \mathrm{and}\ \ \mathrm{space} \ \ O\left(x^{\frac{3}{10}} (\log x)^{\frac{13}{10}} \right)\]…
Numerical data processing is a key task across different fields of computer technology use. However, even simple summation of values is not precise due to the floating point representation use. This paper presents a practical algorithm for…
This paper presents a means with time complexity of at worst O(n^3) to compute the discrete logarithm on cyclic finite groups of integers modulo p. The algorithm makes use of reduction of the problem to that of finding the concurrent zeros…
An algorithm is devised for computing $\Phi(n) = \phi(1) + \phi(2) + \cdots + \phi(n)$ in time $\widetilde{\Theta}(n^{2/3})$ and space $\widetilde{\Theta}(n^{1/3})$. The starting point is an existing algorithm based on the Dirichlet…
We investigate the approximation for computing the sum $a_1+...+a_n$ with an input of a list of nonnegative elements $a_1,..., a_n$. If all elements are in the range $[0,1]$, there is a randomized algorithm that can compute an…
We propose an algorithm for computing the proximity operator of a sum of composite convex functions in Hilbert spaces and investigate its asymptotic behavior. Applications to best approximation and image recovery are described.
This short note provides a sharper upper bound of a well known inequality for the sum of divisors function. This is a problem in pure mathematics related to the distribution of prime numbers. Furthermore, the technique is completely…
We give an algorithm to compute the local $b$ function. In this algorithm, we use the Mora division algorithm in the ring of differential operators and an approximate division algorithm in the ring of differential operators with power…
Let $\tau_3(n)$ be the triple divisor function which is the number of solutions of the equation $d_1d_2d_3=n$ in natural numbers. It is shown that $$ \sum_{1\leq n_1,n_2,n_3\leq \sqrt{x}}\tau_3(n_1^2+n_2^2+n_3^2)=c_1x^{\frac{3}{2}}(\log…
This note gives a few rapidly convergent series representations of the sums of divisors functions. These series have various applications such as exact evaluations of some power series, computing estimates and proving the existence results…
We design a Quasi-Polynomial time deterministic approximation algorithm for computing the integral of a multi-dimensional separable function, supported by some underlying hyper-graph structure, appropriately defined. Equivalently, our…
We consider the complexity for computing the approximate sum $a_1+a_2+...+a_n$ of a sorted list of numbers $a_1\le a_2\le ...\le a_n$. We show an algorithm that computes an $(1+\epsilon)$-approximation for the sum of a sorted list of…
The error term in the approximate functional equation for exponential sums involving the divisor function will be improved under certain conditions for the parameters of the approximate functional equation.
Given a rectangle $R$ with area $A$ and a set of areas $L=\{A_1,...,A_n\}$ with $\sum_{i=1}^n A_i = A$, we consider the problem of partitioning $R$ into $n$ sub-regions $R_1,...,R_n$ with areas $A_1,...,A_n$ in a way that the total…
An efficient procedure for the computation of $Li_{s}(z)$ where $s<0$ is here presented. We started with Polylogarithm $Li_{s}(z)$ where $s<0$. The summation of $n^{s}z^{n}$ is evaluated using a new method. An assumption is made that the…
Approximating Subset Sum is a classic and fundamental problem in computer science and mathematical optimization. The state-of-the-art approximation scheme for Subset Sum computes a $(1-\varepsilon)$-approximation in time…
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,…
By simple elementary method,we obtain with ease,a highly simple expression for the remainder term of the divisor problem and use it to obtain an Euler-Maclaurin analogue of summation involving divisor function.We also obtain a relation…
Given a multiset $S$ of $n$ positive integers and a target integer $t$, the Subset Sum problem asks to determine whether there exists a subset of $S$ that sums up to $t$. The current best deterministic algorithm, by Koiliaris and Xu…
Gaussian couplings of partial sum processes are derived for the high-dimensional regime $d=o(n^{1/3})$. The coupling is derived for sums of independent random vectors and subsequently extended to nonstationary time series. Our inequalities…