Classical results via Mann-Ishikawa iteration

Abstract

New proofs of existence and uniqueness results for the solution of the Cauchy problem with delay are obtained by use of Mann-Ishikawa iteration.

Authors

Ş.M. Şoltuz
Universidad de los Andes, Colombia and Tiberiu Popoviciu Institute of Numerical Analysis, Romania

D. Otrocol

Diana Otrocol


Tiberiu Popoviciu Institute of Numerical Analysis, Romanian Academy, Romania

Keywords

delay differential equationș Mann iteration; Ishikawa iteration

Paper coordinates

Ş.M. Şoltuz, D. Otrocol, Classical results via Mann-Ishikawa iteration, Rev. Anal. Numer. Theor. Approx., 36 (2007) no. 2, 193-197, https://doi.org/10.33993/jnaat362-868

PDF

About this paper

Journal

Rev. Anal. Numer. Theor. Approx.

Publisher Name

Romanian Academy

Print ISSN

1972-1974

Online ISSN

google scholar link

[1] Coman, Gh., Pavel, G., Rus, I.andRus, I. A.,Introduction in the theory of operatorialequation, Ed. Dacia, Cluj-Napoca, 1976 (in Romanian).
[2] Hartman, P.,Ordinary differential equations, John Wiley & Sons, Inc., New York,London, Sydney, 1964.
[3] Ishikawa, S.,Fixed points by a new iteration method, Proc. Amer. Math. Soc.,44,pp. 147–150, 1974.
[4] Mann, W. R.,Mean value in iteration, Proc. Amer. Math. Soc.,4, pp. 506–510, 1953.
[5] Otrocol, D.,Data dependence for the solution of a Lotka-Volterra system with twodelays,Mathematica, Tome48(71), 1, pp. 61–68, 2006.
[6] Rus, I. A.,Principles and applications of the fixed point theory,Ed. Dacia, Cluj Napoca,1979 (in Romanian).
[7] Soltuz, S. M.,The equivalence of Picard, Mann and Ishikawa iteration dealing withquasi-contractive operators, Math. Comm.10, pp. 81–88, 2005.
[8] Soltuz, S. M.,An equivalence between the convergence of Ishikawa, Mann and Picarditerations, Math. Comm.8, pp. 15–22, 2003.Received by the editors: November 20, 2006.

Paper (preprint) in HTML form

jnaat,+Journal+manager,+2007-2-Soltuz-Otrocol-15-10-30 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; }

CLASSICAL RESULTS VIA MANN-ISHIKAWA ITERATION ‡ ‡ ^(‡){ }^{\ddagger}‡

ŞTEFAN M. ŞOLTUZ* † and DIANA OTROCOL*

Abstract

New proofs of existence and uniqueness results for the solution of the Cauchy problem with delay are obtained by use of Mann-Ishikawa iteration.

MSC 2000. 47H10.
Keywords. Delay differential equation, Mann iteration, Ishikawa iteration.

1. INTRODUCTION

