Related papers: A Successive Approximation Algorithm for Computing…
In this note we will give various exact formulas for functions on integer partitions including the functions $p(n)$ and $p(n,k)$ of the number of partitions of $n$ and the number of such partitions into exactly $k$ parts respectively. For…
Different possible sources are discussed for enhancement of the calculation time when solving ordinary differential equations systems to forecast space objects' motion. This paper presents an approach for building an integrator of ordinary…
We prove an inversion formula for summatory arithmetic functions. As an application, we obtain an arithmetic relationship between summatory Piltz divisor functions and a sum of the M\"obius function over certain integers, denoted by…
Let $\tau(n)$ be the number of divisors of $n$. We give an elementary proof of the fact that $$ \sum_{n\le x} \tau(n)^r =xC_{r} (\log x)^{2^r-1}+O(x(\log x)^{2^r-2}), $$ for any integer $r\ge 2$. Here, $$ C_{r}=\frac{1}{(2^r-1)!}…
We give a technical overview of our exact-real implementation of various representations of the space of continuous unary real functions over the unit domain and a family of associated (partial) operations, including integration, range…
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…
We derive a combinatorial multisum expression for the number $D(n,k)$ of partitions of $n$ with Durfee square of order $k$. An immediate corollary is therefore a combinatorial formula for $p(n)$, the number of partitions of $n$. We then…
In terms of the derivative operator and three hypergeometric series identities, several interesting summation formulas involving generalized harmonic numbers are established.
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…
An algorithm counting the number of ones in a binary word is presented running in time $O(\log\log b)$ where $b$ is the number of ones. The operations available include bit-wise logical operations and multiplication.
Fourier extension is an approximation scheme in which a function on an arbitary bounded domain is approximated using a classical Fourier series on a bounding box. On the smaller domain the Fourier series exhibits redundancy, and it has the…
We construct a smooth real-valued function P(n) in [0,1], defined via a triple integral with a periodic kernel, that approximates the characteristic function of prime numbers. The function is built to suppress when n is divisible by some m…
The Fourier transform is approximated over a finite domain using a Riemann sum. This Riemann sum is then expressed in terms of the discrete Fourier transform, which allows the sum to be computed with a fast Fourier transform algorithm more…
Convex nonsmooth optimization problems, whose solutions live in very high dimensional spaces, have become ubiquitous. To solve them, the class of first-order algorithms known as proximal splitting algorithms is particularly adequate: they…
A sharper estimate for the summatory Euler phi function $\sum_{n \leq x} \varphi(n)$ is presented in this work. It improves the established estimate in the current mathematical literature. In addition, an estimate for its reciprocal…
This paper introduces a novel algorithmic solution for the approximation of a given multivariate function by a nomographic function that is composed of a one-dimensional continuous and monotone outer function and a sum of univariate…
We consider random multiplicative functions taking the values $\pm 1$. Using Stein's method for normal approximation, we prove a central limit theorem for the sum of such multiplicative functions in appropriate short intervals.
In a number of problems in computational physics, a finite sum of kernel functions centered at $N$ particle locations located in a box in three dimensions must be extended by imposing periodic boundary conditions on box boundaries. Even…
Continuing earlier investigations, we analyze the convergence of operator splitting procedures combined with spatial discretization and rational approximations.
We present a package to perform partial fraction decompositions of multivariate rational functions. The algorithm allows to systematically avoid spurious denominator factors and is capable of producing unique results also when being applied…