Extending the collage theorem to contractive like operators

Abstract


We prove a “collage” theorem for weak contractive maps and we useit for inverse problems

Authors

Stefan M. Soltuz
Tiberiu Popoviciu Institute of Numerical Analysis, Romanian Academy

Keywords

Weak contractive maps, inverse problems

Paper coordinates

Ş.M. Şoltuz, Extending the collage theorem to contractive like operators, Rev. Anal. Numer. Theor. Approx., 38 (2009) no. 2, pp. 177-181. 
https://ictp.acad.ro/jnaat/journal/article/view/2009-vol38-no2-art8

PDF

About this paper

Journal

Revue d’Analyse Numerique et de Theorie de l’Approximation

Publisher Name

Romanian Academy

Print ISSN

2457-6794

Online ISSN

 2501-059X

google scholar link

[1] Berinde, V.,Approximating fixed points of weak contractions using Picard iteratioon,Nonlinear Analysis Forum,9, pp. 43–53, 2004.
[2] Berinde, M.andBerinde, V.,On a general class of multi-valued weakly Picard map-pings,J. Math. Anal. Appl.,326, pp. 772–782, 2007.
[3] Kunze, H.E.andVrscay, E.R.,Solving inverse problems for ordinary differential equa-tions using the Picard contraction mapping, Inverse Problems,15, pp. 745–770, 1999.
[4] Kunze, H.E.andGomes, S.,Solving an inverse problem for Urison-type integral equa-tions using Banach’s fixed point theorem, Inverse Problems,19, pp. 411–418, 2003.
[5] Kunze, H.E., Hicken, J.E.andVrscay, E.R.,Inverse problems for ODEs using con-traction maps and suboptimality for the ‘collage method’, Inverse Problems,20, pp. 977–991, 2004

Paper (preprint) in HTML form

jnaat,+Journal+manager,+2009-2-Soltuz-15-10-28 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; }

EXTENDING THE COLLAGE THEOREM TO CONTRACTIVE LIKE OPERATORS

ŞTEFAN M. ŞOLTUZ

Abstract

We generalize the classical "collage" theorem, due to Barnsley, to contractive like operators.

MSC 2000. 65J22, 47N40, 47H10.
Keywords. contractive like operators.

1. INTRODUCTION

