Abstract

In 1986, I. Păvăloiu [6] has considered a Banach space and the fixed point problem \[x=\lambda D\left( x\right) +y, \qquad D:X\rightarrow X \ \textrm{nonlinear},\ \lambda\in {\mathbb R},\ y\in X \ \textrm{given}\]written in the equivalent form \(F(x):=x -\lambda D\left( x\right) -y=0\) and solved by the general quasi-Newton method\[x_{n+1}=x_n-A(x_n) \left[ x_n-\lambda D(x_n) -y\right] ,\qquad n=0,1,\ldots\]Semilocal convergence results were obtained, ensuring linear convergence of these iterates. Further results were obtained for the iterates \[x_{n+1}=x_n-[I+\lambda D^\prime(x_n)] \left[x_n+\lambda D(x_n) -y\right] ,\qquad n=0,1,\ldots\] In this note, we analyze the local convergence of these iterates, and, using the Ostrowski local attraction theorem, we give some sufficient conditions such that the iterates converge locally either linearly or with higher convergence orders. The local convergence results require fewer differentiability assumptions for \(D\).

Authors

Keywords

nonlinear equations in Banach spaces; inexact Newton method; quasi-Newton method; Ostrowski local attraction theorem; local convergence; convergence order.

References

PDF

About this paper

Cite this paper as:

E. Cătinaş, On the convergence of some quasi-Newton iterates studied by I. Păvăloiu, J. Numer. Anal. Approx. Theory, 44 (2015) no. 1, pp. 38-41.

Print ISSN

2457-6794

Online ISSN

2501-059X

Google Scholar Profile

[1]   E. Catinas, On  the  superlinear  convergence  of  the  successive  approximations  method, J. Optim. Theory Appl., 113 (2002) no. 3, pp. 473-485. http://dx.doi.org/10.1023/A:1015304720071

[2]   E. Catinas, The  inexact,  inexact  perturbed  and  quasi-Newton  methods  are  equivalent models, Math. Comp., 74 (2005) no. 249, pp. 291-301, http://dx.doi.org/10.1090/S0025-5718-04-01646-1

[3]  E. Catinas, On the convergence orders , manuscript.

[4]   Diaconu, A., Pavaloiu, I., Sur quelque methodes iteratives pour la resolution des  equations operationnel les, Rev. Anal. Numer. Theor. Approx., vol. 1, 45-61 (1972),

https://ictp.acad.ro/jnaat/journal/article/view/1972-vol1-art3

[5]  J.M. Ortega,  W.C. Rheinboldt, Iterative  solution  of  nonlinear  equations  in  several Variables , Academic Press, New York, 1970.

[6]  I. Pavaloiu, La convergence de certaines methodes iteratives pour resoudre certaines equations  operationnelles, Seminar on functional analysis and numerical methods, Preprint(1986), pp. 127-132 (in French).

[7] I. Pavaloiu, A unified treatment of the modified Newton and chord methods, Carpathian J. Math. 25 (2009) no. 2, pp. 192-196.

.

Paper (preprint) in HTML form

