Related papers: An iterative method for computing $\pi$ by argumen…
We have devised an alternative approach to sifting integers in the sieve of Eratosthenes that helps refine the error term. Instead of eliminating all multiples of a prime number $p<z$ in the traditional sieve method, our approach solely…
In this work a rationalized algorithm for Dirac numbers multiplication is presented. This algorithm has a low computational complexity feature and is well suited to FPGA implementation. The computation of two Dirac numbers product using the…
Computation can be considered by taking into account two dimensions: extensional versus intensional, and sequential versus concurrent. Traditionally sequential extensional computation can be captured by the lambda-calculus. However, recent…
A sampling-based method is introduced to approximate the Gittins index for a general family of alternative bandit processes. The approximation consists of a truncation of the optimization horizon and support for the immediate rewards, an…
A discrete rotation algorithm can be apprehended as a parametric application $f\_\alpha$ from $\ZZ[i]$ to $\ZZ[i]$, whose resulting permutation ``looks like'' the map induced by an Euclidean rotation. For this kind of algorithm, to be…
A numerical approach to compute tensor integrals in one-loop calculations is presented. The algorithm is based on a recursion relation which allows to express high rank tensor integrals as a function of lower rank ones. At each level of…
In this paper, we develop new identities for the inverse tangent integral by connecting it to the dilogarithmic (polylogarithmic) structure and to a carefully designed auxiliary arctangent integral $Ti_2(a)$ with a tunable endpoint. The…
Through an inversion approach, we suggest a possible estimation for the absolute value of Mertens function $\vert M(x) \vert$ that $ \left\vert M(x) \right\vert \sim \left[\frac{1}{\pi \sqrt{\varepsilon}(x+\varepsilon)}\right]\sqrt{x}$…
A dispersive analysis of $\eta\to 3\pi$ decays has been performed in the past by many authors. The numerical analysis of the pertinent integral equations is hampered by two technical difficulties: i) The angular averages of the amplitudes…
The primary purpose of this article is to study the asymptotic and numerical estimates in detail for higher degree polynomials in $\pi(x)$ having a general expression of the form, \begin{align*} P(\pi(x)) - \frac{e x}{\log x} Q(\pi(x/e)) +…
In this paper, we introduce an inertial version of the Proximal Incremental Aggregated Gradient method (PIAG) for minimizing the sum of smooth convex component functions and a possibly nonsmooth convex regularization function.…
As an application of Cauchy's Theorem we prove that $\int_0^1\arctan\left({\arctanh x-\arctan x\over \pi+\arctanh x-\arctan x}\right) {dx\over x}= {\pi\over 8}\log{\pi^2\over 8}$ answering a question first posted in Mathematics Stack…
In this note, we show that the values of integrals of the log-tangent function with respect to any square-integrable function on $\left[0 , \frac{\pi}{2} \right]$ may be determined by a finite or infinite sum involving the Riemann…
Ootomo, Ozaki, and Yokota [Int. J. High Perform. Comput. Appl., 38 (2024), p. 297-313] have proposed a strategy to recast a floating-point matrix multiplication in terms of integer matrix products. The factors A and B are split into integer…
Sometimes only some digits of a numerical product or some terms of a polynomial or series product are required. Frequently these constitute the most significant or least significant part of the value, for example when computing initial…
We describe a rigorous implementation of the Lagarias and Odlyzko Analytic Method to evaluate the prime counting function and its use to compute unconditionally the number of primes less than $10^{24}$.
Using a self-replicating method, we generalize with a free parameter some Borwein algorithms for the number $\pi$. This generalization includes values of the Gamma function like $\Gamma(1/3)$, $\Gamma(1/4)$ and of course…
Recently Raayoni et al. announced various conjectures on continued fractions of fundamental constants automatically generated with machine learning techniques. In this paper we prove some of their stated conjectures for Euler number $e$ and…
In this paper we give another proof of the Chudnovsky formula for calculating $\pi$ - a proof in detail with means of basic complex analysis. With the exception of the tenth chapter, the proof is self-contained, with proofs provided for all…
In this paper we propose a novel efficient algorithm for calculating winding numbers, aiming at counting the number of roots of a given polynomial in a convex region on the complex plane. This algorithm can be used for counting and…