Consider the following delay differential equation
(1) x ′ ( t ) = f ( t , x ( t ) , x ( t − τ ) ) , t ∈ [ t 0 , b ] (1) x ′ ( t ) = f ( t , x ( t ) , x ( t − τ ) ) , t ∈ t 0 , b {:(1)x^(')(t)=f(t","x(t)","x(t-tau))","t in[t_(0),b]:}\begin{equation*} x^{\prime}(t)=f(t, x(t), x(t-\tau)), t \in\left[t_{0}, b\right] \tag{1} \end{equation*}(1)x′(t)=f(t,x(t),x(t−τ)),t∈[t0,b]
with t 0 , b , τ ∈ R , τ > 0 , f ∈ C ( [ t 0 , b ] × R 2 , R ) t 0 , b , τ ∈ R , τ > 0 , f ∈ C t 0 , b × R 2 , R t_(0),b,tau inR,tau > 0,f in C([t_(0),b]xxR^(2),R)t_{0}, b, \tau \in \mathbb{R}, \tau>0, f \in C\left(\left[t_{0}, b\right] \times \mathbb{R}^{2}, \mathbb{R}\right)t0,b,τ∈R,τ>0,f∈C([t0,b]×R2,R).
The existence of an approximative solution for equation (1) is given by theorem 1 from [1] (see also [2], [6], [5]). The proof of this theorem is based on the contraction principle. We shall prove it here by applying Mann iteration.
In the last decades, numerous papers were published on the iterative approximation of fixed points of contractive type operators in metric spaces, see for example [7], [8]. The Mann iteration [4] and the Ishikawa iteration [3] are certainly the most studied of these fixed point iteration procedures.
Let X X XXX be a real Banach space and T : X → X T : X → X T:X rarr XT: X \rightarrow XT:X→X a given operator, let u 0 , x 0 ∈ X u 0 , x 0 ∈ X u_(0),x_(0)in Xu_{0}, x_{0} \in Xu0,x0∈X.
The Mann iteration is defined by
(2) u n + 1 = ( 1 − α n ) u n + α n T u n . (2) u n + 1 = 1 − α n u n + α n T u n . {:(2)u_(n+1)=(1-alpha_(n))u_(n)+alpha_(n)Tu_(n).:}\begin{equation*} u_{n+1}=\left(1-\alpha_{n}\right) u_{n}+\alpha_{n} T u_{n} . \tag{2} \end{equation*}(2)un+1=(1−αn)un+αnTun.
The Ishikawa iteration is defined by
(3) { x n + 1 = ( 1 − α n ) x n + α n T y n y n = ( 1 − β n ) x n + β n T x n (3) x n + 1 = 1 − α n x n + α n T y n y n = 1 − β n x n + β n T x n {:(3){[x_(n+1)=(1-alpha_(n))x_(n)+alpha_(n)Ty_(n)],[y_(n)=(1-beta_(n))x_(n)+beta_(n)Tx_(n)]:}:}\left\{\begin{array}{l} x_{n+1}=\left(1-\alpha_{n}\right) x_{n}+\alpha_{n} T y_{n} \tag{3}\\ y_{n}=\left(1-\beta_{n}\right) x_{n}+\beta_{n} T x_{n} \end{array}\right.(3){xn+1=(1−αn)xn+αnTynyn=(1−βn)xn+βnTxn
where { α n } ⊂ ( 0 , 1 ) , { β n } ⊂ [ 0 , 1 ) α n ⊂ ( 0 , 1 ) , β n ⊂ [ 0 , 1 ) {alpha_(n)}sub(0,1),{beta_(n)}sub[0,1)\left\{\alpha_{n}\right\} \subset(0,1),\left\{\beta_{n}\right\} \subset[0,1){αn}⊂(0,1),{βn}⊂[0,1) and both sequences satisfy
lim n → ∞ α n = lim n → ∞ β n = 0 , ∑ n = 0 ∞ α n = ∞ lim n → ∞   α n = lim n → ∞   β n = 0 , ∑ n = 0 ∞   α n = ∞ lim_(n rarr oo)alpha_(n)=lim_(n rarr oo)beta_(n)=0,sum_(n=0)^(oo)alpha_(n)=oo\lim _{n \rightarrow \infty} \alpha_{n}=\lim _{n \rightarrow \infty} \beta_{n}=0, \sum_{n=0}^{\infty} \alpha_{n}=\inftylimn→∞αn=limn→∞βn=0,∑n=0∞αn=∞

2. FIXED POINT THEOREMS

We consider the delay differential equation
(4) x ′ ( t ) = f ( t , x ( t ) , x ( t − τ ) ) , t ∈ [ t 0 , b ] (4) x ′ ( t ) = f ( t , x ( t ) , x ( t − τ ) ) , t ∈ t 0 , b {:(4)x^(')(t)=f(t","x(t)","x(t-tau))","t in[t_(0),b]:}\begin{equation*} x^{\prime}(t)=f(t, x(t), x(t-\tau)), t \in\left[t_{0}, b\right] \tag{4} \end{equation*}(4)x′(t)=f(t,x(t),x(t−τ)),t∈[t0,b]
with initial condition
(5) x ( t ) = φ ( t ) , t ∈ [ t 0 − τ , t 0 ] . (5) x ( t ) = φ ( t ) , t ∈ t 0 − τ , t 0 . {:(5)x(t)=varphi(t)","t in[t_(0)-tau,t_(0)].:}\begin{equation*} x(t)=\varphi(t), t \in\left[t_{0}-\tau, t_{0}\right] . \tag{5} \end{equation*}(5)x(t)=φ(t),t∈[t0−τ,t0].
We suppose that the following conditions are fulfilled
( H 1 ) t 0 , b ∈ R , τ > 0 ; H 1 t 0 , b ∈ R , τ > 0 ; (H_(1))t_(0),b inR,tau > 0;\left(\mathrm{H}_{1}\right) t_{0}, b \in \mathbb{R}, \tau>0 ;(H1)t0,b∈R,τ>0;
( H 2 ) f ∈ C ( [ t 0 , b ] × R 2 , R ) H 2 f ∈ C t 0 , b × R 2 , R (H_(2))f in C([t_(0),b]xxR^(2),R)\left(\mathrm{H}_{2}\right) f \in C\left(\left[t_{0}, b\right] \times \mathbb{R}^{2}, \mathbb{R}\right)(H2)f∈C([t0,b]×R2,R);
( H 3 ) φ ∈ C ( [ t 0 − τ , b ] , R ) ; H 3 φ ∈ C t 0 − τ , b , R ; (H_(3))varphi in C([t_(0)-tau,b],R);\left(\mathrm{H}_{3}\right) \varphi \in C\left(\left[t_{0}-\tau, b\right], \mathbb{R}\right) ;(H3)φ∈C([t0−τ,b],R);
( H 4 ) H 4 (H_(4))\left(\mathrm{H}_{4}\right)(H4) there exist L f > 0 L f > 0 L_(f) > 0L_{f}>0Lf>0 such that
| f ( t , u 1 , u 2 ) − f ( t , v 1 , v 2 ) | ≤ L f ( | u 1 − v 1 | + | u 2 − v 2 | ) ∀ u i , v i ∈ R , i = 1 , 2 , t ∈ [ t 0 , b ] f t , u 1 , u 2 − f t , v 1 , v 2 ≤ L f u 1 − v 1 + u 2 − v 2 ∀ u i , v i ∈ R , i = 1 , 2 , t ∈ t 0 , b {:[|f(t,u_(1),u_(2))-f(t,v_(1),v_(2))| <= L_(f)(|u_(1)-v_(1)|+|u_(2)-v_(2)|)],[AAu_(i)","v_(i)inR","i=1","2","t in[t_(0),b]]:}\begin{aligned} & \left|f\left(t, u_{1}, u_{2}\right)-f\left(t, v_{1}, v_{2}\right)\right| \leq L_{f}\left(\left|u_{1}-v_{1}\right|+\left|u_{2}-v_{2}\right|\right) \\ & \forall u_{i}, v_{i} \in \mathbb{R}, i=1,2, t \in\left[t_{0}, b\right] \end{aligned}|f(t,u1,u2)−f(t,v1,v2)|≤Lf(|u1−v1|+|u2−v2|)∀ui,vi∈R,i=1,2,t∈[t0,b]
( H 5 ) 2 L f ( b − t 0 ) < 1 H 5 2 L f b − t 0 < 1 (H_(5))2L_(f)(b-t_(0)) < 1\left(\mathrm{H}_{5}\right) 2 L_{f}\left(b-t_{0}\right)<1(H5)2Lf(b−t0)<1.
By a solution of the problem (4)-(5) we mean the function x ∈ C ( [ t 0 − τ , b ] , R ) ∩ C 1 ( [ t 0 , b ] , R ) x ∈ C t 0 − τ , b ] , R ) ∩ C 1 t 0 , b , R x in C([t_(0)-:}tau,b],R)nnC^(1)([t_(0),b],R)x \in C\left(\left[t_{0}-\right.\right. \tau, b], \mathbb{R}) \cap C^{1}\left(\left[t_{0}, b\right], \mathbb{R}\right)x∈C([t0−τ,b],R)∩C1([t0,b],R).
The problem (4)-(5) is equivalent with the integral equation
(6) x ( t ) = { φ ( t ) , t ∈ [ t 0 − τ , t 0 ] φ ( t 0 ) + ∫ t 0 t f ( s , x ( s ) , x ( s − τ ) ) d s , t ∈ [ t 0 , b ] (6) x ( t ) = φ ( t ) , t ∈ t 0 − τ , t 0 φ t 0 + ∫ t 0 t &hairsp; f ( s , x ( s ) , x ( s − τ ) ) d s , t ∈ t 0 , b {:(6)x(t)={[varphi(t)",",t in[t_(0)-tau,t_(0)]],[varphi(t_(0))+int_(t_(0))^(t)f(s","x(s)","x(s-tau))ds",",t in[t_(0),b]]:}:}x(t)= \begin{cases}\varphi(t), & t \in\left[t_{0}-\tau, t_{0}\right] \tag{6}\\ \varphi\left(t_{0}\right)+\int_{t_{0}}^{t} f(s, x(s), x(s-\tau)) \mathrm{d} s, & t \in\left[t_{0}, b\right]\end{cases}(6)x(t)={φ(t),t∈[t0−τ,t0]φ(t0)+∫t0tf(s,x(s),x(s−τ))ds,t∈[t0,b]
The operator T : C ( [ t 0 − τ , b ] , R ) → C ( [ t 0 − τ , b ] , R ) T : C t 0 − τ , b , R → C t 0 − τ , b , R T:C([t_(0)-tau,b],R)rarr C([t_(0)-tau,b],R)T: C\left(\left[t_{0}-\tau, b\right], \mathbb{R}\right) \rightarrow C\left(\left[t_{0}-\tau, b\right], \mathbb{R}\right)T:C([t0−τ,b],R)→C([t0−τ,b],R), is defined by
T ( x ) ( t ) = { φ ( t ) , t ∈ [ t 0 − τ , t 0 ] φ ( t 0 ) + ∫ t 0 t f ( s , x ( s ) , x ( s − τ ) ) d s , t ∈ [ t 0 , b ] T ( x ) ( t ) = φ ( t ) ,      t ∈ t 0 − τ , t 0 φ t 0 + ∫ t 0 t &hairsp; f ( s , x ( s ) , x ( s − τ ) ) d s ,      t ∈ t 0 , b T(x)(t)={[varphi(t)",",t in[t_(0)-tau,t_(0)]],[varphi(t_(0))+int_(t_(0))^(t)f(s","x(s)","x(s-tau))ds",",t in[t_(0),b]]:}T(x)(t)= \begin{cases}\varphi(t), & t \in\left[t_{0}-\tau, t_{0}\right] \\ \varphi\left(t_{0}\right)+\int_{t_{0}}^{t} f(s, x(s), x(s-\tau)) \mathrm{d} s, & t \in\left[t_{0}, b\right]\end{cases}T(x)(t)={φ(t),t∈[t0−τ,t0]φ(t0)+∫t0tf(s,x(s),x(s−τ))ds,t∈[t0,b]
and the Banach space C [ t 0 , b ] C t 0 , b C[t_(0),b]C\left[t_{0}, b\right]C[t0,b] is embedded with Tchebyshev norm
d ( y , z ) = max t 0 ≤ t ≤ b | y ( t ) − z ( t ) | d ( y , z ) = max t 0 ≤ t ≤ b &hairsp; | y ( t ) − z ( t ) | d(y,z)=max_(t_(0) <= t <= b)|y(t)-z(t)|d(y, z)=\max _{t_{0} \leq t \leq b}|y(t)-z(t)|d(y,z)=maxt0≤t≤b|y(t)−z(t)|
Applying contraction principle we have
Theorem 1. 1 We suppose conditions ( H 1 ) − ( H 5 ) H 1 − H 5 (H_(1))-(H_(5))\left(\mathrm{H}_{1}\right)-\left(\mathrm{H}_{5}\right)(H1)−(H5) are satisfied. Then the problem (4)-(5) has a unique solution in C ( [ t 0 − τ , b ] , R ) ∩ C 1 ( [ t 0 , b ] , R ) C t 0 − τ , b , R ∩ C 1 t 0 , b , R C([t_(0)-tau,b],R)nnC^(1)([t_(0),b],R)C\left(\left[t_{0}-\tau, b\right], \mathbb{R}\right) \cap C^{1}\left(\left[t_{0}, b\right], \mathbb{R}\right)C([t0−τ,b],R)∩C1([t0,b],R). Moreover, if x ∗ x ∗ x^(**)x^{*}x∗ is the unique solution of the problem (4)-(5), then
x ∗ = lim n → ∞ T n ( x ) for any x ∈ C ( [ t 0 − τ , b ] , R ) x ∗ = lim n → ∞ &hairsp; T n ( x )  for any  x ∈ C t 0 − τ , b , R x^(**)=lim_(n rarr oo)T^(n)(x)" for any "x in C([t_(0)-tau,b],R)x^{*}=\lim _{n \rightarrow \infty} T^{n}(x) \text { for any } x \in C\left(\left[t_{0}-\tau, b\right], \mathbb{R}\right)x∗=limn→∞Tn(x) for any x∈C([t0−τ,b],R)
The following lemma is well-known. For sake of completeness, we shall give a proof here.
Lemma 2. Let { a n } a n {a_(n)}\left\{a_{n}\right\}{an} be a nonnegative sequence satisfying
a n + 1 ≤ ( 1 − α n ) a n a n + 1 ≤ 1 − α n a n a_(n+1) <= (1-alpha_(n))a_(n)a_{n+1} \leq\left(1-\alpha_{n}\right) a_{n}an+1≤(1−αn)an
where { α n } ⊂ ( 0 , 1 ) , ∑ n = 0 ∞ α n = ∞ α n ⊂ ( 0 , 1 ) , ∑ n = 0 ∞ &hairsp; α n = ∞ {alpha_(n)}sub(0,1),sum_(n=0)^(oo)alpha_(n)=oo\left\{\alpha_{n}\right\} \subset(0,1), \sum_{n=0}^{\infty} \alpha_{n}=\infty{αn}⊂(0,1),∑n=0∞αn=∞. Then 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.
Proof. Use 1 − x ≤ e − x , ∀ x ∈ ( 0 , 1 ) 1 − x ≤ e − x , ∀ x ∈ ( 0 , 1 ) 1-x <= e^(-x),AA x in(0,1)1-x \leq \mathrm{e}^{-x}, \forall x \in(0,1)1−x≤e−x,∀x∈(0,1) to obtain ∏ k = 1 n ( 1 − α k ) ≤ e − ∑ k = 1 n α k ∏ k = 1 n &hairsp; 1 − α k ≤ e − ∑ k = 1 n &hairsp; α k prod_(k=1)^(n)(1-alpha_(k)) <= e^(-sum_(k=1)^(n)alpha_(k))\prod_{k=1}^{n}\left(1-\alpha_{k}\right) \leq \mathrm{e}^{-\sum_{k=1}^{n} \alpha_{k}}∏k=1n(1−αk)≤e−∑k=1nαk. Actually, one has
a n + 1 ≤ ∏ k = 1 n ( 1 − α k ) a 1 ≤ a 1 e − ∑ k = 1 n α k → 0 a n + 1 ≤ ∏ k = 1 n &hairsp; 1 − α k a 1 ≤ a 1 e − ∑ k = 1 n &hairsp; α k → 0 a_(n+1) <= prod_(k=1)^(n)(1-alpha_(k))a_(1) <= a_(1)e^(-sum_(k=1)^(n)alpha_(k))rarr0a_{n+1} \leq \prod_{k=1}^{n}\left(1-\alpha_{k}\right) a_{1} \leq a_{1} \mathrm{e}^{-\sum_{k=1}^{n} \alpha_{k}} \rightarrow 0an+1≤∏k=1n(1−αk)a1≤a1e−∑k=1nαk→0

3. MAIN RESULT

Theorem 3. We suppose that conditions ( H 1 ) − ( H 5 ) H 1 − H 5 (H_(1))-(H_(5))\left(\mathrm{H}_{1}\right)-\left(\mathrm{H}_{5}\right)(H1)−(H5) are satisfied. Then the problem (4)-(5) has a unique solution in C ( [ t 0 − τ , b ] , R ) ∩ C 1 ( [ t 0 , b ] , R ) C t 0 − τ , b , R ∩ C 1 t 0 , b , R C([t_(0)-tau,b],R)nnC^(1)([t_(0),b],R)C\left(\left[t_{0}-\tau, b\right], \mathbb{R}\right) \cap C^{1}\left(\left[t_{0}, b\right], \mathbb{R}\right)C([t0−τ,b],R)∩C1([t0,b],R).
Proof. Consider Mann iteration
u n + 1 = ( 1 − α n ) u n + α n T u n u n + 1 = 1 − α n u n + α n T u n u_(n+1)=(1-alpha_(n))u_(n)+alpha_(n)Tu_(n)u_{n+1}=\left(1-\alpha_{n}\right) u_{n}+\alpha_{n} T u_{n}un+1=(1−αn)un+αnTun
for the operator
T u n = { φ ( t ) , t ∈ [ t 0 − τ , t 0 ] φ ( t 0 ) + ∫ t 0 t f ( s , u n ( s ) , u n ( s − τ ) ) d s , t ∈ [ t 0 , b ] T u n = φ ( t ) ,      t ∈ t 0 − τ , t 0 φ t 0 + ∫ t 0 t &hairsp; f s , u n ( s ) , u n ( s − τ ) d s ,      t ∈ t 0 , b Tu_(n)={[varphi(t)",",t in[t_(0)-tau,t_(0)]],[varphi(t_(0))+int_(t_(0))^(t)f(s,u_(n)(s),u_(n)(s-tau))ds",",t in[t_(0),b]]:}T u_{n}= \begin{cases}\varphi(t), & t \in\left[t_{0}-\tau, t_{0}\right] \\ \varphi\left(t_{0}\right)+\int_{t_{0}}^{t} f\left(s, u_{n}(s), u_{n}(s-\tau)\right) \mathrm{d} s, & t \in\left[t_{0}, b\right]\end{cases}Tun={φ(t),t∈[t0−τ,t0]φ(t0)+∫t0tf(s,un(s),un(s−τ))ds,t∈[t0,b]
Denote by x ∗ := T x ∗ x ∗ := T x ∗ x^(**):=Tx^(**)x^{*}:=T x^{*}x∗:=Tx∗ the fixed point of T T TTT.
For t ∈ [ t 0 − τ , t 0 ] t ∈ t 0 − τ , t 0 t in[t_(0)-tau,t_(0)]t \in\left[t_{0}-\tau, t_{0}\right]t∈[t0−τ,t0] we get
‖ u n + 1 − x ∗ ‖ ≤ ( 1 − α n ) ‖ u n − x ∗ ‖ u n + 1 − x ∗ ≤ 1 − α n u n − x ∗ ||u_(n+1)-x^(**)|| <= (1-alpha_(n))||u_(n)-x^(**)||\left\|u_{n+1}-x^{*}\right\| \leq\left(1-\alpha_{n}\right)\left\|u_{n}-x^{*}\right\|‖un+1−x∗‖≤(1−αn)‖un−x∗‖
Consider Lemma 2 to obtain
lim n → ∞ ‖ u n − x ∗ ‖ = 0 lim n → ∞ &hairsp; u n − x ∗ = 0 lim_(n rarr oo)||u_(n)-x^(**)||=0\lim _{n \rightarrow \infty}\left\|u_{n}-x^{*}\right\|=0limn→∞‖un−x∗‖=0
For t ∈ [ t 0 , b ] t ∈ t 0 , b t in[t_(0),b]t \in\left[t_{0}, b\right]t∈[t0,b] we have
‖ u n + 1 − x ∗ ‖ = ‖ ( 1 − α n ) u n + α n ( φ ( t 0 ) + ∫ t 0 t f ( s , u n ( s ) , u n ( s − τ ) ) d s ) − − ( 1 − α n ) x ∗ + α n ( φ ( t 0 ) + ∫ t 0 t f ( s , x ∗ ( s ) , x ∗ ( s − τ ) ) d s ) ‖ ≤ ( 1 − α n ) ‖ u n − x ∗ ‖ + α n L f ( b − t 0 ) ( | u n ( s ) − x ∗ ( s ) | + + | u n ( s − τ ) − x ∗ ( s − τ ) | ) ≤ ( 1 − α n + 2 α n L f ( b − t 0 ) ) ‖ u n − x ∗ ‖ ≤ ( 1 − α n ( 1 − 2 L f ( b − t 0 ) ) ‖ u n − x ∗ ‖ u n + 1 − x ∗ = ‖ 1 − α n u n + α n φ t 0 + ∫ t 0 t &hairsp; f s , u n ( s ) , u n ( s − τ ) d s − − 1 − α n x ∗ + α n φ t 0 + ∫ t 0 t &hairsp; f s , x ∗ ( s ) , x ∗ ( s − τ ) d s ‖ ≤ 1 − α n u n − x ∗ + α n L f b − t 0 u n ( s ) − x ∗ ( s ) + + u n ( s − τ ) − x ∗ ( s − τ ) ≤ 1 − α n + 2 α n L f b − t 0 u n − x ∗ ≤ 1 − α n 1 − 2 L f b − t 0 u n − x ∗ {:[||u_(n+1)-x^(**)||=||(1-alpha_(n))u_(n)+alpha_(n)(varphi(t_(0))+int_(t_(0))^(t)f(s,u_(n)(s),u_(n)(s-tau))ds)-],[-(1-alpha_(n))x^(**)+alpha_(n)(varphi(t_(0))+int_(t_(0))^(t)f(s,x^(**)(s),x^(**)(s-tau))ds)||],[ <= (1-alpha_(n))||u_(n)-x^(**)||+alpha_(n)L_(f)(b-t_(0))(|u_(n)(s)-x^(**)(s)|+:}],[{:+|u_(n)(s-tau)-x^(**)(s-tau)|)],[ <= (1-alpha_(n)+2alpha_(n)L_(f)(b-t_(0)))||u_(n)-x^(**)||],[ <= (1-alpha_(n)(1-2L_(f)(b-t_(0)))||u_(n)-x^(**)||:}]:}\begin{aligned} \left\|u_{n+1}-x^{*}\right\|= & \|\left(1-\alpha_{n}\right) u_{n}+\alpha_{n}\left(\varphi\left(t_{0}\right)+\int_{t_{0}}^{t} f\left(s, u_{n}(s), u_{n}(s-\tau)\right) \mathrm{d} s\right)- \\ & -\left(1-\alpha_{n}\right) x^{*}+\alpha_{n}\left(\varphi\left(t_{0}\right)+\int_{t_{0}}^{t} f\left(s, x^{*}(s), x^{*}(s-\tau)\right) \mathrm{d} s\right) \| \\ \leq & \left(1-\alpha_{n}\right)\left\|u_{n}-x^{*}\right\|+\alpha_{n} L_{f}\left(b-t_{0}\right)\left(\left|u_{n}(s)-x^{*}(s)\right|+\right. \\ & \left.+\left|u_{n}(s-\tau)-x^{*}(s-\tau)\right|\right) \\ \leq & \left(1-\alpha_{n}+2 \alpha_{n} L_{f}\left(b-t_{0}\right)\right)\left\|u_{n}-x^{*}\right\| \\ \leq & \left(1-\alpha_{n}\left(1-2 L_{f}\left(b-t_{0}\right)\right)\left\|u_{n}-x^{*}\right\|\right. \end{aligned}‖un+1−x∗‖=‖(1−αn)un+αn(φ(t0)+∫t0tf(s,un(s),un(s−τ))ds)−−(1−αn)x∗+αn(φ(t0)+∫t0tf(s,x∗(s),x∗(s−τ))ds)‖≤(1−αn)‖un−x∗‖+αnLf(b−t0)(|un(s)−x∗(s)|++|un(s−τ)−x∗(s−τ)|)≤(1−αn+2αnLf(b−t0))‖un−x∗‖≤(1−αn(1−2Lf(b−t0))‖un−x∗‖
Assumption ( H 5 H 5 H_(5)H_{5}H5 ) leads us to
1 − α n ( 1 − 2 L f ( b − t 0 ) < 1 1 − α n 1 − 2 L f b − t 0 < 1 1-alpha_(n)(1-2L_(f)(b-t_(0)) < 1:}1-\alpha_{n}\left(1-2 L_{f}\left(b-t_{0}\right)<1\right.1−αn(1−2Lf(b−t0)<1
We take α n := α n ( 1 − 2 L f ( b − t 0 ) ) , a n := ‖ u n − x ∗ ‖ α n := α n 1 − 2 L f b − t 0 , a n := u n − x ∗ alpha_(n):=alpha_(n)(1-2L_(f)(b-t_(0))),a_(n):=||u_(n)-x^(**)||\alpha_{n}:=\alpha_{n}\left(1-2 L_{f}\left(b-t_{0}\right)\right), a_{n}:=\left\|u_{n}-x^{*}\right\|αn:=αn(1−2Lf(b−t0)),an:=‖un−x∗‖ and use Lemma 2 to obtain lim n → ∞ ‖ u n − x ∗ ‖ = 0 lim n → ∞ &hairsp; u n − x ∗ = 0 lim_(n rarr oo)||u_(n)-x^(**)||=0\lim _{n \rightarrow \infty}\left\|u_{n}-x^{*}\right\|=0limn→∞‖un−x∗‖=0.
Theorem 4. [7] Let X X XXX be a normed space, D D DDD a nonempty, convex, closed subset of X X XXX and T : D → D T : D → D T:D rarr DT: D \rightarrow DT:D→D a contraction. If u 0 , x 0 ∈ D u 0 , x 0 ∈ D u_(0),x_(0)in Du_{0}, x_{0} \in Du0,x0∈D, then the following are equivalent:
(i) the Mann iteration (2) converges to x ∗ x ∗ x^(**)x^{*}x∗;
(ii) the Ishikawa iteration (3) converges to x ∗ x ∗ x^(**)x^{*}x∗.
Remark 5. Because Mann iteration and Ishikawa iteration are equivalent, it is possible to consider Ishikawa iteration in order to prove Theorem 3.
Set τ = 0 τ = 0 tau=0\tau=0τ=0, in (4), to obtain the classical existence and uniqueness result, i.e. Theorem 6, for the Cauchy problem. This problem, see [1], 6], is proved by use of contraction principle.
Consider the following equation:
(7) x ′ ( t ) = f ( t , x ( t ) ) , t ∈ [ t 0 , b ] , (7) x ′ ( t ) = f ( t , x ( t ) ) , t ∈ t 0 , b , {:(7)x^(')(t)=f(t","x(t))","t in[t_(0),b]",":}\begin{equation*} x^{\prime}(t)=f(t, x(t)), t \in\left[t_{0}, b\right], \tag{7} \end{equation*}(7)x′(t)=f(t,x(t)),t∈[t0,b],
with initial condition
(8) x ( t 0 ) = φ 0 . (8) x t 0 = φ 0 . {:(8)x(t_(0))=varphi_(0).:}\begin{equation*} x\left(t_{0}\right)=\varphi_{0} . \tag{8} \end{equation*}(8)x(t0)=φ0.
We suppose that the following conditions are fulfilled
( H 1 ′ ) t 0 , φ 0 , b ∈ R H 1 ′ t 0 , φ 0 , b ∈ R (H_(1)^('))t_(0),varphi_(0),b inR\left(\mathrm{H}_{1}^{\prime}\right) t_{0}, \varphi_{0}, b \in \mathbb{R}(H1′)t0,φ0,b∈R;
( H 2 ′ ) f ∈ C ( [ t 0 , b ] × R , R ) H 2 ′ f ∈ C t 0 , b × R , R (H_(2)^('))f in C([t_(0),b]xxR,R)\left(\mathrm{H}_{2}^{\prime}\right) f \in C\left(\left[t_{0}, b\right] \times \mathbb{R}, \mathbb{R}\right)(H2′)f∈C([t0,b]×R,R);
( H 3 ′ ) H 3 ′ (H_(3)^('))\left(\mathrm{H}_{3}^{\prime}\right)(H3′) there exist L f > 0 L f > 0 L_(f) > 0L_{f}>0Lf>0 such that
| f ( t , u 1 ) − f ( t , v 1 ) | ≤ L f ( | u 1 − v 1 | ) , ∀ u 1 , v 1 ∈ R , t ∈ [ t 0 , b ] ; f t , u 1 − f t , v 1 ≤ L f u 1 − v 1 , ∀ u 1 , v 1 ∈ R , t ∈ t 0 , b ; |f(t,u_(1))-f(t,v_(1))| <= L_(f)(|u_(1)-v_(1)|),AAu_(1),v_(1)inR,t in[t_(0),b];\left|f\left(t, u_{1}\right)-f\left(t, v_{1}\right)\right| \leq L_{f}\left(\left|u_{1}-v_{1}\right|\right), \forall u_{1}, v_{1} \in \mathbb{R}, t \in\left[t_{0}, b\right] ;|f(t,u1)−f(t,v1)|≤Lf(|u1−v1|),∀u1,v1∈R,t∈[t0,b];
( H 4 ′ ) L f ( b − t 0 ) < 1 H 4 ′ L f b − t 0 < 1 (H_(4)^('))L_(f)(b-t_(0)) < 1\left(\mathrm{H}_{4}^{\prime}\right) L_{f}\left(b-t_{0}\right)<1(H4′)Lf(b−t0)<1.
Note that we have supplied here a new proof for the following result using Mann-Ishikawa iteration.
Theorem 6. We suppose conditions ( H 1 ′ ) − ( H 4 ′ ) H 1 ′ − H 4 ′ (H_(1)^('))-(H_(4)^('))\left(\mathrm{H}_{1}^{\prime}\right)-\left(\mathrm{H}_{4}^{\prime}\right)(H1′)−(H4′) are satisfied. Then the problem (7)-(8) has a unique solution in C ( [ t 0 , b ] , R ) C t 0 , b , R C([t_(0),b],R)C\left(\left[t_{0}, b\right], \mathbb{R}\right)C([t0,b],R). Moreover, if x ∗ x ∗ x^(**)x^{*}x∗ is the unique solution of the problem (7)-(8), then
x ∗ = lim n → ∞ T n ( x ) for any x ∈ C ( [ t 0 , b ] , R ) . x ∗ = lim n → ∞ &hairsp; T n ( x )  for any  x ∈ C t 0 , b , R . x^(**)=lim_(n rarr oo)T^(n)(x)" for any "x in C([t_(0),b],R).x^{*}=\lim _{n \rightarrow \infty} T^{n}(x) \text { for any } x \in C\left(\left[t_{0}, b\right], \mathbb{R}\right) .x∗=limn→∞Tn(x) for any x∈C([t0,b],R).

REFERENCES

[1] Coman, Gh., Pavel, G., Rus, I. and Rus, I. A., Introduction in the theory of operatorial equation, Ed. Dacia, Cluj-Napoca, 1976 (in Romanian).
[2] Hartman, P., Ordinary differential equations, John Wiley & Sons, Inc., New York, London, Sydney, 1964.
[3] Ishikawa, S., Fixed points by a new iteration method, Proc. Amer. Math. Soc., 44, pp. 147-150, 1974.
[4] Mann, W. R., Mean value in iteration, Proc. Amer. Math. Soc., 4, pp. 506-510, 1953.
[5] Otrocol, D., Data dependence for the solution of a Lotka-Volterra system with two delays, Mathematica, Tome 48 (71), 1, pp. 61-68, 2006.
[6] Rus, I. A., Principles and applications of the fixed point theory, Ed. Dacia, Cluj Napoca, 1979 (in Romanian).
[7] Şoltuz, Ş. M., The equivalence of Picard, Mann and Ishikawa iteration dealing with quasi-contractive operators, Math. Comm. 10, pp. 81-88, 2005.
[8] Şoltuz, Ş. M., An equivalence between the convergence of Ishikawa, Mann and Picard iterations, Math. Comm. 8, pp. 15-22, 2003.
Received by the editors: November 20, 2006.

  1. *"Tiberiu Popoviciu" Institute of Numerical Analysis, P.O. Box. 68-1, Cluj-Napoca, Romania, e-mail: {smsoltuz,dotrocol}@ictp.acad.ro.
    † † ^(†){ }^{\dagger}† Departamento de Matematicas, Universidad de los Andes, Carrera 1, No. 18A-10, Bogota, Columbia, e-mail: smsoltuz@gmail.com.
    ‡ ‡ ^(‡){ }^{\ddagger}‡ The work of the second author was supported by MEdC under Grant 2-CEx06-11-96/ 19.09.2006.
2007

Related Posts