jnaat,+Journal+manager,+2015-1-Catinas-16-01-08 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, #preview-content .proof > div, #setText .proof > div, .theorem > div, #preview-content .theorem > div, #setText .theorem > div { margin-top: 1rem; } 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; } .math-inline { display: inline-flex; max-width: 100%; } .math-block[data-width="full"] { overflow-x: auto; display: flex; } .math-block[data-width="full"] mjx-container[jax=SVG][display=true] { display: flex; flex: 1 1; justify-content: center; } 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; } #preview-content table, #setText table { display: table; overflow: auto; max-width: 100%; border-collapse: collapse; page-break-inside: avoid; margin-bottom: 1em; } #preview-content table th, #setText table th { text-align: center; font-weight: bold; } #preview-content table td, #setText table td, #preview-content table th, #setText table th { border: 1px solid #dfe2e5; padding: 6px 13px; } #preview-content table tr, #setText table tr { background-color: #fff; border-top: 1px solid #c6cbd1; } #preview-content table tr:nth-child(2n), #setText table tr:nth-child(2n) { background-color: #f6f8fa; } .main-title, #preview-content .main-title, #setText .main-title { text-align: center; line-height: 1.2; margin: 0 auto 1em auto; } .author, #preview-content .author, #setText .author { text-align: center; margin: 0 auto; display: flex; justify-content: center; flex-wrap: wrap; } .author p, #preview-content .author p, #setText .author p { min-width: 30%; max-width: 50%; padding: 0 7px; } .author > p > span, #preview-content .author > p > span, #setText .author > p > span { display: block; text-align: center; } .section-title, #preview-content .section-title, #setText .section-title { margin-top: 1.5em; } .abstract, #preview-content .abstract, #setText .abstract { text-align: justify; margin-bottom: 1em; } .abstract p, #preview-content .abstract p, #setText .abstract p { margin-bottom: 0; } #preview-content sup, #setText sup { top: -.5em; position: relative; font-size: 75%; line-height: 0; vertical-align: baseline; } .text-url, #preview-content .text-url, #setText .text-url { color: #0B93ff; cursor: text; pointer-events: none; } .text-url a:hover, #preview-content .text-url a:hover, #setText .text-url a:hover { color: #0B93ff; } mark, #preview-content mark, #setText mark { background-color: #feffe6; } span[data-underline-type] mark, #preview-content span[data-underline-type] mark, #setText 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, #preview-content .smiles, #setText .smiles { text-align: center; } div.svg-container, #preview-content > div.svg-container, #setText > div.svg-container { display: flex; justify-content: center; } @media print { #preview { font-size: 10pt !important; } .math-block svg, .math-inline svg { shape-rendering: crispEdges; margin-top: 1px; } #preview-content img, #setText img { display: block; } #preview-content .figure_img img, #setText .figure_img img { display: inline; } #preview-content h1, #preview-content h2, #preview-content h3, #preview-content h4, #preview-content h5, #preview-content h6, #setText h1, #setText h2, #setText h3, #setText h4, #setText h5, #setText h6 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h1::after, #preview-content h2::after, #preview-content h3::after, #preview-content h4::after, #preview-content h5::after, #preview-content h6::after, #setText h1::after, #setText h2::after, #setText h3::after, #setText h4::after, #setText h5::after, #setText h6::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } } #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, #preview-content .hljs-comment, #setText .hljs-comment, #preview-content .hljs-quote, #setText .hljs-quote { color: #998; font-style: italic; } .hljs-command, #preview-content .hljs-command, #setText .hljs-command { color: #005cc5; } .hljs-keyword, .hljs-selector-tag, .hljs-subst, #preview-content .hljs-keyword, #setText .hljs-keyword, #preview-content .hljs-selector-tag, #setText .hljs-selector-tag, #preview-content .hljs-subst, #setText .hljs-subst { color: #d73a49; font-weight: bold; } .hljs-number, .hljs-literal, .hljs-variable, .hljs-template-variable, .hljs-tag .hljs-attr, #preview-content .hljs-number, #setText .hljs-number, #preview-content .hljs-literal, #setText .hljs-literal, #preview-content .hljs-variable, #setText .hljs-variable, #preview-content .hljs-template-variable, #setText .hljs-template-variable, #preview-content .hljs-tag .hljs-attr, #setText .hljs-tag .hljs-attr { color: #005cc5; } .hljs-string, .hljs-doctag, #preview-content .hljs-string, #setText .hljs-string, #preview-content .hljs-doctag, #setText .hljs-doctag { color: #24292e; } .hljs-title, .hljs-section, .hljs-selector-id, #preview-content .hljs-title, #setText .hljs-title, #preview-content .hljs-section, #setText .hljs-section, #preview-content .hljs-selector-id, #setText .hljs-selector-id { color: #6f42c1; font-weight: bold; } .hljs-subst, #preview-content .hljs-subst, #setText .hljs-subst { font-weight: normal; } .hljs-type, .hljs-class .hljs-title, #preview-content .hljs-type, #setText .hljs-type, #preview-content .hljs-class .hljs-title, #setText .hljs-class .hljs-title { color: #458; font-weight: bold; } .hljs-tag, .hljs-name, .hljs-attribute, #preview-content .hljs-tag, #setText .hljs-tag, #preview-content .hljs-name, #setText .hljs-name, #preview-content .hljs-attribute, #setText .hljs-attribute { color: #000080; font-weight: normal; } .hljs-regexp, .hljs-link, #preview-content .hljs-regexp, #setText .hljs-regexp, #preview-content .hljs-link, #setText .hljs-link { color: #009926; } .hljs-symbol, .hljs-bullet, #preview-content .hljs-symbol, #setText .hljs-symbol, #preview-content .hljs-bullet, #setText .hljs-bullet { color: #990073; } .hljs-built_in, .hljs-builtin-name, #preview-content .hljs-built_in, #setText .hljs-built_in, #preview-content .hljs-builtin-name, #setText .hljs-builtin-name { color: #24292e; } .hljs-meta, #preview-content .hljs-meta, #setText .hljs-meta { color: #999; font-weight: bold; } .hljs-meta-keyword, #preview-content .hljs-meta-keyword, #setText .hljs-meta-keyword { color: #d73a49; } .hljs-meta-string, #preview-content .hljs-meta-string, #setText .hljs-meta-string { color: #032f62; } .hljs-deletion, #preview-content .hljs-deletion, #setText .hljs-deletion { background: #fdd; } .hljs-addition, #preview-content .hljs-addition, #setText .hljs-addition { background: #dfd; } .hljs-emphasis, #preview-content .hljs-emphasis, #setText .hljs-emphasis { font-style: italic; } .hljs-strong, #preview-content .hljs-strong, #setText .hljs-strong { font-weight: bold; } .table_tabular, #preview-content .table_tabular, #setText .table_tabular { overflow-x: auto; padding: 0 2px 0.5em 2px; } .tabular, #preview-content .tabular, #setText .tabular { display: inline-table !important; width: auto; table-layout: auto; border-collapse: collapse; border-spacing: 0; margin: 0 0 1em; font-size: inherit; height: fit-content; } .tabular th, #preview-content .tabular th, #setText .tabular th { border: none !important; padding: 6px 13px; background-color: transparent; font-weight: bold; } .tabular tr, #preview-content .tabular tr, #setText .tabular tr { border-top: none !important; border-bottom: none !important; background-color: transparent; } .tabular td, #preview-content .tabular td, #setText .tabular td { border-style: none !important; background-color: #fff; border-color: #000 !important; word-break: keep-all; padding: 0.1em 0.5em !important; } .tabular td > p, #preview-content .tabular td > p, #setText .tabular td > p { margin-bottom: 0; margin-top: 0; } .tabular td._empty, #preview-content .tabular td._empty, #setText .tabular td._empty { height: 1.3em; } .tabular td .f, #preview-content .tabular td .f, #setText .tabular td .f { opacity: 0; } #preview-content .sub-table table, #setText .sub-table table { margin-bottom: 0; } html[data-theme="dark"] .tabular tr, html[data-theme="dark"] #preview-content .tabular tr, html[data-theme="dark"] #setText .tabular tr, html[data-theme="dark"] .tabular td, html[data-theme="dark"] #preview-content .tabular td, html[data-theme="dark"] #setText .tabular td { background-color: #202226; border-color: #fff !important; } .figure_img, #preview-content .figure_img, #setText .figure_img { margin-bottom: 0.5em; overflow-x: auto; } div.figure_img img, #preview-content div.figure_img img, #setText div.figure_img img { display: inline; margin: 0; } ol.enumerate, ul.itemize, #preview-content ol.enumerate, #setText ol.enumerate, #preview-content ul.itemize, #setText ul.itemize { padding-inline-start: 40px; margin: 0 0 1em 0; } li > ol.enumerate, li > ul.itemize, #preview-content li > ol.enumerate, #setText li > ol.enumerate, #preview-content li > ul.itemize, #setText li > ul.itemize { margin: 0; } ul.itemize > li, #preview-content ul.itemize > li, #setText ul.itemize > li { position: relative; min-height: 1.4em; margin-bottom: 0; } .enumerate > .li_enumerate, #preview-content .enumerate > .li_enumerate, #setText .enumerate > .li_enumerate { margin-bottom: 0; } .itemize > li > span.li_level, .li_enumerate.not_number > span.li_level, #preview-content .itemize > li > span.li_level, #setText .itemize > li > span.li_level, #preview-content .li_enumerate.not_number > span.li_level, #setText .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, #preview-content .li_enumerate.not_number, #setText .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, #preview-content .itemize > li > span.li_level .math-inline, #setText .itemize > li > span.li_level .math-inline, #preview-content .enumerate > li > span.li_level .math-inline, #setText .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 0; 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: 0 10px 20px #808080; -webkit-box-shadow: 0 10px 20px #808080; -moz-box-shadow: 0 10px 20px #808080; -khtml-box-shadow: 0 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: none; flex-shrink: 0; } .mmd-menu-item { padding: 8px 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: white; 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; }

