Related papers: An iterative method for computing $\pi$ by argumen…
A poly-log time method to compute the truncated theta function, its derivatives, and integrals is presented. The method is elementary, rigorous, explicit, and suited for computer implementation. We repeatedly apply the Poisson summation…
In this paper, we propose a probabilistic optimization method, named probabilistic incremental proximal gradient (PIPG) method, by developing a probabilistic interpretation of the incremental proximal gradient algorithm. We explicitly model…
In this paper, we apply results on number systems based on continued fraction expansions to modular arithmetic. We provide two new algorithms in order to compute modular multiplication and modular division. The presented algorithms are…
In a recent paper [1] we have proposed a new approach for extracting the wave function of the $\pi$-meson $\varphi_{\pi}(x)$ and the masses and wave functions of its first resonances from the new QCD sum rules for non-diagonal correlators…
Incremental computation aims to compute more efficiently on changed input by reusing previously computed results. We give a high-level overview of works on incremental computation, and highlight the essence underlying all of them, which we…
Real and imaginary part of the limit 2N->infinity of the integral int_{x=1..2N} exp(i*pi*x)*x^(1/x) dx are evaluated to 20 digits with brute force methods after multiple partial integration, or combining a standard Simpson integration over…
Our work presents a new iterative scheme to approximate the fixed points of nonexpansive mapping. The proposed algorithm is constructed to enhance convergence efficiency while preserving theoretical robustness. Under appropriate assumptions…
We established a new eighth-order iterative method, consisting of three steps, for solving nonlinear equations. Per iteration the method requires four evaluations (three function evaluations and one evaluation of the first derivative).…
This paper introduces the $f$-EI$(\phi)$ algorithm, a novel iterative algorithm which operates on measures and performs $f$-divergence minimisation in a Bayesian framework. We prove that for a rich family of values of $(f,\phi)$ this…
In this document, as far as the authors know, an approximation to the zeros of the Riemann zeta function has been obtained for the first time using only derivatives of constant functions, which was possible only because a fractional…
We present a new tool to compute the number $\phi_\A (\b)$ of integer solutions to the linear system $$ \x \geq 0 \qquad \A \x = \b $$ where the coefficients of $\A$ and $\b$ are integral. $\phi_\A (\b)$ is often described as a \emph{vector…
Today's PCs can directly manipulate numbers not longer than 64 bits because the size of the CPU registers and the data-path are limited. Consequently, arithmetic operations such as addition, can only be performed on numbers of that length.…
This paper presents different recursive formulas for computing the marginals and the normalizing constant of a Gibbs distribution $\pi$: The common thread is the use of the underlying Markov properties of such processes. The procedures are…
We represent the Riemann zeta function in the half-plane $\Re s >1$ via series whose terms admit geometrically decreasing bounds. Due to an underlying recurrence relation, which is used to compute coefficients entering into the terms, the…
In this article, we consider a simple representation for real numbers and propose top-down procedures to approximate various algebraic and transcendental operations with arbitrary precision. Detailed algorithms and proofs are provided to…
In our previous publication we have shown a method for calculating series of even powers of $\pi$ based on the product representation of the $sinc$ function. We refer the readers to [1] for more details. In this work we apply the method to…
In this note, we develop transformation formulae and expansions for the log tangent integral, which are then used to derive series acceleration formulae for certain values of Dirichlet L-functions, such as Catalan's constant. The formulae…
We present an algorithm for the construction of lower dimensional elliptic tori in parametric Hamiltonian systems by means of the parametrization method with the tangent and normal frequencies being prescribed. This requires that the…
A new simple proof of Stirling's formula via the partial fraction expansion for the tangent function is presented.
In previous papers we introduced a class of polynomials which follow the same recursive formula as the Lucas-Lehmer numbers, studying the distribution of their zeros and remarking that this distribution follows a sequence related to the…