In this paper, we study a multi-step iterative scheme with errors involving N nonexpansive mappings in the Banach space. Some weak and strong convergence theorems for approximation of common fixed points of nonexpansive mappings are proved using this iteration scheme. The results extend and improve the corresponding results of [1].

In this paper, we proposed a new two-step iteration scheme of hybrid mixed type for two asymptotically nonexpansive self mappings and two total asymptotically nonexpansive non-self mappings and establish some weak convergence theorems for mentioned scheme and mappings in the setting of uniformly convex Banach spaces. Our results extend and generalize several results from the current existing li...

As a newly emerging and significant topic in computer vision community, co-saliency detection aims at discovering the common salient objects in multiple related images. The existing methods often generate the co-saliency map through a direct forward pipeline which is based on the designed cues or initialization, but lack the refinement-cycle scheme. Moreover, they mainly focus on RGB image and ...

We introduce a modified Noor iteration scheme generated by an infinite family of strict pseudo-contractive mappings and prove the strong convergence theorems of the scheme in the framework of q−uniformly smooth and strictly convex Banach space. Results shown here are extensions and refinements of previously known results.

The paper presents a scheme of code generation for vector expressions implemented in the CC] compiler (CC] is a vector ANSI C superset aimed at vector and superscalar architectures). The scheme is based on two well-known optimization techniques { loop invariant code motion and iteration space tiling. The problem of nding the optimal tile size for the imperfectly nested loop system implementing ...

We consider the infinite-horizon γ-discounted optimal control problem formalized by Markov Decision Processes. Running any instance of Modified Policy Iteration—a family of algorithms that can interpolate between Value and Policy Iteration—with an error at each iteration is known to lead to stationary policies that are at least 2γ (1−γ)2 -optimal. Variations of Value and Policy Iteration, that ...

In this paper we deal with the problem of reducing the computational cost of a Genetic Based Machine Learning (GBML) system based on the Pittsburgh Approach. In previous work we studied an incremental learning scheme that divided the training set in several strata and changed the used strata at each iteration. This scheme reduced the computational cost more than expected and even managed to imp...

A numerical scheme is presented to compute the response of a composite material to an applied eld. The scheme is based on an iteration that uses a Fourier transform based projection method to compute the response of a reference material to the applied eld, and a contraction mapping to relate the response of the reference material to the response of the composite material. The scheme also utiliz...

We present an effective preconditioning technique for solving the nonsymmetric linear systems encountered in computation of incompressible flows in long domains. The application category we focus on is arterial fluid mechanics. These linear systems are solved using a nested iterative scheme with an outer Richardson scheme and an inner iteration that is handled via a Krylov subspace method. Test...

A novel iteration scheme, using boundary integral equations, is developed for error estimation in the boundary element method. The iteration scheme consists of using the boundary integral equation for solving the boundary value problem and iterating this solution with the hypersingular boundary integral equation to obtain a new solution. The hypersingular residual r is consistently defined as t...