ON THE CONVERGENCE OF SOME QUASI-NEWTON ITERATES STUDIED BY I. PĂVĂLOIU

EMIL CĂTINAŞ*Dedicated to prof. I. Păvăloiu on the occasion of his 75th anniversary

Abstract

I. Păvăloiu has considered a Banach space X X XXX and the problem x = λ D ( x ) + y ( D : X → X , λ ∈ R , y ∈ X given ) x = λ D ( x ) + y ( D : X → X , λ ∈ R , y ∈ X  given  ) x=lambda D(x)+y quad(D:X rarr X,lambda inR,y in X" given ")x=\lambda D(x)+y \quad(D: X \rightarrow X, \lambda \in \mathbb{R}, y \in X \text { given })x=λD(x)+y(D:X→X,λ∈R,y∈X given ) written in the equivalent form F ( x ) := x − λ D ( x ) − y = 0 F ( x ) := x − λ D ( x ) − y = 0 F(x):=x-lambda D(x)-y=0F(x):=x-\lambda D(x)-y=0F(x):=x−λD(x)−y=0 and solved by the general quasi-Newton method x k + 1 = x k − A ( x k ) [ x k − λ D ( x k ) − y ] , k = 0 , 1 , … x k + 1 = x k − A x k x k − λ D x k − y , k = 0 , 1 , … x_(k+1)=x_(k)-A(x_(k))[x_(k)-lambda D(x_(k))-y],quad k=0,1,dotsx_{k+1}=x_{k}-A\left(x_{k}\right)\left[x_{k}-\lambda D\left(x_{k}\right)-y\right], \quad k=0,1, \ldotsxk+1=xk−A(xk)[xk−λD(xk)−y],k=0,1,…

