Posts by Stefan Soltuz

Abstract

For \(T\) a direct pseudocontractive map, we prove the convergence of Mann iteration to the fixed point of \(T\). In this note we introduce a new class of maps. Let \(X\) be a real normed space, and \(B\subset X\) be a nonemepty set. The map \(T:B\rightarrow B\) is direct pseudocontractive if there exists \(k\in \left( 0,1\right)\) such that%

\[
\left \Vert T_{x}-T_{y}\right \Vert ^{2}\leq k\left \Vert x-y\right \Vert
^{2}+\left \Vert \left( I-T\right) x-\left( I-T\right) y\right \Vert
^{2},\forall x,y\in B.
\]

For \(T\) a direct pseudocontractive map , we prove the convergence of Mann iteration to the fixed point of \(T\).

Authors

S.M. Soltuz
Tiberiu Popoviciu Institute of Numerical Analysis

Keywords

pseudocontractive maps; fix ponts; iterative method; convergence

Paper coordinates

Ş.M. Şoltuz, Mann iteration for direct pseudocontractive maps, Bull. Stiint. Univ. Baia Mare, Ser. B, Fasc. Mat.-Inform., 17 (2001) nos. 1-2, 141-144.

PDF

About this paper

Journal

Scientific Bulletin of the University of Baia Mare, Series B, Mathematics-Informatics Fascicola

Publisher Name

University Baia Mare, Romania

DOI
Print ISSN
Online ISSN

3045-1833

google scholar link

??

Paper (preprint) in HTML form

