Access

You are not currently logged in.

Access JSTOR through your library or other institution:

login

Log in through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Journal Article

Iterative Approximation of Fixed Points of Lipschitzian Strictly Pseudo-Contractive Mappings

C. E. Chidume
Proceedings of the American Mathematical Society
Vol. 99, No. 2 (Feb., 1987), pp. 283-288
DOI: 10.2307/2046626
Stable URL: http://www.jstor.org/stable/2046626
Page Count: 6
Were these topics helpful?
See somethings inaccurate? Let us know!

Select the topics that are inaccurate.

Cancel
  • Read Online (Free)
  • Download ($30.00)
  • Subscribe ($19.50)
  • Add to My Lists
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Iterative Approximation of Fixed Points of Lipschitzian Strictly Pseudo-Contractive Mappings
Preview not available

Abstract

Suppose $X = L_p (\text{or}\quad l_p), p \geq 2$, and K is a nonempty closed convex bounded subset of X. Suppose T: K → K is a Lipschitzian strictly pseudo-contractive mapping of K into itself. Let $\{C_n \}^\infty_{n = 0}$ be a real sequence satisfying: (i) $0 < C_n < 1$ for all n ≥ 1, (ii) $\sum^\infty_{n = 1} C_n = \infty,\quad\text{and}$ (iii) $\sum^\infty_{n = 1} C^2_n < \infty.$ Then the iteration process, x0 ∈ K, xn + 1 = (1 - Cn)xn + CnTx n for n ≥ 1, converges strongly to a fixed point of T in K.

Page Thumbnails

  • Thumbnail: Page 
283
    283
  • Thumbnail: Page 
284
    284
  • Thumbnail: Page 
285
    285
  • Thumbnail: Page 
286
    286
  • Thumbnail: Page 
287
    287
  • Thumbnail: Page 
288
    288