Related papers: A BBP-style computation for $\pi$ in base 5
A subalgebraic approximation algorithm is proposed to estimate from a set of time series the parameters of the observer representation of a discrete-time polynomial system without inputs which can generate an approximation of the observed…
There exist many applications where it is necessary to approximate numerically derivatives of a function which is given by a computer procedure. In particular, all the fields of optimization have a special interest in such a kind of…
Calculating dipole moments with high-order basis sets is generally only possible for the light molecules, such as water. A simple, yet highly effective strategy of obtaining high-order dipoles with small, computationally less expensive…
Let $b \ge 2$ be an integer. Not much is known on the representation in base $b$ of prime numbers or of numbers whose prime factors belong to a given, finite set. Among other results, we establish that any sufficiently large integer which…
In the following article we consider approximate Bayesian computation (ABC) for certain classes of time series models. In particular, we focus upon scenarios where the likelihoods of the observations and parameter are intractable, by which…
The LS-sequences of points recently introduced by the author are a generalization of van der Corput sequences. They were constructed by reordering the points of the corresponding LS-sequences of partitions. Here we present another algorithm…
We develop summation by parts (SBP) approach for generating high-order finite-difference schemes on the interval and propose new sets of schemes up to the 12th order. The coefficients of the schemes are governed by values of grid spacing…
Roughly speaking, Buckingham's $\Pi$-Theorem provides a method to "guess" the structure of physical formulas simply by studying the dimensions (the physical units) of the involved quantities. Here we will prove a quantitative version of…
We derive a straightening-free algorithm that computes the canonical bases of any higher-level q-deformed Fock space.
In this work, we prove the irrationality of $\pi$ based on the nested radicals with roots of $2$ of kind $c_k = \sqrt{2 + c_{k - 1}}$ and $c_0 = 0$. Sample computations showing how the rational approximation tends to $\pi$ with increasing…
We investigate the problem of finding integers $k$ such that appending any number of copies of the base-ten digit $d$ to $k$ yields a composite number. In particular, we prove that there exist infinitely many integers coprime to all digits…
In a multi-base representation of an integer (in contrast to, for example, the binary or decimal representation) the base (or radix) is replaced by products of powers of single bases. The resulting numeral system has desirable properties…
A python code (mvp.py) is presented for computing the mean-value point (MVP) in the Brillouin zone first introduced by Baldereschi [1]. The code allows calculations of the MVP for any input crystal structure. Having MVP allows approximating…
The calculation of many and large Perrin pseudoprimes is a challenge. This is mainly due to their rarity. Perrin pseudoprimes are one of the rarest known pseudoprimes. In order to calculate many such large numbers, one needs not only a fast…
Border bases, a generalization of Groebner bases, have actively been researched during recent years due to their applicability to industrial problems. A. Kehrein and M. Kreuzer formulated the so called Border Basis Algorithm, an algorithm…
The results of the study provide guidelines for the development and applications of algorithms. When the number of steps for calculating an assumption tends to infinity, probability theory can be applied to predict whether the assumption…
Approximate Bayesian computation (ABC) using a sequential Monte Carlo method provides a comprehensive platform for parameter estimation, model selection and sensitivity analysis in differential equations. However, this method, like other…
In this Note, we start off with the primary representation of e and from there present an elementary short proof for the Wallis formula for $\pi$.
In this article we propose a simple approach for the precision calculation of Bethe logarithm. The leading contributions are obtained using specific operators, while the remaining terms are eliminated by adjusting the parameter $\lambda$.…
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.…