Related papers: A fixed-point iteration method for the number Pi w…
We show a general method allowing the solution calculation, in the form of a power series, for a very large class of nonlinear Ordinary Differential Equations (ODEs), namely the real analytic $\sigma\pi$-ODEs (and, more in general, the real…
Prime number theorem asserts that (at large $x$) the prime counting function $\pi(x)$ is approximately the logarithmic integral $\mbox{li}(x)$. In the intermediate range, Riemann prime counting function $\mbox{Ri}^{(N)}(x)=\sum_{n=1}^N…
In this paper we consider the computation of approximate solutions for inverse problems in Hilbert spaces. In order to capture the special feature of solutions, non-smooth convex functions are introduced as penalty terms. By exploiting the…
We propose a new method of adaptive piecewise approximation based on Sinc points for ordinary differential equations. The adaptive method is a piecewise collocation method which utilizes Poly-Sinc interpolation to reach a preset level of…
Floating-point arithmetic performance determines the overall performance of important applications, from graphics to AI. Meeting the IEEE-754 specification for floating-point requires that final results of addition, subtraction,…
In this paper we obtain some novel identities involving trigonometric functions. Let $n$ be any positive odd integer. We show that $$\sum_{r=0}^{n-1}\frac1{1+\sin2\pi\frac{x+r}n+\cos2\pi\frac{x+r}n}…
In this paper, we investigate the trade-off between convergence rate and computational cost when minimizing a composite functional with proximal-gradient methods, which are popular optimisation tools in machine learning. We consider the…
We describe a method of integration to obtain identities of the arctangent function and show how this method can be applied to the high-accuracy computation of the constant pi using the equation $\pi = 4 \arctan \left( 1 \right)$. Our…
We present a new form of the Machin-like formula for $\pi$ that can be generated by using iteration. This form of the Machin-like formula may be promising for computation of the constant $\pi$ due to rapidly increasing integers at each step…
We say that a permutation $\pi=\pi_1\pi_2\cdots \pi_n \in \mathfrak{S}_n$ has a peak at index $i$ if $\pi_{i-1} < \pi_i > \pi_{i+1}$. Let $\mathcal{P}(\pi)$ denote the set of indices where $\pi$ has a peak. Given a set $S$ of positive…
We present the Deep Picard Iteration (DPI) method, a new deep learning approach for solving high-dimensional partial differential equations (PDEs). The core innovation of DPI lies in its use of Picard iteration to reformulate the typically…
We show that there exists a positive arithmetical formula $\psi(x,R)$, where $x \in \omega$, $R \subseteq \omega$, with no hyperarithmetical fixed point. This answers a question of Gerhard J\"{a}ger. As corollaries we obtain results on the…
This manuscript presents a novel and reliable third-order iterative procedure for computing the zeros of solutions to second-order ordinary differential equations. By approximating the solution of the related Riccati differential equation…
Approximating a definite integral of product of cosines to within an accuracy of n binary digits where the integrand depends on input integers x[k] given in binary radix, is equivalent to counting the number of equal-sum partitions of the…
In this paper we use a theorem first proved by S.W.Golomb and a famous inequality by J.B. Rosser and L.Schoenfeld in order to prove that there exists an exact formula for $\pi(n)$ which holds infinitely often.
In this work, we deal with an iteration method for approximating a fixed point of a contraction mapping using the Mann's algorithm under functional random errors. We first show its almost complete convergence to the fixed point by mean of…
We present a simple recurrent formula to generate the Machin-like expression for calculating $\pi/4$. The method works for any denominator in the starting term and always provides a finite decomposition. We show that the terms in the…
The aim of this paper is to give strict fixed point principles for multivalued operators $T:X\rightarrow P(X)$ satisfying some contraction conditions of \'Ciri\' c and of \'Ciri\' c-Reich-Rus type. We are interested, under which conditions,…
The common fixed points problem requires finding a point in the intersection of fixed points sets of a finite collection of operators. Quickly solving problems of this sort is of great practical importance for engineering and scientific…
In this paper, we provide a comprehensive solution to the open problem regarding the existence of a recurrence formula for computing fixed points of the Josephus function precisely when the reduction constant is three. Incorporating this…