zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Convergence of the modified Mann’s iteration method for asymptotically strict pseudo-contractions. (English) Zbl 1220.47100
Summary: Let C be a closed convex subset of a real Hilbert space H and assume that T is an asymptotically κ-strict pseudo-contraction on C with a fixed point, for some 0κ<1. Given an initial guess x 0 C and a real sequence {α n } in (0,1), the modified Mann algorithm generates a sequence {x n } via the formula: x n+1 =α n x n +(1-α n )T n x n , n0. It is proved that if the control sequence {α n } is chosen so that κ+δ<α n -δ for some δ(0,1), then {x n } converges weakly to a fixed point of T. We also modify this iteration method by applying projections onto suitably constructed closed convex sets to get an algorithm which generates a strongly convergent sequence.

MSC:
47J25Iterative procedures (nonlinear operator equations)
47H09Mappings defined by “shrinking” properties
65J15Equations with nonlinear operators (numerical methods)