Related papers: A fixed-point iteration method for the number Pi w…

By means of the telescoping method, we establish two sum- mation formulas on sine function. As the special cases of them, several interesting series expansions for $1/\pi^m$ and $\pi^m$.

In this paper we propose an algorithm that correctly discards a set of numbers (from a previously defined sieve) with an interval of integers. Leopoldo's Theorem states that the remaining integer numbers will generate and count the complete…

Algorithms for the computation of the real zeros of hypergeometric functions which are solutions of second order ODEs are described. The algorithms are based on global fixed point iterations which apply to families of functions satisfying…

Let $n$ and $k$ be positive integers with $n>k$. Given a permutation $(\pi_1,\ldots,\pi_n)$ of integers $1,\ldots,n$, we consider $k$-consecutive sums of $\pi$, i.e., $s_i:=\sum_{j=0}^{k-1}\pi_{i+j}$ for $i=1,\ldots,n$, where we let…

In our recent publication we have proposed a new methodology for determination of the two-term Machin-like formula for pi with small arguments of the arctangent function of kind $$ \frac{\pi }{4} = {2^{k - 1}}\arctan \left(…

This paper considers the $ p $ ($ p=1,2,3 $) order numerical differentiation on function $ y $ in $ (0,2\pi) $. They are transformed into corresponding Fredholm integral equation of the first kind. Computational schemes with analytic…

In this article, we propose a Krasnosel'ski\v{\i}-Mann-type algorithm for finding a common fixed point of a countably infinite family of nonexpansive operators $(T_n)_{n \geq 0}$ in Hilbert spaces. We formulate an asymptotic property which…

Iterative algorithms are fundamental tools for approximating fixed-points of nonexpansive operators in real Hilbert spaces. Among them, Krasnosel'ski\u{\i}--Mann iteration and Halpern iteration are two widely used schemes. In this work, we…

This paper focuses on regularisation methods using models up to the third order to search for up to second-order critical points of a finite-sum minimisation problem. The variant presented belongs to the framework of [3]: it employs random…

In this paper we present a method to derive Pi(x) and other Arithemtical functions that can be generated by a Dirichlet series by variational principles,we use a variational method to determine the solution for a Fredholm integral equation…

We consider accelerated versions of the operator Sinkhorn iteration (OSI) for solving scaling problems for completely positive maps. Based on the interpretation of OSI as alternating fixed point iteration, it has been recently proposed to…

We introduce a fixed point iteration process built on optimization of a linear function over a compact domain. We prove the process always converges to a fixed point and explore the set of fixed points in various convex sets. In particular,…

In our earlier publication we have shown how to compute by iteration a rational number ${u_{2,k}}$ in the two-term Machin-like formula for pi of kind…

In this paper we associate to any $LS$-sequence of partitions ${\rho_{L,S}^n}$ the corresponding $LS$-sequence of points ${\xi_{L,S}^n}$ obtained reordering the points of each partition with an explicit algorithm. The procedure begins with…

In this paper, an inexact proximal-point penalty method is studied for constrained optimization problems, where the objective function is non-convex, and the constraint functions can also be non-convex. The proposed method approximately…

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…

In this article, we introduce a recurrence formula which only involves two adjacent values of the Riemann zeta function at integer arguments. Based on the formula, an algorithm to evaluate $\zeta$-values(i.e. the values of Riemann zeta…

We apply a result of David and Jon Borwein to evaluate a sequence of highly-oscillatory integrals whose integrands are the products of a rapidly growing number of sinc functions. The value of each integral is given in the form $\pi(1-t)/2$,…

We propose a simple iterative (SI) algorithm for the maxcut problem through fully using an equivalent continuous formulation. It does not need rounding at all and has advantages that all subproblems have explicit analytic solutions, the cut…

Two common methods for solving absolute value equations (AVE) are SOR-like iteration method and fixed point iteration (FPI) method. In this paper, novel convergence analysis, which result wider convergence range, of the SOR-like iteration…