Let X X XXX be a real Banach space, T : X → X T : X → X T:X rarr XT: X \rightarrow XT:X→X be an operator. The following result of Barnsley, see 1, becomes "a classic".
Theorem 1. (Collage Theorem) Let x ∈ X x ∈ X x in Xx \in Xx∈X be given and T : X → X T : X → X T:X rarr XT: X \rightarrow XT:X→X a contraction with contraction factor L ∈ ( 0 , 1 ) L ∈ ( 0 , 1 ) L in(0,1)L \in(0,1)L∈(0,1), (i.e. ‖ T x − T y ‖ ≤ L ‖ x − y ‖ ‖ T x − T y ‖ ≤ L ‖ x − y ‖ ||Tx-Ty|| <= L||x-y||\|T x-T y\| \leq L\|x-y\|‖Tx−Ty‖≤L‖x−y‖, ∀ x , y ∈ X ∀ x , y ∈ X AA x,y in X\forall x, y \in X∀x,y∈X ), and fixed point x ∗ x ∗ x^(**)x^{*}x∗. Then
‖ x − x ∗ ‖ ≤ 1 1 − L ‖ x − T x ‖ x − x ∗ ≤ 1 1 − L ‖ x − T x ‖ ||x-x^(**)|| <= (1)/(1-L)||x-Tx||\left\|x-x^{*}\right\| \leq \frac{1}{1-L}\|x-T x\|‖x−x∗‖≤11−L‖x−Tx‖
In fractal-based applications, T T TTT produces a union of shrunken copies of x x xxx, i.e. "a collage" of itself. The term ‖ x − T x ‖ ‖ x − T x ‖ ||x-Tx||\|x-T x\|‖x−Tx‖ is referred as "collage distance". Such "collages" are sufficient to be taken in finite number, in order to have a good approximation of an denoised image; fact which is very useful in Image Compression (both Analysis and Synthesis of an image). Kunze et all., see [5], 6], 7), were able to apply the Collage Theorem to inverse problems in ODE, that is to reconstruct the field of an ODE, from a given "target" (trajectory). Our aim is to generalize the above Collage result for a larger operatorial class than contractions. Recently, similar results were introduced for other operatorial classes, see [11] and [12.
The following operatorial class, satisfying (1), was introduced in [4]. Since they failed to named it, we shall do so here. It is just a convention.
Definition 2. The operator T T TTT is contractive-like, or C L C L CLC LCL for short, if there exist a constant q ∈ ( 0 , 1 ) q ∈ ( 0 , 1 ) q in(0,1)q \in(0,1)q∈(0,1) and a monotone increasing and continuous function
ψ : [ 0 , ∞ ) → [ 0 , ∞ ) ψ : [ 0 , ∞ ) → [ 0 , ∞ ) psi:[0,oo)rarr[0,oo)\psi:[0, \infty) \rightarrow[0, \infty)ψ:[0,∞)→[0,∞) with ψ ( 0 ) = 0 ψ ( 0 ) = 0 psi(0)=0\psi(0)=0ψ(0)=0 such that for each x , y ∈ X x , y ∈ X x,y in Xx, y \in Xx,y∈X,
(1) ‖ T x − T y ‖ ≤ q ‖ x − y ‖ + ψ ( ‖ x − T x ‖ ) . (1) ‖ T x − T y ‖ ≤ q ‖ x − y ‖ + ψ ( ‖ x − T x ‖ ) . {:(1)||Tx-Ty|| <= q||x-y||+psi(||x-Tx||).:}\begin{equation*} \|T x-T y\| \leq q\|x-y\|+\psi(\|x-T x\|) . \tag{1} \end{equation*}(1)‖Tx−Ty‖≤q‖x−y‖+ψ(‖x−Tx‖).
Let F ( T ) F ( T ) F(T)F(T)F(T) denote the fixed point set with respect to X X XXX for the map T T TTT. Suppose that x ∗ ∈ F ( T ) x ∗ ∈ F ( T ) x^(**)in F(T)x^{*} \in F(T)x∗∈F(T). The following operators are called Zamfirescu operators, see [13] or [10].
Definition 3. [13] The operator T : X → X T : X → X T:X rarr XT: X \rightarrow XT:X→X satisfies condition Z Z ZZZ (or is a quasi-contraction) if and only if there exist the real numbers a , b , c a , b , c a,b,ca, b, ca,b,c satisfying 0 < a < 1 , 0 < b < 1 / 2 , 0 < c < 1 / 2 0 < a < 1 , 0 < b < 1 / 2 , 0 < c < 1 / 2 0 < a < 1,0 < b < 1//2,0 < c < 1//20<a<1,0<b<1 / 2,0<c<1 / 20<a<1,0<b<1/2,0<c<1/2 such that for each pair x , y x , y x,yx, yx,y in X X XXX, at least one condition is true
( z 1 ) ‖ T x − T y ‖ ≤ a ‖ x − y ‖ z 1 ‖ T x − T y ‖ ≤ a ‖ x − y ‖ (z_(1))||Tx-Ty|| <= a||x-y||\left(z_{1}\right)\|T x-T y\| \leq a\|x-y\|(z1)‖Tx−Ty‖≤a‖x−y‖,
( z 2 ) ‖ T x − T y ‖ ≤ b ( ‖ x − T x ‖ + ‖ y − T y ‖ ) z 2 ‖ T x − T y ‖ ≤ b ( ‖ x − T x ‖ + ‖ y − T y ‖ ) (z_(2))||Tx-Ty|| <= b(||x-Tx||+||y-Ty||)\left(z_{2}\right)\|T x-T y\| \leq b(\|x-T x\|+\|y-T y\|)(z2)‖Tx−Ty‖≤b(‖x−Tx‖+‖y−Ty‖),
( z 3 ) ‖ T x − T y ‖ ≤ c ( ‖ x − T y ‖ + ‖ y − T x ‖ ) z 3 ‖ T x − T y ‖ ≤ c ( ‖ x − T y ‖ + ‖ y − T x ‖ ) (z_(3))||Tx-Ty|| <= c(||x-Ty||+||y-Tx||)\left(z_{3}\right)\|T x-T y\| \leq c(\|x-T y\|+\|y-T x\|)(z3)‖Tx−Ty‖≤c(‖x−Ty‖+‖y−Tx‖).
It has been shown in 2 (see also [3]) that conditions ( z 1 ) − ( z 3 ) z 1 − z 3 (z_(1))-(z_(3))\left(z_{1}\right)-\left(z_{3}\right)(z1)−(z3) lead to
(2) ‖ T x − T y ‖ ≤ δ ‖ x − y ‖ + 2 δ ‖ x − T x ‖ , ∀ x , y ∈ D (2) ‖ T x − T y ‖ ≤ δ ‖ x − y ‖ + 2 δ ‖ x − T x ‖ , ∀ x , y ∈ D {:(2)||Tx-Ty|| <= delta||x-y||+2delta||x-Tx||","AA x","y in D:}\begin{equation*} \|T x-T y\| \leq \delta\|x-y\|+2 \delta\|x-T x\|, \forall x, y \in D \tag{2} \end{equation*}(2)‖Tx−Ty‖≤δ‖x−y‖+2δ‖x−Tx‖,∀x,y∈D
where
δ := max { a , b 1 − b , c 1 − c } . δ := max a , b 1 − b , c 1 − c . delta:=max{a,(b)/(1-b),(c)/(1-c)}.\delta:=\max \left\{a, \frac{b}{1-b}, \frac{c}{1-c}\right\} .δ:=max{a,b1−b,c1−c}.
Set
q := δ , ψ ( a ) := 2 δ a q := δ , ψ ( a ) := 2 δ a q:=delta,psi(a):=2delta aq:=\delta, \psi(a):=2 \delta aq:=δ,ψ(a):=2δa
to obtain (1). Thus, relation (1) generalizes (2). In 4 was introduced this more general class of operators satisfying (1).
Remark 4. Set ψ ( t ) = 2 t ψ ( t ) = 2 t psi(t)=2t\psi(t)=2 tψ(t)=2t to see that a CL operators need not have a fixed point, as pointed in [8] or [9]. Therefore, we shall suppose implicitly throughout this paper that all CL operators involved have a fixed point.
A typical inverse problem is the following:
Problem 5. For given ε > 0 ε > 0 epsi > 0\varepsilon>0ε>0 and a "target" x ¯ x ¯ bar(x)\bar{x}x¯, find T ε ∈ C L T ε ∈ C L T_(epsi)in CLT_{\varepsilon} \in C LTε∈CL such that ‖ x ¯ − x T ε ∗ ‖ < ε x ¯ − x T ε ∗ < ε ||( bar(x))-x_(T_(epsi))^(**)|| < epsi\left\|\bar{x}-x_{T_{\varepsilon}}^{*}\right\|<\varepsilon‖x¯−xTε∗‖<ε, where x T ε ∗ = T ε ( x T ε ∗ ) x T ε ∗ = T ε x T ε ∗ x_(T_(epsi))^(**)=T_(epsi)(x_(T_(epsi))^(**))x_{T_{\varepsilon}}^{*}=T_{\varepsilon}\left(x_{T_{\varepsilon}}^{*}\right)xTε∗=Tε(xTε∗) is the unique fixed point of the C L C L CLC LCL mapping T ε T ε T_(epsi)T_{\varepsilon}Tε.
Randomly selecting various maps in C L C L CLC LCL, finding their fixed points and computing the distance from our target is an extremely tedious procedure. Consider now the following problem which we shall fit in our framework and which is very useful for practitioners, see 5 .
Problem 6. Let x ¯ ∈ X x ¯ ∈ X bar(x)in X\bar{x} \in Xx¯∈X be a target and let δ > 0 δ > 0 delta > 0\delta>0δ>0 be given. Find T δ ∈ C L T δ ∈ C L T_(delta)in CLT_{\delta} \in C LTδ∈CL, such that ‖ x ¯ − T δ x ¯ ‖ < δ x ¯ − T δ x ¯ < δ ||( bar(x))-T_(delta)( bar(x))|| < delta\left\|\bar{x}-T_{\delta} \bar{x}\right\|<\delta‖x¯−Tδx¯‖<δ.
In other words, instead of searching for C L C L CLC LCL maps whose fixed points lie close to target x ¯ x ¯ bar(x)\bar{x}x¯, we search for C L C L CLC LCL maps that send x ¯ x ¯ bar(x)\bar{x}x¯ close to itself.

2. MAIN RESULTS

We shall give a lower bound to approximation error in terms of the collage error.
Proposition 7. Let X X XXX be a real Banach space and T T TTT a C L C L CLC LCL map with contraction factor q ∈ ( 0 , 1 ) q ∈ ( 0 , 1 ) q in(0,1)q \in(0,1)q∈(0,1) and fixed point x ∗ ∈ X x ∗ ∈ X x^(**)in Xx^{*} \in Xx∗∈X. Then for any x ∈ X x ∈ X x in Xx \in Xx∈X,
1 1 + q ‖ x − T x ‖ ≤ ‖ x ∗ − x ‖ . 1 1 + q ‖ x − T x ‖ ≤ x ∗ − x . (1)/(1+q)||x-Tx|| <= ||x^(**)-x||.\frac{1}{1+q}\|x-T x\| \leq\left\|x^{*}-x\right\| .11+q‖x−Tx‖≤‖x∗−x‖.
Proof. For any x ∈ X x ∈ X x in Xx \in Xx∈X satisfying x = x ∗ x = x ∗ x=x^(**)x=x^{*}x=x∗, the above inequality holds. If x ≠ x ∗ , ∀ x ∈ X x ≠ x ∗ , ∀ x ∈ X x!=x^(**),AA x in Xx \neq x^{*}, \forall x \in Xx≠x∗,∀x∈X, then one obtains
‖ T x − x ‖ ≤ ‖ x ∗ − x ‖ + ‖ x ∗ − T x ‖ = ‖ x ∗ − x ‖ + ‖ T x ∗ − T x ‖ ≤ ‖ x ∗ − x ‖ + q ‖ x ∗ − x ‖ + ψ ( ‖ x ∗ − T x ∗ ‖ ) ≤ ( 1 + q ) ‖ x ∗ − x ‖ ‖ T x − x ‖ ≤ x ∗ − x + x ∗ − T x = x ∗ − x + T x ∗ − T x ≤ x ∗ − x + q x ∗ − x + ψ x ∗ − T x ∗ ≤ ( 1 + q ) x ∗ − x {:[||Tx-x|| <= ||x^(**)-x||+||x^(**)-Tx||],[=||x^(**)-x||+||Tx^(**)-Tx||],[ <= ||x^(**)-x||+q||x^(**)-x||+psi(||x^(**)-Tx^(**)||)],[ <= (1+q)||x^(**)-x||]:}\begin{aligned} \|T x-x\| & \leq\left\|x^{*}-x\right\|+\left\|x^{*}-T x\right\| \\ & =\left\|x^{*}-x\right\|+\left\|T x^{*}-T x\right\| \\ & \leq\left\|x^{*}-x\right\|+q\left\|x^{*}-x\right\|+\psi\left(\left\|x^{*}-T x^{*}\right\|\right) \\ & \leq(1+q)\left\|x^{*}-x\right\| \end{aligned}‖Tx−x‖≤‖x∗−x‖+‖x∗−Tx‖=‖x∗−x‖+‖Tx∗−Tx‖≤‖x∗−x‖+q‖x∗−x‖+ψ(‖x∗−Tx∗‖)≤(1+q)‖x∗−x‖
From which one gets the conclusion.
Theorem 8. (Collage theorem for contractive-like maps) Let X X XXX be a real Banach space and T T TTT a C L C L CLC LCL map with contraction factor q ∈ ( 0 , 1 ) q ∈ ( 0 , 1 ) q in(0,1)q \in(0,1)q∈(0,1) and fixed point x ∗ ∈ X x ∗ ∈ X x^(**)in Xx^{*} \in Xx∗∈X. Then for any x ∈ X x ∈ X x in Xx \in Xx∈X,
‖ x ∗ − x ‖ ≤ 1 1 − q ‖ x − T x ‖ x ∗ − x ≤ 1 1 − q ‖ x − T x ‖ ||x^(**)-x|| <= (1)/(1-q)||x-Tx||\left\|x^{*}-x\right\| \leq \frac{1}{1-q}\|x-T x\|‖x∗−x‖≤11−q‖x−Tx‖
Proof. The C L C L CLC LCL condition assures that the fixed point x ∗ x ∗ x^(**)x^{*}x∗ is unique. If x = x ∗ x = x ∗ x=x^(**)x=x^{*}x=x∗, the above inequality holds. If x ≠ x ∗ , ∀ x ∈ X x ≠ x ∗ , ∀ x ∈ X x!=x^(**),AA x in Xx \neq x^{*}, \forall x \in Xx≠x∗,∀x∈X, then one obtains
‖ x ∗ − x ‖ ≤ ‖ T x ∗ − T x ‖ + ‖ T x − x ‖ ≤ q ‖ x ∗ − x ‖ + ψ ( ‖ x ∗ − T x ∗ ‖ ) + ‖ T x − x ‖ = q ‖ x ∗ − x ‖ + ‖ T x − x ‖ x ∗ − x ≤ T x ∗ − T x + ‖ T x − x ‖ ≤ q x ∗ − x + ψ x ∗ − T x ∗ + ‖ T x − x ‖ = q x ∗ − x + ‖ T x − x ‖ {:[||x^(**)-x|| <= ||Tx^(**)-Tx||+||Tx-x||],[ <= q||x^(**)-x||+psi(||x^(**)-Tx^(**)||)+||Tx-x||],[=q||x^(**)-x||+||Tx-x||]:}\begin{aligned} \left\|x^{*}-x\right\| & \leq\left\|T x^{*}-T x\right\|+\|T x-x\| \\ & \leq q\left\|x^{*}-x\right\|+\psi\left(\left\|x^{*}-T x^{*}\right\|\right)+\|T x-x\| \\ & =q\left\|x^{*}-x\right\|+\|T x-x\| \end{aligned}‖x∗−x‖≤‖Tx∗−Tx‖+‖Tx−x‖≤q‖x∗−x‖+ψ(‖x∗−Tx∗‖)+‖Tx−x‖=q‖x∗−x‖+‖Tx−x‖
From which one gets the conclusion.
Remark 9. To summarize, we have the following bounds
1 1 + q ‖ x − T x ‖ ≤ ‖ x ∗ − x ‖ ≤ 1 1 − q ‖ x − T x ‖ . 1 1 + q ‖ x − T x ‖ ≤ x ∗ − x ≤ 1 1 − q ‖ x − T x ‖ . (1)/(1+q)||x-Tx|| <= ||x^(**)-x|| <= (1)/(1-q)||x-Tx||.\frac{1}{1+q}\|x-T x\| \leq\left\|x^{*}-x\right\| \leq \frac{1}{1-q}\|x-T x\| .11+q‖x−Tx‖≤‖x∗−x‖≤11−q‖x−Tx‖.
The above "Collage Theorem" allows us to reformulate the inverse Problem 5 in the particular and more convenient Problem 6.
Theorem 10. If Problem 6 has a solution, then Problem 5 has a solution too.
Proof. Let ε > 0 ε > 0 epsi > 0\varepsilon>0ε>0 and x ¯ ∈ X x ¯ ∈ X bar(x)in X\bar{x} \in Xx¯∈X be given. For δ := ( 1 − q ) ε δ := ( 1 − q ) ε delta:=(1-q)epsi\delta:=(1-q) \varepsilonδ:=(1−q)ε, let T δ ∈ C L T δ ∈ C L T_(delta)in CLT_{\delta} \in C LTδ∈CL be such that ‖ x ¯ − T δ x ¯ ‖ < δ x ¯ − T δ x ¯ < δ ||( bar(x))-T_(delta)( bar(x))|| < delta\left\|\bar{x}-T_{\delta} \bar{x}\right\|<\delta‖x¯−Tδx¯‖<δ. If x T δ ∗ x T δ ∗ x_(T_(delta))^(**)x_{T_{\delta}}^{*}xTδ∗ is the unique fixed point of the C L C L CLC LCL mapping T δ T δ T_(delta)T_{\delta}Tδ, then, by Theorem 8,
‖ x ¯ − x T δ ∗ ‖ ≤ 1 1 − q ‖ x ¯ − T δ x ¯ ‖ ≤ 1 1 − q δ = ε x ¯ − x T δ ∗ ≤ 1 1 − q x ¯ − T δ x ¯ ≤ 1 1 − q δ = ε ||( bar(x))-x_(T_(delta))^(**)|| <= (1)/(1-q)||( bar(x))-T_(delta)( bar(x))|| <= (1)/(1-q)delta=epsi\left\|\bar{x}-x_{T_{\delta}}^{*}\right\| \leq \frac{1}{1-q}\left\|\bar{x}-T_{\delta} \bar{x}\right\| \leq \frac{1}{1-q} \delta=\varepsilon‖x¯−xTδ∗‖≤11−q‖x¯−Tδx¯‖≤11−qδ=ε
Note that shrinking the distance between two operators, one of them from C L C L CLC LCL, reduces the distance between their fixed points.
Proposition 11. Let X X XXX be a real Banach space and T 1 ∈ C L T 1 ∈ C L T_(1)in CLT_{1} \in C LT1∈CL with contraction factor q 1 ∈ ( 0 , 1 ) q 1 ∈ ( 0 , 1 ) q_(1)in(0,1)q_{1} \in(0,1)q1∈(0,1) and T 2 : X → X T 2 : X → X T_(2):X rarr XT_{2}: X \rightarrow XT2:X→X a map such that x 1 ∗ , x 2 ∗ ∈ X x 1 ∗ , x 2 ∗ ∈ X x_(1)^(**),x_(2)^(**)in Xx_{1}^{*}, x_{2}^{*} \in Xx1∗,x2∗∈X are distinct fixed points for T 1 T 1 T_(1)T_{1}T1 and T 2 T 2 T_(2)T_{2}T2. Then,
‖ x 1 ∗ − x 2 ∗ ‖ ≤ 1 1 − q 1 sup x ∈ X ‖ T 1 x − T 2 x ‖ x 1 ∗ − x 2 ∗ ≤ 1 1 − q 1 sup x ∈ X &hairsp; T 1 x − T 2 x ||x_(1)^(**)-x_(2)^(**)|| <= (1)/(1-q_(1))s u p_(x in X)||T_(1)x-T_(2)x||\left\|x_{1}^{*}-x_{2}^{*}\right\| \leq \frac{1}{1-q_{1}} \sup _{x \in X}\left\|T_{1} x-T_{2} x\right\|‖x1∗−x2∗‖≤11−q1supx∈X‖T1x−T2x‖
Proof. Using (1) one obtains
‖ x 1 ∗ − x 2 ∗ ‖ = ‖ T 1 x 1 ∗ − T 2 x 2 ∗ ‖ ≤ ‖ T 1 x 1 ∗ − T 1 x 2 ∗ ‖ + ‖ T 1 x 2 ∗ − T 2 x 2 ∗ ‖ ≤ q 1 ‖ x 1 ∗ − x 2 ∗ ‖ + ψ ( ‖ x 1 ∗ − T 1 x 1 ∗ ‖ ) + sup x ∈ X ‖ T 1 x − T 2 x ‖ , x 1 ∗ − x 2 ∗ = T 1 x 1 ∗ − T 2 x 2 ∗ ≤ T 1 x 1 ∗ − T 1 x 2 ∗ + T 1 x 2 ∗ − T 2 x 2 ∗ ≤ q 1 x 1 ∗ − x 2 ∗ + ψ x 1 ∗ − T 1 x 1 ∗ + sup x ∈ X &hairsp; T 1 x − T 2 x , {:[||x_(1)^(**)-x_(2)^(**)||=||T_(1)x_(1)^(**)-T_(2)x_(2)^(**)|| <= ||T_(1)x_(1)^(**)-T_(1)x_(2)^(**)||+||T_(1)x_(2)^(**)-T_(2)x_(2)^(**)||],[ <= q_(1)||x_(1)^(**)-x_(2)^(**)||+psi(||x_(1)^(**)-T_(1)x_(1)^(**)||)+s u p_(x in X)||T_(1)x-T_(2)x||","]:}\begin{aligned} \left\|x_{1}^{*}-x_{2}^{*}\right\| & =\left\|T_{1} x_{1}^{*}-T_{2} x_{2}^{*}\right\| \leq\left\|T_{1} x_{1}^{*}-T_{1} x_{2}^{*}\right\|+\left\|T_{1} x_{2}^{*}-T_{2} x_{2}^{*}\right\| \\ & \leq q_{1}\left\|x_{1}^{*}-x_{2}^{*}\right\|+\psi\left(\left\|x_{1}^{*}-T_{1} x_{1}^{*}\right\|\right)+\sup _{x \in X}\left\|T_{1} x-T_{2} x\right\|, \end{aligned}‖x1∗−x2∗‖=‖T1x1∗−T2x2∗‖≤‖T1x1∗−T1x2∗‖+‖T1x2∗−T2x2∗‖≤q1‖x1∗−x2∗‖+ψ(‖x1∗−T1x1∗‖)+supx∈X‖T1x−T2x‖,
from which we get the conclusion.
Theorem 12. Let X X XXX be a real Banach space, T : X → X , x ¯ = T x ¯ T : X → X , x ¯ = T x ¯ T:X rarr X, bar(x)=T bar(x)T: X \rightarrow X, \bar{x}=T \bar{x}T:X→X,x¯=Tx¯ and suppose there exists T 1 ∈ C L T 1 ∈ C L T_(1)in CLT_{1} \in C LT1∈CL with contraction factor q q qqq, such that
sup x ∈ X ‖ T 1 x − T x ‖ ≤ ε sup x ∈ X &hairsp; T 1 x − T x ≤ ε s u p_(x in X)||T_(1)x-Tx|| <= epsi\sup _{x \in X}\left\|T_{1} x-T x\right\| \leq \varepsilonsupx∈X‖T1x−Tx‖≤ε
Then
‖ x ¯ − T 1 x ¯ ‖ ≤ 1 + q 1 − q ε x ¯ − T 1 x ¯ ≤ 1 + q 1 − q ε ||( bar(x))-T_(1)( bar(x))|| <= (1+q)/(1-q)epsi\left\|\bar{x}-T_{1} \bar{x}\right\| \leq \frac{1+q}{1-q} \varepsilon‖x¯−T1x¯‖≤1+q1−qε
Proof. Let x ∗ = T 1 x ∗ x ∗ = T 1 x ∗ x^(**)=T_(1)x^(**)x^{*}=T_{1} x^{*}x∗=T1x∗, and by use of Proposition 11 we obtain
‖ x ¯ − x ∗ ‖ ≤ 1 1 − q ( sup x ∈ X ‖ T 1 x − T x ‖ ) x ¯ − x ∗ ≤ 1 1 − q sup x ∈ X &hairsp; T 1 x − T x ||( bar(x))-x^(**)|| <= (1)/(1-q)(s u p_(x in X)||T_(1)x-Tx||)\left\|\bar{x}-x^{*}\right\| \leq \frac{1}{1-q}\left(\sup _{x \in X}\left\|T_{1} x-T x\right\|\right)‖x¯−x∗‖≤11−q(supx∈X‖T1x−Tx‖)
Thus,
‖ x ¯ − T 1 x ¯ ‖ ≤ ‖ x ¯ − x ∗ ‖ + ‖ x ∗ − T 1 x ¯ ‖ ≤ ‖ x ¯ − x ∗ ‖ + ‖ T 1 x ∗ − T 1 x ¯ ‖ ≤ ‖ x ¯ − x ∗ ‖ + q ‖ x ¯ − x ∗ ‖ + ψ ( ‖ x ∗ − T 1 x ∗ ‖ ) = ( 1 + q ) ‖ x ¯ − x ∗ ‖ ≤ 1 + q 1 − q ( sup x ∈ X ‖ T 1 x − T x ‖ ) ≤ 1 + q 1 − q ε . x ¯ − T 1 x ¯ ≤ x ¯ − x ∗ + x ∗ − T 1 x ¯ ≤ x ¯ − x ∗ + T 1 x ∗ − T 1 x ¯ ≤ x ¯ − x ∗ + q x ¯ − x ∗ + ψ x ∗ − T 1 x ∗ = ( 1 + q ) x ¯ − x ∗ ≤ 1 + q 1 − q sup x ∈ X &hairsp; T 1 x − T x ≤ 1 + q 1 − q ε . {:[||( bar(x))-T_(1)( bar(x))|| <= ||( bar(x))-x^(**)||+||x^(**)-T_(1)( bar(x))||],[ <= ||( bar(x))-x^(**)||+||T_(1)x^(**)-T_(1)( bar(x))||],[ <= ||( bar(x))-x^(**)||+q||( bar(x))-x^(**)||+psi(||x^(**)-T_(1)x^(**)||)],[=(1+q)||( bar(x))-x^(**)||],[ <= (1+q)/(1-q)(s u p_(x in X)||T_(1)x-Tx||) <= (1+q)/(1-q)epsi.]:}\begin{aligned} \left\|\bar{x}-T_{1} \bar{x}\right\| & \leq\left\|\bar{x}-x^{*}\right\|+\left\|x^{*}-T_{1} \bar{x}\right\| \\ & \leq\left\|\bar{x}-x^{*}\right\|+\left\|T_{1} x^{*}-T_{1} \bar{x}\right\| \\ & \leq\left\|\bar{x}-x^{*}\right\|+q\left\|\bar{x}-x^{*}\right\|+\psi\left(\left\|x^{*}-T_{1} x^{*}\right\|\right) \\ & =(1+q)\left\|\bar{x}-x^{*}\right\| \\ & \leq \frac{1+q}{1-q}\left(\sup _{x \in X}\left\|T_{1} x-T x\right\|\right) \leq \frac{1+q}{1-q} \varepsilon . \end{aligned}‖x¯−T1x¯‖≤‖x¯−x∗‖+‖x∗−T1x¯‖≤‖x¯−x∗‖+‖T1x∗−T1x¯‖≤‖x¯−x∗‖+q‖x¯−x∗‖+ψ(‖x∗−T1x∗‖)=(1+q)‖x¯−x∗‖≤1+q1−q(supx∈X‖T1x−Tx‖)≤1+q1−qε.

REFERENCES

[1] Barnsley, M. F., Fractals everywhere, New York: Academic Press, 1988.
[2] Berinde, V., On the convergence of the Ishikawa iteration in the class of quasi contractive operators, Acta Math. Univ. Comenianae, Vol. LXXIII, no. 1, pp. 119-126, 2004.
[3] Berinde, V., Iterative approximation of fixed points, Springer-Verlag Berlin Heidelberg, 2007.
[4] Imoru C.O. and Olatiwo, M.O., On the stability of Picard and Mann iteration processes, Carpathian J. Math., 19, pp. 155-160, 2003.
[5] Kunze H.E. and Vrscay, E.R. Solving inverse problems for ordinary differential equations using the Picard contraction mapping, Inverse Problems, 15, pp. 745-770, 1999.
[6] Kunze, H.E. and Gomes, S., Solving an inverse problem for Urison-type integral equations using Banach's fixed point theorem, Inverse Problems, 19, pp. 411-418, 2003.
[7] Kunze, H.E., Hicken, J.E and Vrscay, E.R., Inverse problems for ODEs using contraction maps and suboptimality for the 'collage method', Inverse Problems, 20, pp. 977-991, 2004.
[8] Osilike, M.O., Stability results for fixed point iteration procedures, J. Nigerian Math. Soc., 14/15, pp. 17-29, 1995/96.
[9] Osilike, M.O., Stability of the Ishikawa iteration method for quasi-contractive maps, Indian J. Pure Appl. Math., 28, no. 9, pp. 1251-1265, 1997.
[10] Rhoades, B.E., Fixed point iterations using infinite matrices, Trans. Amer. Math. Soc., 196, pp. 161-176, 1974.
[11] Şoltuz, Ş. M., Solving inverse problems via hemicontractive maps, Nonlinear Analysis, 71, pp. 2387-2390, 2009.
[12] Şoltuz, S. M., Solving inverse problems via weak-contractive maps, Rev. Anal. Numer. Theor. Approx., 37, No. 2, pp. 217-220, 2008. 뜸
[13] Zamfirescu, T., Fix Point Theorems in metric spaces, Arch. Math., 23, pp. 292-298, 1972.
Received by the editors: September 17, 2008.

    • "Tiberiu Popoviciu" Institute of Numerical Analysis, Cluj-Napoca, Romania, P.O. Box 68-1, e-mail: smsoltuz@gmail.com.
2009

Related Posts