Related papers: A fixed-point iteration method for the number Pi w…
We give a positive answer to a question raised by Davis et al. ({\em Discrete Mathematics} 341, 2018), concerning permutations with the same pinnacle set. Given $\pi\in S_n$, a {\em pinnacle} of $\pi$ is an element $\pi_i$ ($i\neq 1,n$)…
The prime-counting function $\pi(x)$ which computes the number of primes smaller or equal to a given real number has a long-standing interest in number theory. The present manuscript proposes a method to compute $\pi(x)$ with time…
Let $a\in \mathbb{R}^{+}\backslash\left\{0\right\}$ and $M\in\mathbb{N}$. We consider the equation $t^M-a=0$, which is equivalent to $1-\frac{t^M}{a}=0\,.$ The real solution is $\sqrt[M]{a}$. In this publication, we present a method that…
Considering the large number of fractional operators that exist, and since it does not seem that their number will stop increasing soon at the time of writing this paper, it is presented for the first time, as far as the authors know, a…
Finite-precision arithmetic computations face an inherent tradeoff between accuracy and efficiency. The points in this tradeoff space are determined, among other factors, by different data types but also evaluation orders. To put it simply,…
In this paper, we discuss a new iterative method for computing $\sin_{p}$. This function was introduced by Lindqvist in connection with the unidimensional nonlinear Dirichlet eigenvalue problem for the $p$-Laplacian. The iterative technique…
In this article, we develop nested representations for cosine and inverse cosine functions, which is a generalization of Vi\`{e}te's formula for $\pi$. We explore a natural inverse relationship between these representations and develop…
Initiated by Davis, Nelson, Petersen and Tenner (2018), the enumerative study of pinnacle sets of permutations has attracted a fair amount of attention recently. In this article, we provide a recurrence that can be used to compute…
We present a simple but efficient method of calculating Stieltjes constants at a very high level of precision, up to about 80000 significant digits. This method is based on the hypergeometric-like expansion for the Riemann zeta function…
Stein's unbiased risk estimator (SURE) has been shown to be an effective metric for determining optimal parameters for many applications. The topic of this article is focused on the use of SURE for determining parameters for blind…
We address the general mathematical problem of computing the inverse $p$-th root of a given matrix in an efficient way. A new method to construct iteration functions that allow calculating arbitrary $p$-th roots and their inverses of…
This paper describes a systematic method of numerically computing and indexing fixed points of $z^{z^w}$ for fixed $z$ or equivalently, the roots of $T_2(w;z)=w-z^{z^w}$. The roots are computed using a modified version of fixed-point…
We study Sinkhorn's algorithm for solving the entropically regularized optimal transport problem. Its iterate $\pi_{t}$ is shown to satisfy $H(\pi_{t}|\pi_{*})+H(\pi_{*}|\pi_{t})=O(t^{-1})$ where $H$ denotes relative entropy and $\pi_{*}$…
In this paper, we develop a novel analytic method to prove the prime number theorem in de la Vall\'ee Poussin's form: $$ \pi(x)=\operatorname{li}(x)+\mathcal O(xe^{-c\sqrt{\log x}}) $$ Instead of performing asymptotic expansion on Chebyshev…
Significant inaccuracy often occurs during the process of mathematical calculation due to the digit limitation of floating point, which may lead to catastrophic loss. Normally, people believe that adjustment of floating-point precision is…
This paper discusses a few main topics in Number Theory, such as the M\"{o}bius function and its generalization, leading up to the derivation of neat power series for the prime counting function, $\pi(x)$, and the prime-power counting…
In our recent publications we have introduced the incomplete cosine expansion of the sinc function for efficient application in sampling [Abrarov & Quine, Appl. Math. Comput., 258 (2015) 425-435; Abrarov & Quine, J. Math. Research, 7 (2)…
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)) +…
We introduce a new iteration method called Picard-S iteration. We show that the Picard-S iteration method can be used to approximate fixed point of contraction mappings. Also, we show that our new iteration method is equivalent and…
In this paper, we propose and analyze a fast two-point gradient algorithm for solving nonlinear ill-posed problems, which is based on the sequential subspace optimization method. A complete convergence analysis is provided under the…