Related papers: Mean Value-Mann Iterative Process
We introduce a new extragradient iterative process, motivated and inspired by [S. H. Khan, A Picard-Mann Hybrid Iterative Process, Fixed Point Theory and Applications, doi:10.1186/1687-1812-2013-69], for finding a common element of the set…
In this paper we apply proof mining techniques to compute, in the setting of CAT$(\kappa)$ spaces (with $\kappa >0$), effective and highly uniform rates of asymptotic regularity and metastability for a nonlinear generalization of the…
This paper discusses a general Aitken delta-squared generalized Jungck-modified iterative scheme. The study applies generalized versions of Aitken delta squared procedure and Venter theorem to discuss positivity and global stability of the…
The aim of this paper is to introduce an implicit S-iteration process and study its convergence in the framework of W-hyperbolic spaces. We show that the implicit S-iteration process has higher rate of convergence than implicit Mann type…
High-frequency sampled multivariate continuous time autoregressive moving average processes are investigated. We obtain asymptotic expansion for the spectral density of the sampled MCARMA process $(Y_{n\Delta})_{n \in \mathbb{Z}}$ as…
We consider the evolution by inverse mean curvature flow of a closed, mean convex and star-shaped hypersurface in the complex hyperbolic space. We prove that the flow is defined for any positive time, the evolving hypersurface stays…
Value Iteration is a widely used algorithm for solving Markov Decision Processes (MDPs). While previous studies have extensively analyzed its convergence properties, they primarily focus on convergence with respect to the infinity norm. In…
Markov decision processes are widely used for planning and verification in settings that combine controllable or adversarial choices with probabilistic behaviour. The standard analysis algorithm, value iteration, only provides a lower bound…
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…
For a family of quasi-arithmetic means satisfying certain smoothness condition we majorize the speed of convergence of the iterative sequence of self-mappings having a mean on each entry, described in the definition of Gaussian product, to…
This paper provides a fixed point theorem for asymptotically nonexpansive mappings in uniformly convex hyperbolic spaces as well as new effective results on the Krasnoselski-Mann iterations of such mappings. The latter were found using…
The Krasnosel'ski\u{\i}--Mann and Halpern iterations are classical schemes for approximating fixed points of nonexpansive mappings in Banach spaces, and have been widely studied in more general frameworks such as $CAT(\kappa)$ and, more…
We investigate an iterative mean value method for the inverse (and highly ill-posed) problem of solving the heat equation backwards in time. Semi-group theory is used to rewrite the solution of the inverse problem as the solution of a fixed…
A class of extended Ishikowa Iterative processes is proposed and studied, which involves many kinds of Mann and Ishikawa iterative processes. The main conclusion of the present work extends and generalizes some recent results of this…
This paper is a continuation to the study of generalized quasi contractive operators, essentially due to Akhtar et al. [A multi-step implicit iterative process for common fixed points of generalized C^{q}-operators in convex metric spaces,…
We prove the mean ergodic theorem of von Neumann in a Hilbert-Kaplansky space. We also prove a multiparameter, modulated, subsequential and a weighted mean ergodic theorems in a Hilbert-Kaplansky space
The mean shift algorithm is a non-parametric and iterative technique that has been used for finding modes of an estimated probability density function. It has been successfully employed in many applications in specific areas of machine…
In this paper, we consider a new iteration process which is faster than all of Picard, Mann, Ishikawa and Agarwal et al. processes. We also prove some strong and weak convergence theorems for the class of nonexpansive mappings in Banach…
Iterative methods are ubiquitous in large-scale scientific computing applications, and a number of approaches based on meta-learning have been recently proposed to accelerate them. However, a systematic study of these approaches and how…
Atomistic modelling of phase transitions, chemical reactions, or other rare events that involve overcoming high free energy barriers usually entails prohibitively long simulation times. Introducing a bias potential as a function of an…