Search

In this paper, we propose a new simultaneous iterative algorithm for solving the split common fixed point problem of directed operators. Inspired by the idea of cyclic iterative algorithm, we also introduce two iterative algorithms which combine the process of cyclic and simultaneous together. Under mild assumptions, we prove convergence of the proposed iterative sequences. As applications, we obtain several iteration schemes to solve the inverse problem of multiple-sets split feasibility problem. Numerical experiments are presented to confirm the efficiency of the proposed iterative algorithms. [ABSTRACT FROM AUTHOR]

Let,andbe real Hilbert spaces, letandbe two bounded linear operators. Moudafi introduced simultaneous iterative algorithms with weak convergence for the following split common fixed-point problem:Section.Displaywhereandare two firmly quasi-nonexpansive operators with nonempty fixed-point setsand. Note that, by takingand, we recover the split common fixed-point problem originally introduced by Cesnor and Segal. However, to employ Moudafi’s algorithms, one needs to know a prior norm (or at least an estimate of the norm) of the bounded linear operators. To estimate the norm of an operator is very difficult, if it is not an impossible task. In this paper, we will continue to consider the split common fixed-point problem (1) governed by the general class of quasi-nonexpansive operators. We introduce a simultaneous iterative algorithm with a way of selecting the stepsizes such that the implementation of the algorithm does not need any prior information about the operator norms. The weak convergence result of algorithm is obtained and some applied nonlinear analysis examples are stated. [ABSTRACT FROM AUTHOR]

In this paper, we propose hybrid implicit and explicit viscosity iterative algorithms for solving general hierarchical fixed-point problems for a countable family of non-expansive mappings in uniformly smooth Banach spaces. These hybrid viscosity algorithms are based on the well-known viscosity approximation method and hybrid steepest-descent method. We obtain some strong convergence theorems under suitable conditions. Our results extend, improve, supplement and develop the recent results in the literature. [ABSTRACT FROM PUBLISHER]

In this article, a recently introduced iterative method based on Green's functions and fixed-point iteration schemes is presented for the approximate solutions of delay and functional differential equations. The approach is especially suited for handling boundary value problems (BVPs). The algorithm is illustrated through a number of examples that confirm the high accuracy and efficiency of the strategy. The results of the test examples show excellent agreement with exact solutions and outperforms other existing numerical iterative schemes. [ABSTRACT FROM AUTHOR]

In this article, we deal with an iteration method for approximating a fixed point of a contraction mapping using Mann’s algorithm under functional random errors. We first show its almost complete convergence to the fixed point by mean of an exponential inequality and then we specify the induced rate of convergence. We finally build a confidence domain for the fixed point. Moreover, some numerical examples are considered. [ABSTRACT FROM AUTHOR]

We propose an iterative scheme for finding a common element of fixed points set of a nonexpansive mapping and the solutions set of a generalized variational inequality problem in Euclidean space. Under some mild conditions, we establish the convergence theorem for the proposed algorithm. We also give a suitable condition to ensure the intersection of fixed points set of a nonexpansive mapping and the solutions set of a generalized variational inequality problem to be nonempty. In addition, under certain error bound conditions, we prove the convergence rate of the iterative sequence. Preliminary computational experience is also reported. [ABSTRACT FROM AUTHOR]