Related papers: A fixed-point iteration method for the number Pi w…
For scientific computations on a digital computer the set of real number is usually approximated by a finite set F of "floating-point" numbers. We compare the numerical accuracy possible with difference choices of F having approximately the…
This paper establishes the first-order convergence rate for the ergodic error of numerical approximations to a class of stochastic ODEs (SODEs) with superlinear coefficients and multiplicative noise. By leveraging the generator approach to…
The secant method is a very effective numerical procedure used for solving nonlinear equations of the form $f(x)=0$. In a recent work [A. Sidi, Generalization of the secant method for nonlinear equations. {\em Appl. Math. E-Notes},…
We present a fast convolution-based technique for computing an approximate, signed Euclidean distance function $S$ on a set of 2D and 3D grid locations. Instead of solving the non-linear, static Hamilton-Jacobi equation ($\|\nabla S\|=1$),…
In this paper, we establish sublinear and linear convergence of fixed point iterations generated by averaged operators in a Hilbert space. Our results are achieved under a bounded H\"older regularity assumption which generalizes the…
When proving the correctness of a method for slicing probabilistic programs, it was previously discovered by the authors that for a fixed point iteration to work one needs a non-standard starting point for the iteration. This paper presents…
The paper is concerned with efficient numerical methods for solving a linear system $\phi(A) x= b$, where $\phi(z)$ is a $\phi$-function and $A\in \mathbb R^{N\times N}$. In particular in this work we are interested in the computation of…
Unconstrained binary integer programming (UBIP) poses significant computational challenges due to its discrete nature. We introduce a novel reformulation approach using a piecewise cubic function that transforms binary constraints into…
We prove a polynomial continued fraction identity for the constant $-\pi/4$, conjectured by the Ramanujan Machine project. The proof proceeds by explicitly solving the underlying second-order linear difference equation. We derive a…
To infer a function value on a specific point $x$, it is essential to assign higher weights to the points closer to $x$, which is called local polynomial / multivariable regression. In many practical cases, a limited sample size may ruin…
We consider approximation of diameter of a set $S$ of $n$ points in dimension $m$. E$\tilde{g}$ecio$\tilde{g}$lu and Kalantari \cite{kal} have shown that given any $p \in S$, by computing its farthest in $S$, say $q$, and in turn the…
By a theorem of Gordon and Hedenmalm, $\varphi$ generates a bounded composition operator on the Hilbert space $\mathscr{H}^2$ of Dirichlet series $\sum_n b_n n^{-s}$ with square-summable coefficients $b_n$ if and only if $\varphi(s)=c_0…
In this paper, we introduce a new iteration method and show that this iteration method can be used to approximate fixed point of almost contraction mappings. Furthermore, we prove that the new iteration method is equivalent to both Mann…
In this paper, we obtain coupled fixed point theorem for (\psi, \phi)-contractions under some generalized conditions on the real valued functions \psi and \phi defined on (0,\infinity). Also, we present a generalized version of coupled…
A new deterministic floating-point arithmetic called precision arithmetic is developed to track precision for arithmetic calculations. It uses a novel rounding scheme to avoid excessive rounding error propagation of conventional…
In this paper, we introduce and study a new extragradient iterative process for finding a common element of the set of fixed points of an infinite family of nonexpansive mappings and the set of solutions of a variational inequality for an…
We describe a simple Monte Carlo method for estimating $\pi$ by tossing a coin. Although the underlying Catalan-number series identities appear implicitly in the probability theory literature, the interpretation of $\frac{\pi}{4}$ presented…
Many algorithms feature an iterative loop that converges to the result of interest. The numerical operations in such algorithms are generally implemented using finite-precision arithmetic, either fixed- or floating-point, most of which…
We derive normal approximation results for a class of stabilizing functionals of binomial or Poisson point process, that are not necessarily expressible as sums of certain score functions. Our approach is based on a flexible notion of the…
In the renormalisation analysis of critical phenomena in quasi-periodic systems, a fundamental role is often played by fixed points of functional recurrences of the form \begin{equation*} f_{n}(x) = \sum_{i=1}^\ell a_i(x) f_{n_i}…