2001-Soltuz-MC-Mann-iteration-b- html,body { width: 100%; height: 100%; } *, *::before,*::after { box-sizing: border-box; } body { margin: 0; color: #1E2029; font-size: 14px; line-height: normal; } hr { box-sizing: content-box; height: 0; overflow: visible; } h1, h2, h3, h4, h5, h6 { margin-top: 0; margin-bottom: 0.5em; color: rgba(0, 0, 0, 0.85); font-weight: 500; } p { margin-top: 0; margin-bottom: 1em; } ol, ul, dl { margin-top: 0; margin-bottom: 1em; } ol ol, ul ul, ol ul, ul ol { margin-bottom: 0; } dt { font-weight: 500; } dd { margin-bottom: 0.5em; margin-left: 0; } blockquote { margin: 0 0 1em; } dfn { font-style: italic; } b, strong { font-weight: bolder; } small { font-size: 80%; } sub, sup { position: relative; font-size: 75%; line-height: 0; vertical-align: baseline; } sub { bottom: -0.25em; } sup { top: -0.5em; } a { color: #0B93ff; text-decoration: none; background-color: transparent; outline: none; cursor: pointer; transition: color 0.3s; } a:hover { color: #33aaff; } a:active { color: #0070d9; } a:active, a:hover { text-decoration: none; outline: 0; } a[disabled] { color: rgba(0, 0, 0, 0.25); cursor: not-allowed; pointer-events: none; } pre, code, kbd, samp { font-size: 1em; } pre { margin-top: 0; margin-bottom: 1em; overflow: auto; } figure { margin: 0 0 1em; } img { vertical-align: middle; border-style: none; } svg:not(:root) { overflow: hidden; } table { border-collapse: collapse; } caption { padding-top: 0.75em; padding-bottom: 0.3em; color: rgba(0, 0, 0, 0.45); text-align: left; caption-side: bottom; } th { text-align: inherit; } mjx-container[jax="SVG"] { direction: ltr; } mjx-container[jax="SVG"] > svg { overflow: visible; min-height: 1px; min-width: 1px; } mjx-container[jax="SVG"] > svg a { fill: blue; stroke: blue; } mjx-assistive-mml { position: absolute !important; top: 0px; left: 0px; clip: rect(1px, 1px, 1px, 1px); padding: 1px 0px 0px 0px !important; border: 0px !important; display: block !important; width: auto !important; overflow: hidden !important; -webkit-touch-callout: none; -webkit-user-select: none; -khtml-user-select: none; -moz-user-select: none; -ms-user-select: none; user-select: none; } mjx-assistive-mml[display="block"] { width: 100% !important; } mjx-container[jax="SVG"][display="true"] { display: block; text-align: center; margin: 1em 0; } mjx-container[jax="SVG"][display="true"][width="full"] { display: flex; } mjx-container[jax="SVG"][justify="left"] { text-align: left; } mjx-container[jax="SVG"][justify="right"] { text-align: right; } g[data-mml-node="merror"] > g { fill: red; stroke: red; } g[data-mml-node="merror"] > rect[data-background] { fill: yellow; stroke: none; } g[data-mml-node="mtable"] > line[data-line], svg[data-table] > g > line[data-line] { stroke-width: 70px; fill: none; } g[data-mml-node="mtable"] > rect[data-frame], svg[data-table] > g > rect[data-frame] { stroke-width: 70px; fill: none; } g[data-mml-node="mtable"] > .mjx-dashed, svg[data-table] > g > .mjx-dashed { stroke-dasharray: 140; } g[data-mml-node="mtable"] > .mjx-dotted, svg[data-table] > g > .mjx-dotted { stroke-linecap: round; stroke-dasharray: 0,140; } g[data-mml-node="mtable"] > g > svg { overflow: visible; } [jax="SVG"] mjx-tool { display: inline-block; position: relative; width: 0; height: 0; } [jax="SVG"] mjx-tool > mjx-tip { position: absolute; top: 0; left: 0; } mjx-tool > mjx-tip { display: inline-block; padding: .2em; border: 1px solid #888; font-size: 70%; background-color: #F8F8F8; color: black; box-shadow: 2px 2px 5px #AAAAAA; } g[data-mml-node="maction"][data-toggle] { cursor: pointer; } mjx-status { display: block; position: fixed; left: 1em; bottom: 1em; min-width: 25%; padding: .2em .4em; border: 1px solid #888; font-size: 90%; background-color: #F8F8F8; color: black; } foreignObject[data-mjx-xml] { font-family: initial; line-height: normal; overflow: visible; } mjx-container[jax="SVG"] path[data-c], mjx-container[jax="SVG"] use[data-c] { stroke-width: 3; } #setText > div { justify-content: inherit; margin-top: 0; margin-bottom: 1em; } #setText div:last-child { margin-bottom: 0 !important; } #setText > br, #preview-content br { line-height: 1.2; } #preview-content > div { margin-top: 0; margin-bottom: 1em; } .proof > div, .theorem > div { margin-top: 1rem; } #preview-content table { margin-bottom: 1em; } #setText table { margin-bottom: 1em; } #preview-content .sub-table table, #setText .sub-table table { margin-bottom: 0; } mjx-container { text-indent: 0; overflow-y: hidden; overflow-x: auto; padding-top: 1px; padding-bottom: 1px; } .math-inline mjx-container { display: inline-block !important; page-break-inside: avoid; max-width: 100%; padding: 0; line-height: 0; } .math-inline[data-overflow="visible"] mjx-container { overflow: visible; } .math-inline mjx-container mjx-assistive-mml { max-width: 100%; } .math-block { align-items: center; page-break-after: auto; page-break-inside: avoid; margin: 0; display: block; /* mjx-container has block */ } .math-inline { display: inline-flex; /* mjx-container has inline-block. To prevent displacement during use overflow-x: auto;*/ max-width: 100%; } .math-block[data-width="full"] { overflow-x: auto; display: flex; /* mjx-container has flex */ } svg .math-inline { display: initial; max-width: initial; } svg .math-inline mjx-container { max-width: initial; } svg mjx-container { overflow: visible; padding: 0; } svg math-block[data-width="full"] { overflow: visible; } .math-block,.math-inline { --mmd-highlight-color: rgba(0, 147, 255, 0.25); --mmd-highlight-text-color: #1e2029; } .math-block[data-highlight-color] mjx-container[jax="SVG"] > svg { background-color: var(--mmd-highlight-color); } .math-block[data-highlight-text-color] mjx-container[jax="SVG"] > svg { color: var(--mmd-highlight-text-color); } .math-inline[data-highlight-color] mjx-container[jax="SVG"] { background-color: var(--mmd-highlight-color); } .math-inline[data-highlight-text-color] mjx-container[jax="SVG"] { color: var(--mmd-highlight-text-color); } .math-block p { flex-shrink: 1; } .math-block mjx-container { margin: 0 !important; } .math-error { background-color: yellow; color: red; } #preview-content img, #setText img { max-width: 100%; } #preview-content blockquote, #setText blockquote { page-break-inside: avoid; color: #666; margin: 0 0 1em 0; padding-left: 3em; border-left: .5em solid #eee; } #preview-content pre, #setText pre { border: none; padding: 0; overflow: auto; font-size: 85%; line-height: 1.45; border-radius: 6px; box-sizing: border-box; background: #f8f8fa; } #preview-content pre code, #setText pre code{ padding: 1rem; display: block; overflow-x: auto; line-height: 24px; } .empty { text-align: center; font-size: 18px; padding: 50px 0 !important; } #setText table, #preview-content table { display: table; overflow: auto; max-width: 100%; border-collapse: collapse; page-break-inside: avoid; } #setText table th, #preview-content table th { text-align: center; font-weight: bold; } #setText table td, #preview-content table td, #setText table th, #preview-content table th { border: 1px solid #dfe2e5; padding: 6px 13px; } #setText table tr, #preview-content table tr { background-color: #fff; border-top: 1px solid #c6cbd1; } #setText table tr:nth-child(2n), #preview-content table tr:nth-child(2n) { background-color: #f6f8fa; } #preview-content .main-title, #setText .main-title { text-align: center; line-height: 1.2; margin: 0 auto 1em auto; } #preview-content .author, #setText .author { text-align: center; margin: 0 auto; display: flex; justify-content: center; flex-wrap: wrap; } #preview-content .author p, #setText .author p { min-width: 30%; max-width: 50%; padding: 0 7px; } #preview-content .author > p > span, #setText .author > p > span { display: block; text-align: center; } #preview-content .section-title, #setText .section-title { margin-top: 1.5em; } #preview-content .abstract, #setText .abstract { text-align: justify; margin-bottom: 1em; } #preview-content .abstract p, #setText .abstract p { margin-bottom: 0; } @media print { #preview { font-size: 10pt!important; } svg { shape-rendering: crispEdges; } .math-block svg, math-inline svg { margin-top: 1px; } #preview-content img, #setText img { display: block; } #preview-content .figure_img img, #setText .figure_img img { display: inline; } .preview-right { word-break: break-word; } #preview-content h1, #setText h1 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h1::after, #setText h1::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h2, #setText h2 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h2::after, #setText h2::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h3, #setText h3 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h3::after, #setText h3::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h4, #setText h4 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h4::after, #setText h4::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h5, #setText h5 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h5::after, #setText h5::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h6, #setText h6 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h6::after, #setText h6::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } } #preview-content sup, #setText sup { top: -.5em; position: relative; font-size: 75%; line-height: 0; vertical-align: baseline; } #preview-content .text-url, #setText .text-url { color: #0B93ff; cursor: text; pointer-events: none; } #preview-content .text-url a:hover, #setText .text-url a:hover { color: #0B93ff; } mark { background-color: #feffe6; } span[data-underline-type] mark { background: inherit; background-color: #feffe6; padding-top: 0; padding-bottom: 0; } *[data-has-dotfill] { position: relative; overflow: hidden; } *[data-has-dotfill] .dotfill::after { position: absolute; padding-left: .25ch; content: " . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . "; text-align: right; } .smiles { text-align: center; } div.svg-container, #setText > div.svg-container { display: flex; justify-content: center; } #preview-content code, #setText code { font-family: Inconsolata; font-size: inherit; display: initial; background: #f8f8fa; } #preview-content .mmd-highlight code, #setText .mmd-highlight code, #preview-content pre.mmd-highlight code, #setText pre.mmd-highlight code { background-color: transparent; } #preview-content pre code, #setText pre code { font-family: 'DM Mono', Inconsolata, monospace; color: #333; font-size: 15px; } .hljs-comment, .hljs-quote { color: #998; font-style: italic; } .hljs-command { color: #005cc5; } .hljs-keyword, .hljs-selector-tag, .hljs-subst { color: #d73a49; font-weight: bold; } .hljs-number, .hljs-literal, .hljs-variable, .hljs-template-variable, .hljs-tag .hljs-attr { color: #005cc5; } .hljs-string, .hljs-doctag { color: #24292e; } .hljs-title, .hljs-section, .hljs-selector-id { color: #6f42c1; font-weight: bold; } .hljs-subst { font-weight: normal; } .hljs-type, .hljs-class .hljs-title { color: #458; font-weight: bold; } .hljs-tag, .hljs-name, .hljs-attribute { color: #000080; font-weight: normal; } .hljs-regexp, .hljs-link { color: #009926; } .hljs-symbol, .hljs-bullet { color: #990073; } .hljs-built_in, .hljs-builtin-name { color: #24292e; } .hljs-meta { color: #999; font-weight: bold; } .hljs-meta-keyword { color: #d73a49; } .hljs-meta-string { color: #032f62; } .hljs-deletion { background: #fdd; } .hljs-addition { background: #dfd; } .hljs-emphasis { font-style: italic; } .hljs-strong { font-weight: bold; } .table_tabular table th, .table_tabular table th { border: none !important; padding: 6px 13px; } .tabular tr, .tabular tr { border-top: none !important; border-bottom: none !important; } .tabular td, .tabular td { border-style: none !important; background-color: #fff; border-color: #000 !important; word-break: keep-all; padding: 0.1em 0.5em !important; } .tabular { display: inline-table !important; height: fit-content; } .tabular td > p { margin-bottom: 0; margin-top: 0; } .tabular td._empty { height: 1.3em; } .tabular td .f { opacity: 0; } html[data-theme="dark"] .tabular tr, html[data-theme="dark"] .tabular td { background-color: #202226; border-color: #fff !important; } .table_tabular { overflow-x: auto; padding: 0 2px 0.5em 2px; } .figure_img { margin-bottom: 0.5em; overflow-x: auto; } ol.enumerate, ul.itemize { padding-inline-start: 40px; } /* It's commented because counter not supporting to change value ol.enumerate.lower-alpha { counter-reset: item ; list-style-type: none !important; } .enumerate.lower-alpha > li { position: relative; } .enumerate.lower-alpha > li:before { content: "("counter(item, lower-alpha)")"; counter-increment: item; position: absolute; left: -47px; width: 47px; display: flex; justify-content: flex-end; padding-right: 7px; flex-wrap: nowrap; word-break: keep-all; } */ .itemize > li { position: relative; min-height: 1.4em; } .itemize > li > span.li_level, .li_enumerate.not_number > span.li_level { position: absolute; right: 100%; white-space: nowrap; width: max-content;; display: flex; justify-content: flex-end; padding-right: 10px; box-sizing: border-box; } .li_enumerate.not_number { position: relative; display: inline-block; list-style-type: none; min-height: 1.4em; } .itemize > li > span.li_level .math-inline, .enumerate > li > span.li_level .math-inline { display: inline-block; } #preview { font-family: 'CMU Serif', 'Georgia', Helvetica, Arial, sans-serif; font-size: 17px; visibility: visible; word-break: break-word; padding: 2.5em; max-width: 800px; margin: auto; box-sizing: content-box; } #preview h1, #preview h2, #preview h3, #preview h4, #preview h5, #preview strong { font-family: 'CMU Serif Bold', 'Georgia', Helvetica, Arial, sans-serif; } #preview i, #preview em { font-family: 'CMU Serif Italic', 'Georgia', Helvetica, Arial, sans-serif; } .mmd-menu { max-width: 320px; position: absolute; background-color: white; color: black; width: auto; padding: 5px 0px; border: 1px solid #E5E6EB; margin: 0; cursor: default; font: menu; text-align: left; text-indent: 0; text-transform: none; line-height: normal; letter-spacing: normal; word-spacing: normal; word-wrap: normal; white-space: nowrap; float: none; z-index: 201; border-radius: 5px; -webkit-border-radius: 5px; -moz-border-radius: 5px; -khtml-border-radius: 5px; box-shadow: 0px 10px 20px #808080; -webkit-box-shadow: 0px 10px 20px #808080; -moz-box-shadow: 0px 10px 20px #808080; -khtml-box-shadow: 0px 10px 20px #808080; } .mmd-menu:focus { outline: none; } .mmd-menu.mmd-menu-sm { max-width: 100vw; padding-bottom: 34px; border-radius: 0; -webkit-border-radius: 0; -moz-border-radius: 0; -khtml-border-radius: 0; } .mmd-menu-item-icon { color: #1e2029; margin-left: auto; align-items: center; display: flex; flex-shrink: 0; display: none; } .mmd-menu-item { padding-bottom: 8px; padding-top: 8px; padding-left: 1.25rem; padding-right: 1.25rem; display: flex; background: transparent; height: 52px; max-height: 52px; } .mmd-menu-item:focus { outline: none; } .mmd-menu-item.active { background-color: #e1e0e5; } .mmd-menu-item.active .mmd-menu-item-icon { display: flex; } .mmd-menu-item-container { overflow: hidden; } .mmd-menu-item-title { color: #1e2029; white-space: nowrap; text-overflow: ellipsis; overflow: hidden; font-size: 14px; line-height: 20px; } .mmd-menu-item-value { color: #7d829c; white-space: nowrap; text-overflow: ellipsis; overflow: hidden; font-size: 12px; line-height: 16px; } html[data-theme="dark"] .mmd-menu-item-title { color: #ebefe7; } html[data-theme="dark"] .mmd-menu-item.active .mmd-menu-item-title { color: #1e2029; } html[data-theme="dark"] .mmd-menu { background-color: #33363a; } .mmd-context-menu-overlay{ background: rgba(0, 0, 0, 0.56); } .ClipboardButton { padding: 0; margin: 0.5rem; display: inline-block; cursor: pointer; color: rgb(36, 41, 47); background: rgb(246, 248, 250); border-radius: 6px; border: 1px solid rgba(31, 35, 40, 0.15); box-shadow: rgba(31, 35, 40, 0.04) 0 1px 0 0, rgba(255, 255, 255, 0.25) 0 1px 0 0 inset; position: relative; } .ClipboardButton:hover { background-color: rgb(243, 244, 246); border-color: rgba(31, 35, 40, 0.15); transition-duration: .1s; } td .mmd-clipboard-copy-container { line-height: 0; } td .ClipboardButton { margin: 1px; line-height: 0; } td .ClipboardButton .mmd-clipboard-icon { margin: 1px !important; transform: scale(0.6); } .mmd-clipboard-icon { fill: currentColor; vertical-align: text-bottom; } .mmd-clipboard-copy-icon { color: rgb(101, 109, 118); } .mmd-clipboard-check-icon { color: rgb(26, 127, 55); } .mmd-tooltipped-no-delay:hover::before, .mmd-tooltipped-no-delay:hover::after { animation-delay: 0s; } .mmd-tooltipped:hover::before, .mmd-tooltipped:hover::after { display: inline-block; text-decoration: none; animation-name: tooltip-appear; animation-duration: .1s; animation-fill-mode: forwards; animation-timing-function: ease-in; animation-delay: .4s; } .mmd-tooltipped-w::before { top: 50%; bottom: 50%; left: -7px; margin-top: -6px; border-left-color: rgb(36, 41, 47); } .mmd-tooltipped::before { position: absolute; z-index: 1000001; display: none; width: 0; height: 0; color: rgb(36, 41, 47); pointer-events: none; content: ""; border: 6px solid transparent; opacity: 0; } .mmd-tooltipped-w::after { right: 100%; bottom: 50%; margin-right: 6px; transform: translateY(50%); } .mmd-tooltipped::after { position: absolute; z-index: 1000000; display: none; padding: 0.5em 0.75em; font: normal normal 11px/1.5 'CMU Serif', 'Georgia', Helvetica, Arial, sans-serif; -webkit-font-smoothing: subpixel-antialiased; color: rgb(255, 255, 255); text-align: center; text-decoration: none; text-shadow: none; text-transform: none; letter-spacing: normal; word-wrap: break-word; white-space: pre; pointer-events: none; content: attr(aria-label); background: rgb(36, 41, 47); border-radius: 6px; opacity: 0; }

MANN ITERATION FOR DIRECT PSEUDOCONTRACTIVE MAPS

Ştefan M. ŞOLTUZ

Abstract

In this note we introduce a new class of maps. Let X X XXX be a real normed space, and B ⊂ X B ⊂ X B sub XB \subset XB⊂X be a nonempty set. The map T : B → B T : B → B T:B rarr BT: B \rightarrow BT:B→B is direct pseudocontractive if there exists k ∈ ( 0 , 1 ) k ∈ ( 0 , 1 ) k in(0,1)k \in(0,1)k∈(0,1) such that

‖ T x − T y ‖ 2 ≤ k ‖ x − y ‖ 2 + ‖ ( I − T ) x − ( I − T ) y ‖ 2 , ∀ x , y ∈ B . ‖ T x − T y ‖ 2 ≤ k ‖ x − y ‖ 2 + ‖ ( I − T ) x − ( I − T ) y ‖ 2 , ∀ x , y ∈ B . ||Tx-Ty||^(2) <= k||x-y||^(2)+||(I-T)x-(I-T)y||^(2),AA x,y in B.\|T x-T y\|^{2} \leq k\|x-y\|^{2}+\|(I-T) x-(I-T) y\|^{2}, \forall x, y \in B .‖Tx−Ty‖2≤k‖x−y‖2+‖(I−T)x−(I−T)y‖2,∀x,y∈B.
For T T TTT a direct pseudocontractive map, we prove the convergence of Mann iteration to the fixed point of T T TTT.
MSC. 47H10
Keywords: preudocontractive maps, fix points, iterative method, convergence
  1. Introduction. Let H H HHH be a real Hilbert space, let B ⊂ H B ⊂ H B sub HB \subset HB⊂H be a nonempty, convex set. Let T : B → B T : B → B T:B rarr BT: B \rightarrow BT:B→B be a map. Let x 1 ∈ B x 1 ∈ B x_(1)in Bx_{1} \in Bx1∈B, be an arbitrary fixed point. We consider the iteration
(1) x n + 1 = ( 1 − α n ) x n + α n T x n (1) x n + 1 = 1 − α n x n + α n T x n {:(1)x_(n+1)=(1-alpha_(n))x_(n)+alpha_(n)Tx_(n):}\begin{equation*} x_{n+1}=\left(1-\alpha_{n}\right) x_{n}+\alpha_{n} T x_{n} \tag{1} \end{equation*}(1)xn+1=(1−αn)xn+αnTxn
The sequence ( α n ) n ≥ 1 α n n ≥ 1 (alpha_(n))_(n >= 1)\left(\alpha_{n}\right)_{n \geq 1}(αn)n≥1 satisfics: ( α n ) n ≥ 1 ⊂ ( 0 , 1 ) , ∑ n = 1 ∞ α n = ∞ α n n ≥ 1 ⊂ ( 0 , 1 ) , ∑ n = 1 ∞ &hairsp; α n = ∞ (alpha_(n))_(n >= 1)sub(0,1),sum_(n=1)^(oo)alpha_(n)=oo\left(\alpha_{n}\right)_{n \geq 1} \subset(0,1), \sum_{n=1}^{\infty} \alpha_{n}=\infty(αn)n≥1⊂(0,1),∑n=1∞αn=∞, and ∑ n = 1 ∞ α n 2 < ∞ ∑ n = 1 ∞ &hairsp; α n 2 < ∞ sum_(n=1)^(oo)alpha_(n)^(2) < oo\sum_{n=1}^{\infty} \alpha_{n}^{2}< \infty∑n=1∞αn2<∞. The last relation implies that lim n → ∞ α n = 0 lim n → ∞ &hairsp; α n = 0 lim_(n rarr oo)alpha_(n)=0\lim _{n \rightarrow \infty} \alpha_{n}=0limn→∞αn=0. A prototype for ( α n ) n ≥ 1 α n n ≥ 1 (alpha_(n))_(n >= 1)\left(\alpha_{n}\right)_{n \geq 1}(αn)n≥1 is ( 1 / n ) n ≥ 1 ( 1 / n ) n ≥ 1 (1//n)_(n >= 1)(1 / n)_{n \geq 1}(1/n)n≥1.
Definition 1 The map T T TTT is called pseudocontractive if
‖ T x − T y ‖ 2 ≤ ‖ x − y ‖ 2 + ‖ ( I − T ) x − ( I − T ) y ‖ 2 , ∀ x , y ∈ B . ‖ T x − T y ‖ 2 ≤ ‖ x − y ‖ 2 + ‖ ( I − T ) x − ( I − T ) y ‖ 2 , ∀ x , y ∈ B . ||Tx-Ty||^(2) <= ||x-y||^(2)+||(I-T)x-(I-T)y||^(2),AA x,y in B.\|T x-T y\|^{2} \leq\|x-y\|^{2}+\|(I-T) x-(I-T) y\|^{2}, \forall x, y \in B .‖Tx−Ty‖2≤‖x−y‖2+‖(I−T)x−(I−T)y‖2,∀x,y∈B.
In [7] we can see an example of a Lipechitz pseudocontractive map with a unique fixed point for which every non trivial Mann sequence fails to converge. The set B B BBB is nonempty, convex and compact.
Definition 2 The map T T TTT is called strongly pseudocontractive if there exists q ∈ ( 0 , 1 ) q ∈ ( 0 , 1 ) q in(0,1)q \in(0,1)q∈(0,1) such that
‖ T x − T y ‖ 2 ≤ ‖ x − y ‖ 2 + q ‖ ( I − T ) x − ( I − T ) y ‖ 2 , ∀ x , y ∈ B . ‖ T x − T y ‖ 2 ≤ ‖ x − y ‖ 2 + q ‖ ( I − T ) x − ( I − T ) y ‖ 2 , ∀ x , y ∈ B . ||Tx-Ty||^(2) <= ||x-y||^(2)+q||(I-T)x-(I-T)y||^(2),AA x,y in B.\|T x-T y\|^{2} \leq\|x-y\|^{2}+q\|(I-T) x-(I-T) y\|^{2}, \forall x, y \in B .‖Tx−Ty‖2≤‖x−y‖2+q‖(I−T)x−(I−T)y‖2,∀x,y∈B.
In [1], [2], [3], [5], [8], [11] the map T T TTT is considered strongly pseudocontractive. The sequence ( x n ) n ≥ 1 x n n ≥ 1 (x_(n))_(n >= 1)\left(x_{n}\right)_{n \geq 1}(xn)n≥1 given by (1) strongly converges to a fixed point of T T TTT.
We introduce the following class of maps:
Definition 3 The map T T TTT is called direct pseudocontractive if there exists k ∈ ( 0 , 1 ) k ∈ ( 0 , 1 ) k in(0,1)k \in(0,1)k∈(0,1) such that
(2) ‖ T x − T y ‖ 2 ≤ k ‖ x − y ‖ 2 + ‖ ( I − T ) x − ( I − T ) y ‖ 2 , ∀ x , y ∈ B . (2) ‖ T x − T y ‖ 2 ≤ k ‖ x − y ‖ 2 + ‖ ( I − T ) x − ( I − T ) y ‖ 2 , ∀ x , y ∈ B . {:(2)||Tx-Ty||^(2) <= k||x-y||^(2)+||(I-T)x-(I-T)y||^(2)","AA x","y in B.:}\begin{equation*} \|T x-T y\|^{2} \leq k\|x-y\|^{2}+\|(I-T) x-(I-T) y\|^{2}, \forall x, y \in B . \tag{2} \end{equation*}(2)‖Tx−Ty‖2≤k‖x−y‖2+‖(I−T)x−(I−T)y‖2,∀x,y∈B.
The class of direct pseudocontractive maps is nonempty. If T T TTT is a contraction, then T T TTT is a direct pseudocontractive map.Picard -Banach Theorem can't be used to find the fixed point of a direct psendocontractive map. Instead, Mann iteration (1) can be successfully used. Our aim is to give a convergence result for (1). We denote by F ( T ) := { x ∈ B : T x = x } F ( T ) := { x ∈ B : T x = x } F(T):={x in B:Tx=x}F(T):=\{x \in B: T x=x\}F(T):={x∈B:Tx=x}.
Remark 1 If T T TTT is a direct pseudocontractive map and has F ( T ) ≠ ∅ F ( T ) ≠ ∅ F(T)!=O/F(T) \neq \emptysetF(T)≠∅, then T T TTT hass a unique fixed point.
Proof. Let x ∗ x ∗ x^(**)x^{*}x∗ and y ∗ y ∗ y^(**)y^{*}y∗ be two distinct fixed points. From (2) we have
‖ T x ∗ − T y ∗ ‖ 2 ≤ k ‖ x ∗ − y ∗ ‖ 2 ‖ x ∗ − y ∗ ‖ 2 ≤ k ‖ x ∗ − y ∗ ‖ 2 ( 1 − k ) ‖ x ∗ − y ∗ ‖ 2 ≤ 0 , k ∈ ( 0 , 1 ) T x ∗ − T y ∗ 2 ≤ k x ∗ − y ∗ 2 x ∗ − y ∗ 2 ≤ k x ∗ − y ∗ 2 ( 1 − k ) x ∗ − y ∗ 2 ≤ 0 , k ∈ ( 0 , 1 ) {:[||Tx^(**)-Ty^(**)||^(2) <= k||x^(**)-y^(**)||^(2)],[||x^(**)-y^(**)||^(2) <= k||x^(**)-y^(**)||^(2)],[(1-k)||x^(**)-y^(**)||^(2) <= 0","k in(0","1)]:}\begin{aligned} \left\|T x^{*}-T y^{*}\right\|^{2} & \leq k\left\|x^{*}-y^{*}\right\|^{2} \\ \left\|x^{*}-y^{*}\right\|^{2} & \leq k\left\|x^{*}-y^{*}\right\|^{2} \\ (1-k)\left\|x^{*}-y^{*}\right\|^{2} & \leq 0, k \in(0,1) \end{aligned}‖Tx∗−Ty∗‖2≤k‖x∗−y∗‖2‖x∗−y∗‖2≤k‖x∗−y∗‖2(1−k)‖x∗−y∗‖2≤0,k∈(0,1)
Hence x ∗ = y ∗ x ∗ = y ∗ x^(**)=y^(**)x^{*}=y^{*}x∗=y∗. Thus F ( T ) = { x ∗ } F ( T ) = x ∗ F(T)={x^(**)}F(T)=\left\{x^{*}\right\}F(T)={x∗}.
The following lemma can be found in [10] as Lemma 4. Also, it can be found in [12] as Lemma 1.2, with an other proof. In [1] can be found as Lemma 2, the proof is similar to the proof of Lemma 1 from [8].
Lemma 4 [1], [10], [12] Let ( a n ) n ≥ 1 a n n ≥ 1 (a_(n))_(n >= 1)\left(a_{n}\right)_{n \geq 1}(an)n≥1 be a nonnegative sequence which verifies where a n + 1 ≤ ( 1 − λ n ) a n + σ n , ( λ n ) n ≥ 1 ⊂ ( 0 , 1 ) , ∑ n = 1 ∞ λ n = ∞ a n + 1 ≤ 1 − λ n a n + σ n , λ n n ≥ 1 ⊂ ( 0 , 1 ) , ∑ n = 1 ∞ &hairsp; λ n = ∞ a_(n+1) <= (1-lambda_(n))a_(n)+sigma_(n),(lambda_(n))_(n >= 1)sub(0,1),sum_(n=1)^(oo)lambda_(n)=ooa_{n+1} \leq\left(1-\lambda_{n}\right) a_{n}+\sigma_{n},\left(\lambda_{n}\right)_{n \geq 1} \subset(0,1), \sum_{n=1}^{\infty} \lambda_{n}=\inftyan+1≤(1−λn)an+σn,(λn)n≥1⊂(0,1),∑n=1∞λn=∞ and σ n = o ( λ n ) σ n = o λ n sigma_(n)=o(lambda_(n))\sigma_{n}=o\left(\lambda_{n}\right)σn=o(λn). Then lim n − ∞ a n = 0 lim n − ∞ &hairsp; a n = 0 lim_(n-oo)a_(n)=0\lim _{n-\infty} a_{n}=0limn−∞an=0.
The following result is proved in [4].
Lemma 5 (4) Let H H HHH be a Hilbert space, the following relation is true for all x , y ∈ H x , y ∈ H x,y in Hx, y \in Hx,y∈H, and for all λ ∈ ( 0 , 1 ) λ ∈ ( 0 , 1 ) lambda in(0,1)\lambda \in(0,1)λ∈(0,1) :
(3) ‖ ( 1 − λ ) x + λ y ‖ 2 = ( 1 − λ ) ‖ x ‖ 2 + λ ‖ y ‖ 2 − λ ( 1 − λ ) ‖ x = y ‖ 2 . (3) ‖ ( 1 − λ ) x + λ y ‖ 2 = ( 1 − λ ) ‖ x ‖ 2 + λ ‖ y ‖ 2 − λ ( 1 − λ ) ‖ x = y ‖ 2 . {:(3)||(1-lambda)x+lambda y||^(2)=(1-lambda)||x||^(2)+lambda||y||^(2)-lambda(1-lambda)||x=y||^(2).:}\begin{equation*} \|(1-\lambda) x+\lambda y\|^{2}=(1-\lambda)\|x\|^{2}+\lambda\|y\|^{2}-\lambda(1-\lambda)\|x=y\|^{2} . \tag{3} \end{equation*}(3)‖(1−λ)x+λy‖2=(1−λ)‖x‖2+λ‖y‖2−λ(1−λ)‖x=y‖2.
2.The main result.
We are able now to give the main result:
Theorem 6 Let H H HHH be a real Hilbert space, let B ⊂ H B ⊂ H B sub HB \subset HB⊂H be a nonempty, convex, bounded and closed set and let T : B → B T : B → B T:B rarr BT: B \rightarrow BT:B→B be a continuous, direct pseudocontructive map, with F ( T ) ≠ ∅ F ( T ) ≠ ∅ F(T)!=O/F(T) \neq \emptysetF(T)≠∅. Then for each x 1 x 1 x_(1)x_{1}x1 a fixed point in B B BBB, the sequence ( x n ) n ≥ 1 x n n ≥ 1 (x_(n))_(n >= 1)\left(x_{n}\right)_{n \geq 1}(xn)n≥1 given by (1) converges strongly to the unique fixed point of T T TTT.
Proof. Let x ∗ ∈ F ( T ) x ∗ ∈ F ( T ) x^(**)in F(T)x^{*} \in F(T)x∗∈F(T). From remark 2 we know that F ( T ) = { x ∗ } F ( T ) = x ∗ F(T)={x^(**)}F(T)=\left\{x^{*}\right\}F(T)={x∗}. Using (2) and (3) we get
‖ x n + 1 − x ∗ ‖ 2 = ‖ ( 1 − α n ) x n + α n T x n − x ∗ ‖ 2 = ‖ ( 1 − α n ) ( x n − x ∗ ) + α n ( T x n − x ∗ ) ‖ 2 = ( 1 − α n ) ‖ x n − x ∗ ‖ 2 + α n ‖ T x n − x ∗ ‖ 2 − α n ( 1 − α n ) ‖ T x n − x n ‖ 2 ≤ ( 1 − α n ) ‖ x n − x ∗ ‖ 2 + α n k ‖ x n − x ∗ ‖ 2 + + α n ‖ T x n − x n ‖ 2 − α n ( 1 − α n ) ‖ T x n − x n ‖ 2 ≤ [ 1 − ( 1 − k ) α n ] ‖ x n − x ∗ ‖ 2 + α n 2 ‖ T x n − x n ‖ 2 . x n + 1 − x ∗ 2 = 1 − α n x n + α n T x n − x ∗ 2 = 1 − α n x n − x ∗ + α n T x n − x ∗ 2 = 1 − α n x n − x ∗ 2 + α n T x n − x ∗ 2 − α n 1 − α n T x n − x n 2 ≤ 1 − α n x n − x ∗ 2 + α n k x n − x ∗ 2 + + α n T x n − x n 2 − α n 1 − α n T x n − x n 2 ≤ 1 − ( 1 − k ) α n x n − x ∗ 2 + α n 2 T x n − x n 2 . {:[||x_(n+1)-x^(**)||^(2)],[=||(1-alpha_(n))x_(n)+alpha_(n)Tx_(n)-x^(**)||^(2)],[=||(1-alpha_(n))(x_(n)-x^(**))+alpha_(n)(Tx_(n)-x^(**))||^(2)],[=(1-alpha_(n))||x_(n)-x^(**)||^(2)+alpha_(n)||Tx_(n)-x^(**)||^(2)-alpha_(n)(1-alpha_(n))||Tx_(n)-x_(n)||^(2)],[ <= (1-alpha_(n))||x_(n)-x^(**)||^(2)+alpha_(n)k||x_(n)-x^(**)||^(2)+],[+alpha_(n)||Tx_(n)-x_(n)||^(2)-alpha_(n)(1-alpha_(n))||Tx_(n)-x_(n)||^(2)],[ <= [1-(1-k)alpha_(n)]||x_(n)-x^(**)||^(2)+alpha_(n)^(2)||Tx_(n)-x_(n)||^(2).]:}\begin{aligned} & \left\|x_{n+1}-x^{*}\right\|^{2} \\ = & \left\|\left(1-\alpha_{n}\right) x_{n}+\alpha_{n} T x_{n}-x^{*}\right\|^{2} \\ = & \left\|\left(1-\alpha_{n}\right)\left(x_{n}-x^{*}\right)+\alpha_{n}\left(T x_{n}-x^{*}\right)\right\|^{2} \\ = & \left(1-\alpha_{n}\right)\left\|x_{n}-x^{*}\right\|^{2}+\alpha_{n}\left\|T x_{n}-x^{*}\right\|^{2}-\alpha_{n}\left(1-\alpha_{n}\right)\left\|T x_{n}-x_{n}\right\|^{2} \\ \leq & \left(1-\alpha_{n}\right)\left\|x_{n}-x^{*}\right\|^{2}+\alpha_{n} k\left\|x_{n}-x^{*}\right\|^{2}+ \\ & +\alpha_{n}\left\|T x_{n}-x_{n}\right\|^{2}-\alpha_{n}\left(1-\alpha_{n}\right)\left\|T x_{n}-x_{n}\right\|^{2} \\ \leq & {\left[1-(1-k) \alpha_{n}\right]\left\|x_{n}-x^{*}\right\|^{2}+\alpha_{n}^{2}\left\|T x_{n}-x_{n}\right\|^{2} . } \end{aligned}‖xn+1−x∗‖2=‖(1−αn)xn+αnTxn−x∗‖2=‖(1−αn)(xn−x∗)+αn(Txn−x∗)‖2=(1−αn)‖xn−x∗‖2+αn‖Txn−x∗‖2−αn(1−αn)‖Txn−xn‖2≤(1−αn)‖xn−x∗‖2+αnk‖xn−x∗‖2++αn‖Txn−xn‖2−αn(1−αn)‖Txn−xn‖2≤[1−(1−k)αn]‖xn−x∗‖2+αn2‖Txn−xn‖2.
The sequence ( ‖ T x n − x n ‖ 2 ) n ≥ 1 T x n − x n 2 n ≥ 1 (||Tx_(n)-x_(n)||^(2))_(n >= 1)\left(\left\|T x_{n}-x_{n}\right\|^{2}\right)_{n \geq 1}(‖Txn−xn‖2)n≥1 is bounded, because B B BBB is bounded. There exists M > 0 M > 0 M > 0M>0M>0 such that ‖ T x n − x n ‖ 2 < M T x n − x n 2 < M ||Tx_(n)-x_(n)||^(2) < M\left\|T x_{n}-x_{n}\right\|^{2}<M‖Txn−xn‖2<M, for all n ≥ 1 n ≥ 1 n >= 1n \geq 1n≥1. We denote a n := ‖ x n − x ∗ ‖ 2 a n := x n − x ∗ 2 a_(n):=||x_(n)-x^(**)||^(2)a_{n}:= \left\|x_{n}-x^{*}\right\|^{2}an:=‖xn−x∗‖2, and we get:
a n + 1 ≤ [ 1 − ( 1 − k ) α n ] a n + α n 2 M . a n + 1 ≤ 1 − ( 1 − k ) α n a n + α n 2 M . a_(n+1) <= [1-(1-k)alpha_(n)]a_(n)+alpha_(n)^(2)M.a_{n+1} \leq\left[1-(1-k) \alpha_{n}\right] a_{n}+\alpha_{n}^{2} M .an+1≤[1−(1−k)αn]an+αn2M.
Let us denote by
λ n := ( 1 − k ) α n σ n := α n 2 M . λ n := ( 1 − k ) α n σ n := α n 2 M . {:[lambda_(n):=(1-k)alpha_(n)],[sigma_(n):=alpha_(n)^(2)M.]:}\begin{aligned} & \lambda_{n}:=(1-k) \alpha_{n} \\ & \sigma_{n}:=\alpha_{n}^{2} M . \end{aligned}λn:=(1−k)αnσn:=αn2M.
Observe that λ n = ( 1 − k ) α n ⊂ ( 0 , 1 ) λ n = ( 1 − k ) α n ⊂ ( 0 , 1 ) lambda_(n)=(1-k)alpha_(n)sub(0,1)\lambda_{n}=(1-k) \alpha_{n} \subset(0,1)λn=(1−k)αn⊂(0,1), for all n ≥ 1 n ≥ 1 n >= 1n \geq 1n≥1. We have ∑ n − 1 ∞ λ n = ( 1 − k ) ∑ n = 1 ∞ α n = ∞ ∑ n − 1 ∞ &hairsp; λ n = ( 1 − k ) ∑ n = 1 ∞ &hairsp; α n = ∞ sum_(n-1)^(oo)lambda_(n)=(1-k)sum_(n=1)^(oo)alpha_(n)=oo\sum_{n-1}^{\infty} \lambda_{n}= (1-k) \sum_{n=1}^{\infty} \alpha_{n}=\infty∑n−1∞λn=(1−k)∑n=1∞αn=∞. The following relation is true
lim n → ∞ σ n λ n = lim n → ∞ α s 2 M ( 1 − k ) α n = M 1 − k lim n → ∞ α n = 0 lim n → ∞ &hairsp; σ n λ n = lim n → ∞ &hairsp; α s 2 M ( 1 − k ) α n = M 1 − k lim n → ∞ &hairsp; α n = 0 lim_(n rarr oo)(sigma_(n))/(lambda_(n))=lim_(n rarr oo)(alpha_(s)^(2)M)/((1-k)alpha_(n))=(M)/(1-k)lim_(n rarr oo)alpha_(n)=0\lim _{n \rightarrow \infty} \frac{\sigma_{n}}{\lambda_{n}}=\lim _{n \rightarrow \infty} \frac{\alpha_{s}^{2} M}{(1-k) \alpha_{n}}=\frac{M}{1-k} \lim _{n \rightarrow \infty} \alpha_{n}=0limn→∞σnλn=limn→∞αs2M(1−k)αn=M1−klimn→∞αn=0
Thus, we have σ n = o ( λ n ) σ n = o λ n sigma_(n)=o(lambda_(n))\sigma_{n}=o\left(\lambda_{n}\right)σn=o(λn). From Lemma 1 we get lim n → ∞ a n = 0 lim n → ∞ &hairsp; a n = 0 lim_(n rarr oo)a_(n)=0\lim _{n \rightarrow \infty} a_{n}=0limn→∞an=0. Hence lim n → ∞ ‖ x n − x ∗ ‖ = 0 lim n → ∞ &hairsp; x n − x ∗ = 0 lim_(n rarr oo)||x_(n)-x^(**)||=0\lim _{n \rightarrow \infty}\left\|x_{n}-x^{*}\right\|=0limn→∞‖xn−x∗‖=0. The proof is complete.
Using the Schauder fixed point theorem we give the following corollary:
Corollary 7 Let H H HHH be a real Hilbert space, let B ⊂ H B ⊂ H B sub HB \subset HB⊂H be a nonempty, convex, compact set and let T : B → B T : B → B T:B rarr BT: B \rightarrow BT:B→B be a continuous, direct pseudocontractive map. Then for exach x 1 x 1 x_(1)x_{1}x1 a fixed point in B B BBB, the sequence ( x n ) n ≥ 1 x n n ≥ 1 (x_(n))_(n >= 1)\left(x_{n}\right)_{n \geq 1}(xn)n≥1 given by (1) converges strongly to the unique fixed poinl of T T TTT.

References

[1] S.S.Chang, Y.J. Cho, B.S. Lee, J.S. Jung, S. M. Kang, Iterative Approximations of Fixed Points and Solutions for Strongly Accretive and Strongly Pseudo-contractive Mappings in Banach Spaces, J. Math. Anal. Appl. 224 (1998), 149-165.
[2] C. E. Chidume, Approximation of Fixed Points of Strongly Pseudocontractive Mappings, Proc. Amer. Math. Soc. 120 (1994), 546-551.
[3] C. E. Chidume, C. Moore, Fixed Point Iteration for Strongly Pseudocontractive Maps, Proc. Amer. Math. Soc. 127 (1999), 1163-1170.
[4] S. Ishikawa, Fized Points by a New Iteration Method, Proc. Amer. Math. Soc. 44 (1974), 147-150.
[5] G. G. Johnson, Fixed Points by Mean value iterations, Proc. Amer. Math. Soc. 34 (1972), 193-195.
[6] R. W. Mann, Mean Value Methods in Iteration, Proc. Amer. Math. Soc. 4 (1953), 504-510.
[7] S.A. Mutangadura, C.E. Chidume, An Example of the Mann Iteration Method for Lipschitz Pseudocontractions, internal report ICTP Trieste (2000), http://www.ictp.trieste.it
[8] J. A. Park, Mann-Ileration for Strictly Pseudocontructive Maps, J. Korean Math. Soc. 31 (1994), 333-337.
[9] R. U. Verma, A Ficed Point Theorem Involving Lipschitzian Generalized Pseudo-contractions, Proc. Royal Irish Acad. 97A (1997), 83-86.
[10] X. Weng, Pired Point Iteration for Local Strictly Pseudocontractive Mapping, Proc. Amer. Math. Soc. 113 (1991), 727-731.
[11] II. Y. Zhou, Stable Iteration Procedures for Strong Pseudocontractions and Nonlinear Equations Involving Accretive Operators without Lipschitz Assumption, J. Math. Anal. Appl. 230 (1999), 1-30.
[12] H. Zhou, J. Yuting, Approximation of Fixed Points of Strongly Pseudocontractive Maps without Lipschitz Assumption, Proc. Amer. Math. Soc.
125 (1997), 1705-1709.
Received: 12.03.2001
"T. Popoviciu" Institute of
Numerical Analysis
Gh. Bilascu 37, P.O. Box 68-1,
3400 Cluj-Napoca, Romania.

Related Posts