This paper studies proofs of strong convergence of various iterative algorithms for computing
the unique zeros of set-valued accretive operators that also satisfy some weak form of …

We present the first applications of proof mining to the theory of partial differential equations
as well as to set-valued operators in Banach spaces, in particular to abstract Cauchy …

We extract explicit, computable, and highly uniform rates for the strong convergence of the
resolvents of set-valued, m-accretive, and uniformly accretive at zero/ϕ-expansive operators …

Constructing zeros of accretive operators<xref ref-type='fn' rid='FN0001'></xref> Page 1
Applzcubie Annljsis. 1979. Vol. 8, pp. 349-352 0 Gordon and Breach Sclence Pubhshers Ltd …

Accretive and monotone operator theory are central branches of nonlinear functional
analysis and constitute the abstract study of certain set-valued mappings between function …

A generalized method of alternating resolvents was introduced by Boikanyo and Moro {\cs}
anu as a way to approximate common zeros of two maximal monotone operators. In this …

In this paper, we study some iterative algorithms for finding common zeros of finite family of
accretive operators in Banach spaces. Our results improve the recent results of Kim and …

Given two real sequences (rn) and (α n), we study the iterative scheme: x n+ 1= α n u+(1-α n)
J rnxn, for finding a zero of an accretive operator A, where u is a fixed element and J rn …

In a preceding paper we proved a convergence theorem for an implicit iterative scheme, and
then applied it to an explicit one. In the present paper we study a modification of this …

We further develop the theoretical framework of proof mining, a program in mathematical
logic that seeks to quantify and extract computational information from prima facienon …