Semilocal convergence results were obtained, ensuring linear convergence of this method. Further results were obtained for the iterates: x k + 1 = x k − [ I + λ D ′ ( x k ) ] [ x k − λ D ( x k ) − y ] , k = 0 , 1 , … x k + 1 = x k − I + λ D ′ x k x k − λ D x k − y , k = 0 , 1 , … x_(k+1)=x_(k)-[I+lambdaD^(')(x_(k))][x_(k)-lambda D(x_(k))-y],quad k=0,1,dotsx_{k+1}=x_{k}-\left[I+\lambda D^{\prime}\left(x_{k}\right)\right]\left[x_{k}-\lambda D\left(x_{k}\right)-y\right], \quad k=0,1, \ldotsxk+1=xk−[I+λD′(xk)][xk−λD(xk)−y],k=0,1,…

In this note, we analyze the local convergence of these iterates, and, using the Ostrowski local attraction theorem, we give some sufficient conditions such that the iterates converge locally either linearly or with higher convergence orders. The local convergence results require fewer differentiability assumptions for D D DDD.

MSC 2010. 65H10.
Keywords. quasi-Newton methods, Ostrowski local attraction theorem, local convergence.

1. INTRODUCTION

In [6], Păvăloiu has considered a Banach space ( X , ‖ ⋅ ‖ X , ‖ ⋅ ‖ X,||*||X,\|\cdot\|X,‖⋅‖ ), a nonlinear mapping D : X → X D : X → X D:X rarr XD: X \rightarrow XD:X→X, a parameter λ ∈ R λ ∈ R lambda inR\lambda \in \mathbb{R}λ∈R, an element y ∈ X y ∈ X y in Xy \in Xy∈X and the equation (arising from certain integral equations)
(1) x = λ D ( x ) + y (1) x = λ D ( x ) + y {:(1)x=lambda D(x)+y:}\begin{equation*} x=\lambda D(x)+y \tag{1} \end{equation*}(1)x=λD(x)+y
solved by the following iterations:
(2) x k + 1 = x k − A ( x k ) [ x k − λ D ( x k ) − y ] , k = 0 , 1 , … , x 0 ∈ E ⊆ X , (2) x k + 1 = x k − A x k x k − λ D x k − y , k = 0 , 1 , … , x 0 ∈ E ⊆ X , {:(2)x_(k+1)=x_(k)-A(x_(k))[x_(k)-lambda D(x_(k))-y]","quad k=0","1","dots","x_(0)in E sube X",":}\begin{equation*} x_{k+1}=x_{k}-A\left(x_{k}\right)\left[x_{k}-\lambda D\left(x_{k}\right)-y\right], \quad k=0,1, \ldots, x_{0} \in E \subseteq X, \tag{2} \end{equation*}(2)xk+1=xk−A(xk)[xk−λD(xk)−y],k=0,1,…,x0∈E⊆X,
where A ( x ) : E → E A ( x ) : E → E A(x):E rarr EA(x): E \rightarrow EA(x):E→E is a linear continuous mapping (i.e., A ( x ) ∈ L ( X ) A ( x ) ∈ L ( X ) A(x)inL(X)A(x) \in \mathcal{L}(X)A(x)∈L(X) ), for each x ∈ E x ∈ E x in Ex \in Ex∈E.
Denoting
(3) F ( x ) = x − λ D ( x ) − y (3) F ( x ) = x − λ D ( x ) − y {:(3)F(x)=x-lambda D(x)-y:}\begin{equation*} F(x)=x-\lambda D(x)-y \tag{3} \end{equation*}(3)F(x)=x−λD(x)−y
the above iterations can be written as
x k + 1 = x k − A ( x k ) F ( x k ) , k = 0 , 1 , … ; x k + 1 = x k − A x k F x k , k = 0 , 1 , … ; x_(k+1)=x_(k)-A(x_(k))F(x_(k)),quad k=0,1,dots;x_{k+1}=x_{k}-A\left(x_{k}\right) F\left(x_{k}\right), \quad k=0,1, \ldots ;xk+1=xk−A(xk)F(xk),k=0,1,…;
in a subsequent paper, Părăloiu [7] has analyzed the above iterations for general mappings F F FFF, not necessarily given by (3).
The following semilocal convergence results were obtained.
Theorem 1. [6] If the mappings D D DDD and A ( x ) A ( x ) A(x)A(x)A(x), the initial approximation x 0 x 0 x_(0)x_{0}x0 and the real number r > 0 r > 0 r > 0r>0r>0 satisfy the following conditions:
i. the mapping D D DDD admits Fréchet derivatives of order one and two on the ball S = S ( x 0 , r ) S = S x 0 , r S=S(x_(0),r)S=S\left(x_{0}, r\right)S=S(x0,r);
ii. ‖ A ( x ) ‖ ≤ β ‖ A ( x ) ‖ ≤ β ||A(x)|| <= beta\|A(x)\| \leq \beta‖A(x)‖≤β, for each x ∈ S x ∈ S x in Sx \in Sx∈S, and some β > 0 β > 0 beta > 0\beta>0β>0;
iii. ‖ I − F ′ ( x ) A ( x ) ‖ ≤ α I − F ′ ( x ) A ( x ) ≤ α ||I-F^(')(x)A(x)|| <= alpha\left\|I-F^{\prime}(x) A(x)\right\| \leq \alpha‖I−F′(x)A(x)‖≤α, for each x ∈ S x ∈ S x in Sx \in Sx∈S, and some α > 0 α > 0 alpha > 0\alpha>0α>0;
iv. ‖ D ′ ′ ( x ) ‖ ≤ M / | λ | D ′ ′ ( x ) ≤ M / | λ | ||D^('')(x)|| <= M//|lambda|\left\|D^{\prime \prime}(x)\right\| \leq M /|\lambda|‖D′′(x)‖≤M/|λ|, for each x ∈ S x ∈ S x in Sx \in Sx∈S, and some M > 0 M > 0 M > 0M>0M>0;
v. β ρ 0 1 − d 0 ≤ r β ρ 0 1 − d 0 ≤ r (betarho_(0))/(1-d_(0)) <= r\frac{\beta \rho_{0}}{1-d_{0}} \leq rβρ01−d0≤r, where ρ 0 = ‖ F ( x 0 ) ‖ , d 0 = M β 2 ρ 0 2 + α ρ 0 = F x 0 , d 0 = M β 2 ρ 0 2 + α rho_(0)=||F(x_(0))||,d_(0)=(Mbeta^(2)rho_(0))/(2)+alpha\rho_{0}=\left\|F\left(x_{0}\right)\right\|, d_{0}=\frac{M \beta^{2} \rho_{0}}{2}+\alphaρ0=‖F(x0)‖,d0=Mβ2ρ02+α;
vi. d 0 < 1 d 0 < 1 d_(0) < 1d_{0}<1d0<1,
then the sequence ( x k ) k ≥ 0 x k k ≥ 0 (x_(k))_(k >= 0)\left(x_{k}\right)_{k \geq 0}(xk)k≥0 given by (2) converges: x ∗ = lim k → ∞ x k x ∗ = lim k → ∞ &hairsp; x k x^(**)=lim_(k rarr oo)x_(k)x^{*}=\lim _{k \rightarrow \infty} x_{k}x∗=limk→∞xk, with F ( x ∗ ) = 0 F x ∗ = 0 F(x^(**))=0F\left(x^{*}\right)=0F(x∗)=0. The following estimations hold:
‖ x ∗ − x k ‖ ≤ β d 0 k ρ 0 1 − d 0 , k = 0 , 1 , … x ∗ − x k ≤ β d 0 k ρ 0 1 − d 0 , k = 0 , 1 , … ||x^(**)-x_(k)|| <= (betad_(0)^(k)rho_(0))/(1-d_(0)),quad k=0,1,dots\left\|x^{*}-x_{k}\right\| \leq \frac{\beta d_{0}^{k} \rho_{0}}{1-d_{0}}, \quad k=0,1, \ldots‖x∗−xk‖≤βd0kρ01−d0,k=0,1,…
When ‖ λ D ′ ( x ) ‖ < 1 λ D ′ ( x ) < 1 ||lambdaD^(')(x)|| < 1\left\|\lambda D^{\prime}(x)\right\|<1‖λD′(x)‖<1, it is known that the operator I − λ D ′ ( x ) I − λ D ′ ( x ) I-lambdaD^(')(x)I-\lambda D^{\prime}(x)I−λD′(x) is invertible, with ( I − λ D ′ ( x ) ) − 1 = I + λ D ′ ( x ) + λ 2 D ′ ( x ) 2 + … I − λ D ′ ( x ) − 1 = I + λ D ′ ( x ) + λ 2 D ′ ( x ) 2 + … (I-lambdaD^(')(x))^(-1)=I+lambdaD^(')(x)+lambda^(2)D^(')(x)^(2)+dots\left(I-\lambda D^{\prime}(x)\right)^{-1}=I+\lambda D^{\prime}(x)+\lambda^{2} D^{\prime}(x)^{2}+\ldots(I−λD′(x))−1=I+λD′(x)+λ2D′(x)2+… Păvăloiu has considered the operator A ( x ) A ( x ) A(x)A(x)A(x) as being given by the first two terms of this expansion, obtaining the following iterates
(4) x k + 1 = x k − ( I + λ D ′ ( x k ) ) [ x k − λ D ( x k ) − y ] , k = 0 , 1 , … , (4) x k + 1 = x k − I + λ D ′ x k x k − λ D x k − y , k = 0 , 1 , … , {:(4)x_(k+1)=x_(k)-(I+lambdaD^(')(x_(k)))[x_(k)-lambda D(x_(k))-y]","quad k=0","1","dots",":}\begin{equation*} x_{k+1}=x_{k}-\left(I+\lambda D^{\prime}\left(x_{k}\right)\right)\left[x_{k}-\lambda D\left(x_{k}\right)-y\right], \quad k=0,1, \ldots, \tag{4} \end{equation*}(4)xk+1=xk−(I+λD′(xk))[xk−λD(xk)−y],k=0,1,…,
and the following result.
Theorem 2. [6 If the mapping D D DDD, the initial approximation x 0 x 0 x_(0)x_{0}x0 and the real number r > 0 r > 0 r > 0r>0r>0 satisfy the following assumptions:
i. the mapping D D DDD admits Fréchet derivatives of order one and two for each x ∈ S = S ( x 0 , r ) x ∈ S = S x 0 , r x in S=S(x_(0),r)x \in S=S\left(x_{0}, r\right)x∈S=S(x0,r);
ii. ‖ D ′ ( x ) ‖ ≤ b D ′ ( x ) ≤ b ||D^(')(x)|| <= b\left\|D^{\prime}(x)\right\| \leq b‖D′(x)‖≤b, for each x ∈ S x ∈ S x in Sx \in Sx∈S;
iii. ‖ D ′ ′ ( x ) ‖ ≤ M / | λ | D ′ ′ ( x ) ≤ M / | λ | ||D^('')(x)|| <= M//|lambda|\left\|D^{\prime \prime}(x)\right\| \leq M /|\lambda|‖D′′(x)‖≤M/|λ|, for each x ∈ S x ∈ S x in Sx \in Sx∈S;
iv. 2 − M ρ 0 > 0 2 − M ρ 0 > 0 2-Mrho_(0) > 02-M \rho_{0}>02−Mρ0>0, where ρ 0 = ‖ x 0 − λ D ( x 0 ) − y ‖ ρ 0 = x 0 − λ D x 0 − y rho_(0)=||x_(0)-lambda D(x_(0))-y||\rho_{0}=\left\|x_{0}-\lambda D\left(x_{0}\right)-y\right\|ρ0=‖x0−λD(x0)−y‖;
v. ρ 0 ( 1 + | λ | b ) 1 − d 0 ≤ r ρ 0 ( 1 + | λ | b ) 1 − d 0 ≤ r (rho_(0)(1+|lambda|b))/(1-d_(0)) <= r\frac{\rho_{0}(1+|\lambda| b)}{1-d_{0}} \leq rρ0(1+|λ|b)1−d0≤r, where d 0 = M ( 1 + | λ | b ) 2 2 ρ 0 + λ 2 b 2 d 0 = M ( 1 + | λ | b ) 2 2 ρ 0 + λ 2 b 2 d_(0)=M((1+|lambda|b)^(2))/(2)rho_(0)+lambda^(2)b^(2)d_{0}=M \frac{(1+|\lambda| b)^{2}}{2} \rho_{0}+\lambda^{2} b^{2}d0=M(1+|λ|b)22ρ0+λ2b2;
vi. | λ | ≤ 2 − M ρ 0 b ( 2 + M ρ 0 ) | λ | ≤ 2 − M ρ 0 b 2 + M ρ 0 |lambda| <= (2-Mrho_(0))/(b(2+Mrho_(0)))|\lambda| \leq \frac{2-M \rho_{0}}{b\left(2+M \rho_{0}\right)}|λ|≤2−Mρ0b(2+Mρ0),
then the sequence given by (4) converges to a solution x ∗ x ∗ x^(**)x^{*}x∗ of equation (1) and the following estimates hold:
‖ x ∗ − x k ‖ ≤ ( 1 + | λ | b ) d 0 k ρ 0 1 − d 0 , k = 0 , 1 , … x ∗ − x k ≤ ( 1 + | λ | b ) d 0 k ρ 0 1 − d 0 , k = 0 , 1 , … ||x^(**)-x_(k)|| <= ((1+|lambda|b)d_(0)^(k)rho_(0))/(1-d_(0)),quad k=0,1,dots\left\|x^{*}-x_{k}\right\| \leq \frac{(1+|\lambda| b) d_{0}^{k} \rho_{0}}{1-d_{0}}, \quad k=0,1, \ldots‖x∗−xk‖≤(1+|λ|b)d0kρ01−d0,k=0,1,…
Remark 3. We note that the assumptions of the above results require the existence of the second derivative of D D DDD, and also that the smaller d 0 d 0 d_(0)d_{0}d0 (i.e., the smaller | λ | , b , M | λ | , b , M |lambda|,b,M|\lambda|, b, M|λ|,b,M and ρ 0 ρ 0 rho_(0)\rho_{0}ρ0 ), the faster is the convergence of sequence (4).

2. LOCAL CONVERGENCE

In order to analyze the local convergence of the considered iterates, we shall use the Ostrowski local attraction theorem, which offers sharp general conditions ensuring the local convergence. We shall consider for simplicity that X = R n X = R n X=R^(n)X=\mathbb{R}^{n}X=Rn, with ‖ ⋅ ‖ ‖ ⋅ ‖ ||*||\|\cdot\|‖⋅‖ an arbitrary given norm, though the results hold in Banach spaces (see, e.g., [5, NR 10.1-3.]).
Theorem 4 (Ostrowski local attraction theorem). [5, Th. 10.1.3] Suppose that G : Ω ⊂ R n → R n G : Ω ⊂ R n → R n G:Omega subR^(n)rarrR^(n)G: \Omega \subset \mathbb{R}^{n} \rightarrow \mathbb{R}^{n}G:Ω⊂Rn→Rn has a fixed point x ∗ ∈ int ( Ω ) x ∗ ∈ int ( Ω ) x^(**)in int(Omega)x^{*} \in \operatorname{int}(\Omega)x∗∈int(Ω) and is differentiable at x ∗ x ∗ x^(**)x^{*}x∗. If the spectral radius of G ′ ( x ∗ ) G ′ x ∗ G^(')(x^(**))G^{\prime}\left(x^{*}\right)G′(x∗) satisfies
ρ ( G ′ ( x ∗ ) ) = σ < 1 , ρ G ′ x ∗ = σ < 1 , rho(G^(')(x^(**)))=sigma < 1,\rho\left(G^{\prime}\left(x^{*}\right)\right)=\sigma<1,ρ(G′(x∗))=σ<1,
then x ∗ x ∗ x^(**)x^{*}x∗ is a point of attraction of the successive approximations x k + 1 = G ( x k ) x k + 1 = G x k x_(k+1)=G(x_(k))x_{k+1}=G\left(x_{k}\right)xk+1=G(xk), k ≥ 0 k ≥ 0 k >= 0k \geq 0k≥0, i.e., there exists an open neighborhood V ⊆ Ω V ⊆ Ω V sube OmegaV \subseteq \OmegaV⊆Ω of x ∗ x ∗ x^(**)x^{*}x∗ such that ∀ x 0 ∈ V ∀ x 0 ∈ V AAx_(0)in V\forall x_{0} \in V∀x0∈V, the successive approximations given above all lie in Ω Ω Omega\OmegaΩ and converge to x ∗ x ∗ x^(**)x^{*}x∗.
Remark 5. The classical book of Ortega and Rheinboldt also contains completions to this result (see [5, Ch. 10]), in the sense that the spectral radius σ σ sigma\sigmaσ yields the "worst" ( r − r − r-r-r− )convergence factor among the sequences converging to the fixed point: when σ ≠ 0 σ ≠ 0 sigma!=0\sigma \neq 0σ≠0, the convergence of the (whole) process is not faster than linear (though, theoretically, there may exist sequences converging at least r r rrr-superlinearly), while when σ = 0 σ = 0 sigma=0\sigma=0σ=0, all the sequences converge at least r r rrr-superlinearly. This result was refined by us in [1], where we have shown that x k → x ∗ q x k → x ∗ q x_(k)rarrx^(**)qx_{k} \rightarrow x^{*} qxk→x∗q-superlinearly iff G ′ ( x ∗ ) G ′ x ∗ G^(')(x^(**))G^{\prime}\left(x^{*}\right)G′(x∗) has a zero eigenvalue and, starting from a certain step, x ∗ − x k x ∗ − x k x^(**)-x_(k)x^{*}-x_{k}x∗−xk are corresponding eigenvectors. This implies that no q q qqq-superlinear convergence may occur when G ′ ( x ∗ ) G ′ x ∗ G^(')(x^(**))G^{\prime}\left(x^{*}\right)G′(x∗) has no zero eigenvalue.
The above result can be applied to method (2) if we notice that the derivative of x − A ( x ) F ( x ) x − A ( x ) F ( x ) x-A(x)F(x)x-A(x) F(x)x−A(x)F(x) has a simple form at the fixed point x ∗ x ∗ x^(**)x^{*}x∗, the following auxiliary result being similar to (Lemma) 10.2.1 in [5].
Lemma 6. Suppose that F : Ω ⊂ R n → R n F : Ω ⊂ R n → R n F:Omega subR^(n)rarrR^(n)F: \Omega \subset \mathbb{R}^{n} \rightarrow \mathbb{R}^{n}F:Ω⊂Rn→Rn is differentiable at a point x ∗ ∈ int ( Ω ) x ∗ ∈ int ( Ω ) x^(**)in int(Omega)x^{*} \in \operatorname{int}(\Omega)x∗∈int(Ω) for which F ( x ∗ ) = 0 F x ∗ = 0 F(x^(**))=0F\left(x^{*}\right)=0F(x∗)=0. Let A : Ω 0 → L ( R n ) A : Ω 0 → L R n A:Omega_(0)rarrL(R^(n))A: \Omega_{0} \rightarrow \mathcal{L}\left(\mathbb{R}^{n}\right)A:Ω0→L(Rn) be defined on an open neighborhood Ω 0 ⊆ Ω Ω 0 ⊆ Ω Omega_(0)sube Omega\Omega_{0} \subseteq \OmegaΩ0⊆Ω of x ∗ x ∗ x^(**)x^{*}x∗ and continuous at x ∗ x ∗ x^(**)x^{*}x∗. Then the mapping G : S → R n G : S → R n G:S rarrR^(n)G: S \rightarrow \mathbb{R}^{n}G:S→Rn,
G ( x ) = x − A ( x ) F ( x ) G ( x ) = x − A ( x ) F ( x ) G(x)=x-A(x)F(x)G(x)=x-A(x) F(x)G(x)=x−A(x)F(x)
is differentiable at x ∗ x ∗ x^(**)x^{*}x∗ and
G ′ ( x ∗ ) = I − A ( x ∗ ) F ′ ( x ∗ ) . G ′ x ∗ = I − A x ∗ F ′ x ∗ . G^(')(x^(**))=I-A(x^(**))F^(')(x^(**)).G^{\prime}\left(x^{*}\right)=I-A\left(x^{*}\right) F^{\prime}\left(x^{*}\right) .G′(x∗)=I−A(x∗)F′(x∗).
Proof. The proof is elementary:
‖ G ( x ) − G ( x ∗ ) − [ I − A ( x ∗ ) F ′ ( x ∗ ) ] ( x − x ∗ ) ‖ = = ‖ ( A ( x ) − A ( x ∗ ) ) F ( x ) + A ( x ∗ ) [ F ( x ) − F ( x ∗ ) − F ′ ( x ∗ ) ( x − x ∗ ) ] ‖ = o ( ‖ x − x ∗ ‖ ) , as x → x ∗ G ( x ) − G x ∗ − I − A x ∗ F ′ x ∗ x − x ∗ = = A ( x ) − A x ∗ F ( x ) + A x ∗ F ( x ) − F x ∗ − F ′ x ∗ x − x ∗ = o x − x ∗ ,  as  x → x ∗ {:[||G(x)-G(x^(**))-[I-A(x^(**))F^(')(x^(**))](x-x^(**))||=],[=||(A(x)-A(x^(**)))F(x)+A(x^(**))[F(x)-F(x^(**))-F^(')(x^(**))(x-x^(**))]||],[=o(||x-x^(**)||)","quad" as "x rarrx^(**)]:}\begin{aligned} & \left\|G(x)-G\left(x^{*}\right)-\left[I-A\left(x^{*}\right) F^{\prime}\left(x^{*}\right)\right]\left(x-x^{*}\right)\right\|= \\ & =\left\|\left(A(x)-A\left(x^{*}\right)\right) F(x)+A\left(x^{*}\right)\left[F(x)-F\left(x^{*}\right)-F^{\prime}\left(x^{*}\right)\left(x-x^{*}\right)\right]\right\| \\ & =o\left(\left\|x-x^{*}\right\|\right), \quad \text { as } x \rightarrow x^{*} \end{aligned}‖G(x)−G(x∗)−[I−A(x∗)F′(x∗)](x−x∗)‖==‖(A(x)−A(x∗))F(x)+A(x∗)[F(x)−F(x∗)−F′(x∗)(x−x∗)]‖=o(‖x−x∗‖), as x→x∗
Now we can state the main results of this note. First, consider iterations (2).
Theorem 7. Let D : R n → R n , y ∈ R n , λ ∈ R , x ∗ D : R n → R n , y ∈ R n , λ ∈ R , x ∗ D:R^(n)rarrR^(n),y inR^(n),lambda inR,x^(**)D: \mathbb{R}^{n} \rightarrow \mathbb{R}^{n}, y \in \mathbb{R}^{n}, \lambda \in \mathbb{R}, x^{*}D:Rn→Rn,y∈Rn,λ∈R,x∗ a solution of F ( x ) := x − λ D ( x ) − y = 0 F ( x ) := x − λ D ( x ) − y = 0 F(x):=x-lambda D(x)-y=0F(x):= x-\lambda D(x)-y=0F(x):=x−λD(x)−y=0, and the mapping A A AAA is defined on an open neighborhood E E EEE of x ∗ , A : E → L ( R n ) x ∗ , A : E → L R n x^(**),A:E rarrL(R^(n))x^{*}, A: E \rightarrow \mathcal{L}\left(\mathbb{R}^{n}\right)x∗,A:E→L(Rn). If D D DDD is differentiable at x ∗ , A x ∗ , A x^(**),Ax^{*}, Ax∗,A is continuous at x ∗ x ∗ x^(**)x^{*}x∗ and
ρ ( I − A ( x ∗ ) ( I − λ D ′ ( x ∗ ) ) < 1 ρ I − A x ∗ I − λ D ′ x ∗ < 1 rho(I-A(x^(**))(I-lambdaD^(')(x^(**))) < 1:}\rho\left(I-A\left(x^{*}\right)\left(I-\lambda D^{\prime}\left(x^{*}\right)\right)<1\right.ρ(I−A(x∗)(I−λD′(x∗))<1
then x ∗ x ∗ x^(**)x^{*}x∗ is a point of attraction for the method (2).
The proof is an immediate application of Lemma 6 and Theorem 4.
The conditions are much simpler for the case of the second method.
Theorem 8. Let D : R n → R n , y ∈ R n , λ ∈ R , x ∗ D : R n → R n , y ∈ R n , λ ∈ R , x ∗ D:R^(n)rarrR^(n),y inR^(n),lambda inR,x^(**)D: \mathbb{R}^{n} \rightarrow \mathbb{R}^{n}, y \in \mathbb{R}^{n}, \lambda \in \mathbb{R}, x^{*}D:Rn→Rn,y∈Rn,λ∈R,x∗ a solution of F ( x ) := x − λ D ( x ) − y = 0 F ( x ) := x − λ D ( x ) − y = 0 F(x):=x-lambda D(x)-y=0F(x):= x-\lambda D(x)-y=0F(x):=x−λD(x)−y=0. If the mapping D D DDD is differentiable on an open neighborhood of x ∗ x ∗ x^(**)x^{*}x∗, with D ′ D ′ D^(')D^{\prime}D′ continuous at x ∗ x ∗ x^(**)x^{*}x∗, and
| λ | ρ ( D ′ ( x ∗ ) ) < 1 | λ | ρ D ′ x ∗ < 1 |lambda|rho(D^(')(x^(**))) < 1|\lambda| \rho\left(D^{\prime}\left(x^{*}\right)\right)<1|λ|ρ(D′(x∗))<1
then x ∗ x ∗ x^(**)x^{*}x∗ is a point of attraction for the method (4).
Proof. By Lemma 6 we get
G ′ ( x ∗ ) = I − ( I + λ D ′ ( x ∗ ) ) ( I − λ D ′ ( x ∗ ) ) = λ 2 D ′ ( x ∗ ) 2 , G ′ x ∗ = I − I + λ D ′ x ∗ I − λ D ′ x ∗ = λ 2 D ′ x ∗ 2 , G^(')(x^(**))=I-(I+lambdaD^(')(x^(**)))(I-lambdaD^(')(x^(**)))=lambda^(2)D^(')(x^(**))^(2),G^{\prime}\left(x^{*}\right)=I-\left(I+\lambda D^{\prime}\left(x^{*}\right)\right)\left(I-\lambda D^{\prime}\left(x^{*}\right)\right)=\lambda^{2} D^{\prime}\left(x^{*}\right)^{2},G′(x∗)=I−(I+λD′(x∗))(I−λD′(x∗))=λ2D′(x∗)2,
whence, by Theorem 4, the conclusion follows.
The same observations as in Remark 5 apply.

REFERENCES

[1] E. Cătinaş, On the superlinear convergence of the successive approximations method, J. Optim. Theory Appl., 113 (2002) no. 3, pp. 473-485. 뜬
[2] E. Cătinaş, The inexact, inexact perturbed and quasi-Newton methods are equivalent models, Math. Comp., 74 (2005) no. 249, pp. 291-301. ㄸ
[3] E. Cătinaş, On the convergence orders, manuscript.
[4] Diaconu, A., Păvăloiu, I., Sur quelque méthodes itératives pour la resolution des équations opérationnelles, Rev. Anal. Numér. Theor. Approx., vol. 1, 45-61 (1972). ㄸ
[5] J.M. Ortega, W.C. Rheinboldt, Iterative solution of nonlinear equations in several variables, Academic Press, New York, 1970.
[6] I. Păvăloiu, La convergence de certaines méthodes itératives pour résoudre certaines equations operationnelles, Seminar on functional analysis and numerical methods, Preprint no. 1 (1986), pp. 127-132 (in French).
[7] I. Păvăloiu, A unified treatment of the modified Newton and chord methods, Carpathian J. Math. 25 (2009) no. 2, pp. 192-196.
Received by the editors: October 3, 2015.

  1. *"T. Popoviciu" Institute of Numerical Analysis, P.O. Box 68-1, Cluj-Napoca, Romania, e-mail: ecatinas@ictp.acad.ro.
(() => { window.MathpixRenderConfig = {"width":1200,"outMath":{"output_format":"svg","include_svg":true,"include_asciimath":true,"include_latex":true,"include_mathml":true,"include_mathml_word":true,"include_tsv":true,"include_table_markdown":true,"include_smiles":true},"accessibility":{"assistive_mml":true,"include_speech":false}}; const autoScript = document.createElement('script'); autoScript.src = "https://cdn.jsdelivr.net/npm/mathpix-markdown-it@2.0.37/es5/browser/auto-render.js"; autoScript.onload = () => { console.log("[Mathpix] auto-render loaded"); }; autoScript.onerror = () => { console.error("[Mathpix] Failed to load auto-render script:", autoScript.src); }; document.head.append(autoScript); })(); (() => { const ctxScript = document.createElement('script'); ctxScript.src = "https://cdn.jsdelivr.net/npm/mathpix-markdown-it@2.0.37/es5/context-menu.js"; ctxScript.onload = () => { const init = () => { window.addListenerContextMenuEvents?.(); }; if (document.readyState === "loading") { document.addEventListener("DOMContentLoaded", init, { once: true }); } else { init(); } if (!window.__mathpixContextMenuKeyHandlerInstalled) { window.__mathpixContextMenuKeyHandlerInstalled = true; document.addEventListener("keydown", (e) => { if (e.key !== "ArrowUp" && e.key !== "ArrowDown") return; const el = document.querySelector(".mmd-menu"); if (el) e.preventDefault(); }); } }; ctxScript.onerror = () => { console.error("[Mathpix] Failed to load context-menu script:", ctxScript.src); }; document.head.appendChild(ctxScript); })();
2015

Related Posts