Observations concerning some approximation methods for the solutions of operator equations

9 years ago

Ion Păvăloiu

(original), html, Numerical Analysis, paper, PDF, works

Abstract

(soon)

Authors

Ion Păvăloiu
(Tiberiu Popoviciu Institute of Numerical Analysis)

Keywords

PDF

Scanned paper.

PDF-LaTeX version of the paper.

Cite this paper as:

I. Păvăloiu, Observations concerning some approximation methods for the solutions of operator equations, Rev. Anal. Numér. Théor. Approx., 23 (1994) no. 2, pp. 185-195.

About this paper

Print ISSN

1222-9024

Online ISSN

2457-8126

Google Scholar Profile

References

[1] Argyros, K.I., Concerning the Convergence of Newton’s Method, The Renjab University Journal of Mathematics, Vol. XXI (1988), pp.1-11.

[2] Argyros, K.I, The Secant Method and Fixed Points of Nonlinear Operrators, Mh. Math., 106 (1988) pp. 85-94.

[3] Denis, J. E., Toward a Unified Convergence Theory for Newtonlike Methods, Nonlinear Functional Analysis and Applications. (Ed. by L. B. Rall). John Wiley, New York (1986).

[4] Lazăr, I., On Newton’s Method for Solving Operator Equations with Hölder Continuous Derivative. Revue d’analyse Numérique et de Théorie de l’Approximation. Tome 23. Nr.2 (1993).

[5] Ortega, J. M. and Rheinboldt, W., Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York and London, 1970.

[6] Păvăloiu, I., Remarks on the secant method for the solution of nonlinear operational equations. Research Seminars, Seminar on Mathematical analysis. Preprint nr.7 (1991) pp.127-132.

[7] Păvăloiu, I., On the Convergence of a Steffensen-Type Method., Research Seminars. Seminar of Mathematical Analysis. Preprint nr.7 (1991), pp.121-126.

[8] Păvăloiu, I., Introduction in the theory of approximation of equations solutions. Dacia Ed., Cluj-Napoca, (1976) (in Romanian).

[9] Păvăloiu, I., Sur une généralisation de la méthode de Steffensen, Revue d’analyse numérique et de théorie de l’approximation. Tome 21, Nr.1, (1992), pp.59-65.

[10] Schmidt, J. W. Konvergenzgesch windigkert der Regula falsi und der Steffensen Verfahrens in Banachraum. Z.A.M.M. 46, 2, (1996) pp. 146-148.

[11] U’lm, S., Ob. obobschennyh razdelennih raznostiakh I., Izv. Acad. Nauk Estonskoi SSR, 16 (1967), 13-36.

[12] U’lm, S., Ob. obobschennyh razdelennih raznostiakh II., Izv. Acad. Nauk Estonskoi SSR, 16 (1967), 146-155.

[13] U’lm, S., Ob. obobschenie metoda Steffensena dlea reshenia nelineingh-operatornih urovnenii. Jurnal vicisl. mat. i mat.-fiz. 4, 6, (1969

Paper (preprint) in HTML form

/*====================================================================== Core CSS for LaTeXML documents converted to (X)HTML */ /* Generic Page layout */ .ltx_page_header, .ltx_page_footer { font-size:0.8em; } .ltx_page_header *[rel~="prev"], .ltx_page_footer *[rel~="prev"] { float:left; } .ltx_page_header *[rel~="up"], .ltx_page_footer *[rel~="up"] { display:block; text-align:center; } .ltx_page_header *[rel~="next"], .ltx_page_footer *[rel~="next"] { float:right; } /* What was I trying for here; need more selective rule! .ltx_page_header .ltx_ref, .ltx_page_footer .ltx_ref { margin:0 1em; } */ .ltx_page_header li { padding:0.1em 0.2em 0.1em 1em;} /* Main content */ .ltx_page_content { clear:both; } .ltx_page_header { border-bottom:1px solid; margin-bottom:5px; } .ltx_page_footer { clear:both; border-top:1px solid; margin-top:5px; } .ltx_page_header:after, .ltx_page_footer:after, .ltx_page_content:after { content:"."; display:block; height:0; clear:both; visibility:hidden; } .ltx_page_footer:before { content:"."; display:block; height:0; clear:both; visibility:hidden; } .ltx_page_logo { font-size:80%; margin-top: 5px; clear:both; float:right; } .ltx_page_logo a { font-variant: small-caps; } .ltx_page_logo img { vertical-align:-3px; } /* if shown */ .ltx_page_navbar li { white-space:nowrap; display:block; overflow:hidden; } /* If ref got turned into span, it's "this section"*/ .ltx_page_navbar li span.ltx_ref { white-space:normal; overflow:visible; } /* Ought to be easily removable/overridable? */ .ltx_pagination.ltx_role_newpage { height:2em; } /*====================================================================== Document Structure; Titles & Frontmatter */ /* undo bold here to remove the browser's native h# styling, at let all other styles override it (with more specific rules)*/ .ltx_title { font-size:100%; font-weight:normal; } /* Hack to simulate run-in! put class="ltx_runin" on a title or tag for it to run-into the following text. */ .ltx_runin { display:inline; } .ltx_runin:after { content:" "; } .ltx_runin + .ltx_para, .ltx_runin + .ltx_para p, .ltx_runin + p { display:inline; } .ltx_outdent { margin-left: -2em; } /* .ltx_chapter_title, etc should be in ltx-article.css etc. */ .ltx_page_main { margin:0px; padding:1em 3em 1em 2em; } .ltx_tocentry { list-style-type:none; } /* support for common author block layouts.*/ /* add class ltx_authors_1line to get authors in single line with pop-up affiliation, etc. */ .ltx_authors_1line .ltx_creator, .ltx_authors_1line .ltx_author_before, .ltx_authors_1line .ltx_author_after { display:inline;} .ltx_authors_1line .ltx_author_notes { display:inline-block; } .ltx_authors_1line .ltx_author_notes:before { content:"*"; color:blue;} .ltx_authors_1line .ltx_author_notes span { display:none; } .ltx_authors_1line .ltx_author_notes:hover span { display:block; position:absolute; z-index:10; background:white; text-align:left; border: 1px solid black; border-radius: 0 5px 5px 5px; box-shadow: 5px 5px 10px gray; } /* add class=ltx_authors_multiline to get authors & affliations on separate lines*/ .ltx_authors_multiline .ltx_creator, .ltx_authors_multiline .ltx_author_before, .ltx_authors_multiline .ltx_author_after, .ltx_authors_multiline .ltx_author_notes, .ltx_authors_multiline .ltx_author_notes .ltx_contact { display:block; } /*====================================================================== Para level */ .ltx_float { margin: 1ex 3em 1ex 3em; } td.ltx_subfigure, td.ltx_subtable, td.ltx_subfloat { width:50%; } /* theorems, figure, tables, floats captions.. */ /*====================================================================== Blocks, Lists, Floats */ .ltx_p, .ltx_quote, .ltx_block, .ltx_para { display: block; } /* alignment within blocks */ .ltx_align_left { text-align:left; } .ltx_align_right { text-align:right; } .ltx_align_center { text-align:center; } .ltx_align_justify { text-align:justify; } .ltx_align_top { vertical-align:top; } .ltx_align_bottom { vertical-align:bottom; } .ltx_align_middle { vertical-align:middle; } .ltx_align_baseline { vertical-align:baseline; } .ltx_align_floatleft { float:left; } .ltx_align_floatright { float:right; } .ltx_td.ltx_align_left, .ltx_th.ltx_align_left, .ltx_td.ltx_align_right, .ltx_th.ltx_align_right, .ltx_td.ltx_align_center, .ltx_th.ltx_align_center { white-space:nowrap; } .ltx_td.ltx_align_left.ltx_wrap, .ltx_th.ltx_align_left.ltx_wrap, .ltx_td.ltx_align_right.ltx_wrap, .ltx_th.ltx_align_right.ltx_wrap, .ltx_td.ltx_align_center.ltx_wrap, .ltx_th.ltx_align_center.ltx_wrap, .ltx_td.ltx_align_justify, .ltx_th.ltx_align_justify { white-space:normal; } .ltx_tabular .ltx_tabular { width:100%; } .ltx_inline-block { display:inline-block; } /* equations in non-aligned mode (not normally used) */ .ltx_eqn_div { display:block; width:95%; text-align:center; } /* equations in aligned mode (aligning tags, etc as well as equations) */ .ltx_eqn_table { display:table; width:100%; border-collapse:collapse; } .ltx_eqn_row { display:table-row; } .ltx_eqn_cell { display:table-cell; width:auto; } /* Padding between column pairs in ams align */ table.ltx_eqn_align tr.ltx_equation td.ltx_align_left + td.ltx_align_right, table.ltx_eqn_align tr.ltx_equation td.ltx_align_left + td.ltx_align_center, table.ltx_eqn_align tr.ltx_equation td.ltx_align_center + td.ltx_align_right, table.ltx_eqn_align tr.ltx_equation td.ltx_align_center + td.ltx_align_center { padding-left:3em; } table.ltx_eqn_eqnarray tr.ltx_eqn_lefteqn + tr td.ltx_align_right { min-width:2em; } .ltx_eqn_eqno { max-width:0em; overflow:visible; white-space: nowrap; } .ltx_eqn_eqno.ltx_align_right .ltx_tag { float:right; } .ltx_eqn_center_padleft, .ltx_eqn_center_padright { width:50%; min-width:2em;} .ltx_eqn_left_padleft, .ltx_eqn_right_padright { min-width:2em; } .ltx_eqn_left_padright, .ltx_eqn_right_padleft { width:100%; } /* Various lists */ .ltx_itemize, .ltx_enumerate, .ltx_description { display:block; } .ltx_itemize .ltx_item, .ltx_enumerate .ltx_item { display: list-item; } /* Position the tag to look like a normal item bullet. */ li.ltx_item > .ltx_tag { display:inline-block; margin-left:-1.5em; min-width:1.5em; text-align:right; } .ltx_item .ltx_tag + .ltx_para, .ltx_item .ltx_tag + .ltx_para .ltx_p { display:inline; } /* NOTE: Need to try harder to get runin appearance? */ dl.ltx_description dt { margin-right:0.5em; float:left; font-weight:bold; font-size:95%; } dl.ltx_description dd { margin-left:5em; } dl.ltx_description dl.ltx_description dd { margin-left:3em; } /* Theorems */ .ltx_theorem {margin:1em 0em 1em 0em; } .ltx_title_theorem { font-size:100%; } /* Bibliographies */ .ltx_bibliography dt { margin-right:0.5em; float:left; } .ltx_bibliography dd { margin-left:3em; } /*.ltx_biblist { list-style-type:none; }*/ .ltx_bibitem { list-style-type:none; } .ltx_bibitem .ltx_tag { font-weight:bold; margin-left:-2em; width:3em; } /*.bibitem-tag + div { display:inline; }*/ .ltx_bib_title { font-style:italic; } .ltx_bib_article .bib-title { font-style:normal !important; } .ltx_bib_journal { font-style:italic; } .ltx_bib_volume { font-weight:bold; } /* Indices */ .ltx_indexlist li { list-style-type:none; } .ltx_indexlist { margin-left:1em; padding-left:1em;} /* Listings */ .ltx_listing { display:block; margin: 1ex 3em 1ex 0em; overflow-x:auto; text-align: left; } .ltx_float .ltx_listing { margin: 0; } .ltx_listingline { white-space:nowrap; min-height:1em; } .ltx_lst_numbers_left .ltx_listingline .ltx_tag { background-color:transparent; margin-left:-3em; width:2.5em; position:absolute; text-align:right; } .ltx_lst_numbers_right .ltx_listingline .ltx_tag { background-color:transparent; width:2.5em; position:absolute; right:3em; text-align:right; } /* position:absolute; left:0em; max-width:0em; text-align:right; } */ .ltx_parbox {text-indent:0em; } /* NOTE that it is CRITICAL to put position:relative outside & absolute inside!! I wish I understood why! Outer box establishes resulting size, neutralizes any outer positioning, etc; inner establishes position of stuff to be rotated */ .ltx_transformed_outer { position:relative; bottom:0pt;left:0pt; overflow:visible; } .ltx_transformed_inner { display:block; position:absolute;bottom:0pt;left:0pt; } .ltx_transformed_inner > .ltx_p {text-indent:0em; margin:0; padding:0; } /* If simulating a table (html5), try to get rowspan to work...sorta? */ span.ltx_rowspan { position:absolute; top:0; bottom:0; } /* by default, p doesn't indent */ .ltx_p { text-indent:0em; white-space:normal; } /* explicit control of indentation (on ltx_para) */ .ltx_indent > .ltx_p:first-child { text-indent:2em!important; } .ltx_noindent > .ltx_p:first-child { text-indent:0em!important; } /*====================================================================== Columns */ .ltx_page_column1 { width:44%; float:left; } /* IE uses % of wrong container*/ .ltx_page_column2 { width:44%; float:right; } .ltx_page_columns > .ltx_page_column1 { width:48%; float:left; } .ltx_page_columns > .ltx_page_column2 { width:48%; float:right; } .ltx_page_columns:after { content:"."; display:block; height:0; clear:both; visibility:hidden; } /*====================================================================== Borders and such */ .ltx_tabular { display:inline-table; border-collapse:collapse; } .ltx_tabular.ltx_centering { display:table; } .ltx_thead, .ltx_tfoot, .ltx_tbody { display:table-row-group; } .ltx_tr { display:table-row; } .ltx_td, .ltx_th { display:table-cell; } .ltx_framed { border:1px solid black;} .ltx_tabular .ltx_td, .ltx_tabular .ltx_th { padding:0.1em 0.5em; } /* regular lines */ .ltx_border_t { border-top:1px solid black; } .ltx_border_r { border-right:1px solid black; } .ltx_border_b { border-bottom:1px solid black; } .ltx_border_l { border-left:1px solid black; } /* double lines */ .ltx_border_tt { border-top:3px double black; } .ltx_border_rr { border-right:3px double black; } .ltx_border_bb { border-bottom:3px double black; } .ltx_border_ll { border-left:3px double black; } /* Light lines */ .ltx_border_T { border-top:1px solid gray; } .ltx_border_R { border-right:1px solid gray; } .ltx_border_B { border-bottom:1px solid gray; } .ltx_border_L { border-left:1px solid gray; } /* Framing */ .ltx_framed_rectangle { border-style:solid; border-width:1px; } .ltx_framed_top { border-top-style:solid; border-top-width:1px; } .ltx_framed_left { border-left-style:solid; border-left-width:1px; } .ltx_framed_right { border-right-style:solid; border-right-width:1px; } .ltx_framed_bottom, .ltx_framed_underline { border-bottom-style:solid; border-bottom-width:1px; } .ltx_framed_topbottom { border-top-style:solid; border-top-width:1px; border-bottom-style:solid; border-bottom-width:1px; } .ltx_framed_leftright { border-left-style:solid; border-left-width:1px; border-right-style:solid; border-right-width:1px; } /*====================================================================== Misc */ /* .ltx_verbatim*/ .ltx_verbatim { text-align:left; } /*====================================================================== Meta stuff, footnotes */ .ltx_note_content { display:none; } /*right:5%; */ .ltx_note_content { max-width: 70%; font-size:90%; left:15%; text-align:left; background-color: white; padding: 0.5em 1em 0.5em 1.5em; border: 1px solid black; border-radius: 0 5px 5px 5px; box-shadow: 5px 5px 10px gray; } .ltx_note_mark { color:blue; } .ltx_note_type { font-weight: bold; } .ltx_note { display:inline-block; text-indent:0; } /* So we establish containing block */ .ltx_note_content .ltx_note_mark { position:absolute; left:0.2em; top:-0.1em; } .ltx_note:hover .ltx_note_content, .ltx_note .ltx_note_content:hover { display:block; position:absolute; z-index:10; } .ltx_ERROR { color:red; } .ltx_rdf { display:none; } .ltx_missing { color:red;} .ltx_nounicode { color:red; } /*====================================================================== SVG (pgf/tikz ?) basics */ /* Stuff appearing in svg:foreignObject */ .ltx_svg_fog foreignObject { margin:0; padding:0; overflow:visible; } .ltx_svg_fog foreignObject > p { margin:0; padding:0; display:block; } /*.ltx_svg_fog foreignObject > p { margin:0; padding:0; display:block; white-space:nowrap; }*/ /*====================================================================== Low-level Basics */ /* Note that LaTeX(ML)'s font model doesn't map quite exactly to CSS's */ /* Font Families => font-family */ .ltx_font_serif { font-family: serif; } .ltx_font_sansserif { font-family: sans-serif; } .ltx_font_typewriter { font-family: monospace; } /* dingbats should be converted to unicode? */ /* Math font families handled within math: script, symbol, fraktur, blackboard ? */ /* Font Series => font-weight */ .ltx_font_bold { font-weight: bold; } .ltx_font_medium { font-weight: normal; } /* Font Shapes => font-style or font-variant */ .ltx_font_italic { font-style: italic; font-variant:normal; } .ltx_font_upright { font-style: normal; font-variant:normal; } .ltx_font_slanted { font-style: oblique; font-variant:normal; } .ltx_font_smallcaps { font-variant: small-caps; font-style:normal; } .ltx_font_oldstyle { font-variant: oldstyle-nums; /* experimental css3 ? Doesn't seem to work!*/ font-style:normal; -moz-font-feature-settings: "onum"; -ms-font-feature-settings: "onum"; -webkit-font-feature-settings: "onum"; font-variant-numeric: oldstyle-nums; } .ltx_font_mathcaligraphic { font-family: "Lucida Calligraphy", "Zapf Chancery","URW Chancery L"; } /* .ltx_font_mathscript { ? } */ cite { font-style: normal; } .ltx_red { color:red; } /*.ltx_centering { text-align:center; margin:auto; }*/ /*.ltx_inline-block.ltx_centering,*/ /* Hmm.... is this right in general? */ .ltx_centering { display:block; margin:auto; text-align:center; } /* Dubious stuff */ .ltx_hflipped { display:inline-block; -moz-transform: scaleX(-1); -o-transform: scaleX(-1); -webkit-transform: scaleX(-1); transform: scaleX(-1); filter: FlipH; -ms-fliter: "FlipH"; } .ltx_vflipped { display:inline-block; -moz-transform: scaleY(-1); -o-transform: scaleY(-1); -webkit-transform: scaleY(-1); transform: scaleY(-1); filter: FlipV; -ms-fliter: "FlipV"; } /* .ltx_phantom handled in xslt */ /* A somewhat amsart-like style */ .ltx_title_document { text-transform:uppercase; font-size: 150%; text-align:center; } .ltx_title_section { font-family:serif; font-weight:normal; font-variant:small-caps; font-size: 120%; text-align:center; } .ltx_authors { text-align:center; } .ltx_author_before,.ltx_author_after, .ltx_role_author .ltx_personname { text-transform:uppercase; } .ltx_abstract { margin-bottom:1em; } .ltx_title_abstract { font-family:serif; font-weight:normal; font-variant:small-caps;} .ltx_title_keywords, .ltx_title_classification { display:inline; font-size:100%; font-weight:normal; font-style:italic; } .ltx_role_dedicatory { font-size:100%; font-style:italic; text-align:center; margin:1em;} .ltx_figure .ltx_tag, .ltx_table .ltx_tag { font-family:serif; font-variant:small-caps;} .ltx_title_subsection, .ltx_title_subsubsection { font-family:serif; font-weight:bold;} .ltx_title_subsection:after, .ltx_title_subsubsection:after, .ltx_title_paragraph:after { content:"."; } /* abstract, subsection, subsubsection and paragraph titles are runin */ .ltx_abstract .ltx_title, .ltx_abstract .ltx_title + .ltx_p { display:inline; } .ltx_subsection .ltx_title, .ltx_subsection .ltx_title + .ltx_para, .ltx_subsection .ltx_title + .ltx_para > .ltx_p { display:inline; } .ltx_subsubsection .ltx_title, .ltx_subsubsection .ltx_title + .ltx_para, .ltx_subsubsection .ltx_title + .ltx_para > .ltx_p { display:inline; } .ltx_paragraph .ltx_title, .ltx_paragraph .ltx_title + .ltx_para, .ltx_paragraph .ltx_title + .ltx_para > .ltx_p { display:inline; } .ltx_title +.ltx_para > .ltx_p {text-indent:2em; } .ltx_itemize, .ltx_enumerate, .ltx_description { margin-left: clamp(1em, 3%, 2em); } .ltx_title_document { font-size:170%; text-align:center; margin:0.5em 0 0.5em 0; } .ltx_authors, .ltx_role_author { text-align:center; margin:0.5em 0 0.5em 0; } .ltx_role_author .ltx_personname { font-size: 120%; } .ltx_date { text-align:center; font-size: 120%; margin:0.5em 0 0.5em 0; } .ltx_subtitle { text-align:center; font-size: 120%; padding-left:0.2em; margin-left:-0.5em; } .ltx_title_abstract { text-align:center; font-size: 100%; font-weight:bold; } .ltx_abstract { margin-left:4em; margin-right:4em; } .ltx_title_acknowledgements, .ltx_title_keywords, .ltx_title_classification { text-align:left; font-size: 100%; font-weight:bold; margin:0.5 0 0 0; } .ltx_appendix, .ltx_section, .ltx_subsection, .ltx_subsubsection { margin-top:1.5em; } .ltx_paragraph, .ltx_subparagraph { margin-top:1.0em; } .ltx_title_appendix, .ltx_title_section, .ltx_title_bibliography { font-size:140%; font-weight:bold; margin-bottom:1em; } .ltx_title_subsection { font-size:120%; font-weight:bold; margin-bottom:1em; } .ltx_title_subsubsection { font-size:100%; font-weight:bold; margin-bottom:1em; } /* Paragraph & Subparagraph titles should be runin! */ .ltx_title_paragraph { font-size:100%; font-weight:bold; display:inline; margin-right:1em; } .ltx_paragraph .ltx_title, .ltx_paragraph .ltx_title + .ltx_para, .ltx_paragraph .ltx_title + .ltx_para > .ltx_p { display:inline; } .ltx_title_subparagraph { font-size:100%; font-weight:bold; display:inline; margin-left:2em; margin-right:1em; } .ltx_subparagraph .ltx_title, .ltx_subparagraph .ltx_title + .ltx_para, .ltx_subparagraph .ltx_title + .ltx_para > .ltx_p { display:inline; } .ltx_figure { text-align:center; margin:auto; margin:0.5em; } .ltx_table { text-align:center; margin:auto; margin:0.5em; } /* experimental: flex model, to center short captions, justify long ones */ .ltx_table, .ltx_figure { display:flex; flex-direction:column; align-items:center; } .ltx_table .ltx_caption, .ltx_figure .ltx_caption { text-align:justify; } /* first p in para gets indented */ .ltx_para > .ltx_p:first-child { text-indent:2em; } /* except the initial in a section */ section > .ltx_title +.ltx_para > .ltx_p, section > .ltx_title +.ltx_date +.ltx_para > .ltx_p {text-indent:0em; } .ltx_title_abstract + .ltx_p {text-indent:2em; } .ltx_itemize, .ltx_enumerate { margin-left:1em; } .ltx_theorem { margin-top:0.5em; margin-bottom:0.5em; } .ltx_theorem .ltx_title { margin-bottom:0.1em; } .ltx_theorem .ltx_title + .ltx_para, .ltx_theorem .ltx_title + .ltx_para .ltx_p, .ltx_theorem .ltx_title + .ltx_p { margin-top:0em; } Observations Concerning Some Approximation Methods for the Solutions of Operator Equations

Observations Concerning Some Approximation Methods for the Solutions of Operator Equations

Ion Păvăloiu
(Cluj-Napoca)

1. Introduction

The purpose of this paper is to give some completions to some results, recently appeared in the literature, concerning the convergence and the error bounds of some methods for solving operatorial equations, when the Fréchet derivatives or the divided differences of the operators are Hölder continuous.

Let $f : X \to Y$ be an application, where $X$ and $Y$ are Banach spaces. We shall define the divided difference of a certain order in the following way: let $u_{i} \in X i = 1, n + 1,$ where $u_{i} \neq u_{j}$ for $i \neq j$ .

Definition 1.1.

[8]. The divided difference of the first order of the application $f$ at $u_{k}, u_{s} \in X$ is an application $[u_{k}, u_{s}; f] \in ℒ (X, Y)$ which verifies:

a)

$[u_{k}, u_{s}; f] (u_{s} - u_{k}) = f (u_{s}) - f (u_{k})$
b)

if $f$ is Fréchet differentiable, at $u_{s}$ , then

$[u_{s}, u_{s}; f] = f^{'} (u_{s}) .$

We suppose that there have been defined the applications

[u_{k}, u_{k + 1}, \dots, u_{k + m - 1}; f] \in ℒ (X^{m - 1}, Y) and

[u_{k + 1}, u_{k + 2}, \dots, u_{k + m}; f] \in ℒ (X^{m - 1}, Y),

called the divided differences of the order $m - 1$ , where $k + m \leq n$ .

Definition 1.2.

[8]. The divided difference of the order $m$ of the application $f$ in $u_{k}, u_{k + 1}, \dots, u_{k + m} \in X$ , is an application

[u_{k}, u_{k + 1}, \dots u_{k + m}; f] \in ℒ (X^{m}, Y)

which verifies:

(a’)		$[u_{k}, u_{k + 1}, \dots, u_{k + m}; f] (u_{k + m} - u_{k}) =$	$[u_{k + 1}, u_{k + 2}, \dots, u_{k + m}; f]$
		$- [u_{k}, u_{k + 1}, \dots, u_{k + m - 1}; f]$

b’)

if $f$ is $m$ time Fréchet differentiable at $u_{k},$ then

$[u_{k}, u_{k}, \dots, u_{k}; f] = \frac{1}{m!} f^{(m)} (u_{k}) .$

2. Considerations on the Secant Method

For the approximation of the solution of the operator equation

(1)

f (x) = 0

consider the iteration

(2)

x_{n + 1}

= x_{n} - {[x_{n - 1}, x_{n}; f]}^{- 1} f (x_{n}), n = 1, 2, \dots, x_{0}, x_{1} \in X,

It is known that if $f$ satisfies certain conditions, then the sequence ${(x_{n})}_{n \geq 0}$ given by (2) is well defined (there exists ${[x_{n - 1}, x_{n}; f]}^{- 1}$ for $n = 1, 2, \dots$ ) and converges to a solution $x^{*}$ of equation (1) (see for example [2], [5], [8], [10].

In the following we shall give some specifications concerning the results obtained in [2]. Then we shall try to obtain conditions that ensure the convergence of the sequence ${(x_{n})}_{n \geq 0}$ to a solution of (1), and, moreover, we shall determine a subset $E \subset X$ that contains this solution.

In paper [2], where the results obtained in [3] are generalized, the convergence of process (2) is studied under the assumptions that $f$ is Fréchet differentiable on a set $D \subset X$ and the Fréchet derivative $f^{'} (\cdot)$ satisfies a Hölder type condition on $D :$ there exist $c \in ℝ$ , $c > 0$ and $p \in (0, 1]$ such that:

(3)

‖ f^{'} (x) - f^{'} (y) ‖ \leq c {‖ x - y ‖}^{p}, for every x, y \in D .

Let $H_{D} (c, p)$ denote the set of all applications $f^{'}$ for which (3) holds.

In [2], in addition to the conditions from Definition 1.1, it is assumed that the divided differences of the first order of $f$ satisfy a Hölder type condition, namely there exist $l_{1}, l_{2,} l_{3} \geq 0, p = (0, 1)$ such that for every $x, y, z \in D$ , the inequality:

(4)

‖ [x, y; f] - [y, z; f] ‖ \leq l_{1} {‖ x - z ‖}^{p} + l_{2} {‖ x - y ‖}^{p} + l_{3} {‖ y - z ‖}^{p}

holds.

This condition is useful when divided differences of the second order of $f$ are unbounded on $D$ .

Let $l_{2}^{'} = \max {l_{2}, l_{3}}$ . If $x^{*}$ is a simple zero of equation (1), then the application $f^{'} (x^{*}) \in ℒ (X, Y)$ has a bounded inverse.

From (4) and from the existence and boundness of ${[f^{'} (x^{*})]}^{- 1}$ there exists $ε > 0$ such that $[x, y; f]$ has a bounded inverse for every $x, y \in \bar{U} (x^{*}, ε),$ where $\bar{U} (x^{*}, ε) = {x \in X | ‖ x - x^{*} ‖ \leq ε}$ , namely the application $B (x, y) = {[x, y; f]}^{- 1}$ is uniformly bounded on $\bar{U} (x^{*}, ε)$ .

In [2] the following theorem was proved:

Theorem 2.1.

Let $D \subset X$ be an open set and $f : X \to Y$ . If:

i)

$x^{*} \in D$ is a simple solution of equation (1).
ii)

there exists $ε > 0$ and $b > 0$ such that:

$‖ {[x, y; f]}^{- 1} ‖ \leq b, for every x, y \in \bar{U} (x^{*}, ε);$
iii)

there exists a convex set $D_{0}$ and a real number $ε_{1}$ , $0 < ε_{1} < ε$ , such that:

$f^{'} (\cdot) \in H_{r_{0}} (c, p), for
every x \in D_{0} and U (x^{*}, ε_{1}) \subset D_{0};$
iv)

$x_{0}, x_{1} \in \bar{U} (x^{*}, r)$ , where $0 < r < \min {ε_{1}, {[q (p)]}^{- \frac{1}{p}}}$

and

(5) $q (p) = \frac{b}{1 - p} [2^{p} (l_{1} + l_{2}^{'}) (1 + p) + c],$

then the sequence given by (2) is well defined, and its elements belong to $\bar{U} (x^{*}, r)$ . The sequence converges to the unique solution $x^{*}$ of (1). Moreover, the following estimation holds

(6)

‖ x_{n + 1} - x^{*} ‖ \leq γ_{1} {‖ x_{n - 1} - x^{*} ‖}^{p} \cdot ‖ x_{n} - x^{*} ‖ + γ_{2} {‖ x_{n} - x^{*} ‖}^{1 + p}

for $n$ large enough where $γ_{1}$ and $γ_{2}$ are given by

(7)

γ_{1} = b (l_{1} + l_{2}^{'}) 2^{p}

(8)

γ_{2} = \frac{b c}{1 + p}

The proof is based on the following two lemmas [2]

Lemma 2.1.

Let $f : X \to Y$ and $D \subset X$ be an open set. If $f$ is Fréchet differentiable on $D$ and there exists a convex set $D_{0} \subset D$ such that $f^{'} (\cdot) \in H_{D_{0}} (c, p)$ , then for any $x, y \in D_{0}$ the following inequality holds:

(9)

‖ f (x) - f (y) - f^{'} (x) (x - y) ‖ \leq \frac{c}{1 + p} {‖ x - y ‖}^{p + 1} .

Lemma 2.2.

If there exists divided differences $[x, y; f]$ and inequality (4) is verified for all $x, y, z \in D_{0}$ , then the equality b) from Definition 1.1 holds for every $x \in D_{0}$ and the derivative $f^{'}$ of $f$ verifies the relation $f^{'} (\cdot) \in H_{D_{0}} [2 (l_{1} + l_{2}), p]$ .

In the proof of Theorem 2.1 the following inequality is obtained first

(10)

‖ x_{n + 1} - x^{*} ‖ \leq {[M (r)]}^{n + 1} ‖ x_{0} - x^{*} ‖, where 0 < M (r) < 1 .

from which it follows that the sequence ${(x_{n})}_{n \geq 0}$ is convergent. In the following, by use of inequality (6) obtained in [2], we shall prove that the order of convergence of the sequence given by (2) is $t_{1} = \frac{1 + {(1 + 4 p)}^{1 / 2}}{2},$ i.e. it is the positive root of the equation:

(11)

t^{2} - t - p = 0 .

For this, besides the hypothesis of Theorem 2.1 we shall suppose that $x_{0}$ and $x_{1}$ verify

a’)

$‖ x^{*} - x_{0} ‖ \leq α d_{0};$
b’)

$‖ x^{*} - x_{1} ‖ \leq \min {α d_{0}^{t_{1}}, ‖ x^{*} - x_{0} ‖},$

where $0 < d_{0} < 1$ and $α = {[q (p)]}^{- \frac{1}{p}}$ .

Using Lemmas 2.1 and 2.2 and hypotheses of Theorem 2.1, from (2) we obtain

(12)

‖ x_{2} - x^{*} ‖ \leq γ_{1} {‖ x_{0} - x^{*} ‖}^{p} ‖ x_{1} - x^{*} ‖ + γ_{2} {‖ x_{1} - x^{*} ‖}^{p + 1}

from which, taking into account a’), b’) it follows

‖ x_{2} - x^{*} ‖ \leq α d_{0}^{t_{1}^{2}} (γ_{1} + γ_{2} d_{0}^{p (t_{1} - 1)}) α^{p},

where

(γ_{1} + γ_{2} d_{0}^{p (t_{1} - 1)}) α^{p} = \frac{γ_{1} + γ_{2} d_{0}^{p (t_{1} - 1)}}{γ_{1} + γ_{2}} < 1

that is,

(13)

‖ x_{2} - x^{*} ‖ \leq d_{0}^{t_{1}^{2}}

Relations (12) and (13) imply $‖ x_{2} - x^{*} ‖ < ‖ x_{1} - x^{*} ‖$ .

Suppose that there exists $n \in N, n \geq 2$ , such that

(a”)		$‖ x_{n - 1} - x^{*} ‖$	$\leq α d_{0}^{t_{1}^{n - 1}}$
(b”)		$‖ x_{n} - x^{*} ‖$	$\leq \min {α d_{0}^{t_{1}^{n}}, ‖ x_{n - 1} - x^{*} ‖} .$

If we repeat the above reasoning and take into account (a”) and (b”) we obtain

‖ x_{n + 1} - x^{*} ‖ \leq α^{1 + p} \cdot d_{0}^{t_{1}^{n + 1}} (γ_{1} + γ_{2} d_{0}^{p^{t_{1}^{n} (t_{1} - 1)}}) \leq α d_{0}^{t_{1}^{n + 1}},

because

α^{p} (γ_{1} + γ_{2} d_{0}^{p^{t_{1}^{n} (t_{1} - 1)}}) < 1 .

Moreover, it can be easily seen that

‖ x_{n + 1} - x^{*} ‖ < ‖ x_{n} - x^{*} ‖ .

So far, we have proved the following theorem.

Theorem 2.2.

Under the hypotheses of Theorem 2.1 and if $x_{0}$ and $x_{1}$ verify a’) and b’), where $α = {(q (p))}^{- \frac{1}{p}}$ and $0 < d_{0} < 1$ , then for every $n \in ℕ$ , $x_{n} \in U (x^{*}, α)$ and

(2.13’)

‖ x_{n + 1} - x^{*} ‖ \leq d_{0}^{t_{1}^{n + 1}}, n = 0, 1, \dots

One must notice that inequality (2.13’) gives a sharper error bound than (10).

In the following we shall establish a result which ensures not only the convergence of the sequences ${(x_{n})}_{n \geq 0}$ but also the existence of the solution of equation (1) in a determined subset of $X$ .

In this respect, we observe that if ${[x_{n - 1}, x_{n}; f]}^{- 1}$ exists for every $n = 1, 2, \dots$ then:

(14)

x_{n} - {[x_{n - 1}, x_{n}; f]}^{- 1} f (x_{n}) = x_{n - 1} - {[x_{n - 1}, x_{n}; f]}^{- 1} f (x_{n - 1})

and

(15)		$f (x_{n + 1}) =$	$f (x_{n}) + [x_{n - 1}, x_{n}; f] (x_{n + 1} - x_{n}) +$
		$+ ([x_{n}, x_{n + 1}; f] - [x_{n - 1}, x_{n}; f]) (x_{n + 1} - x_{n}), n = 1, 2, \dots$

hold.

Let $α, B, d_{0} \in ℝ$ , $α > 0, B > 0, d_{0} \in (0, 1)$ and

S = {x \in X : ‖ x - x_{0} ‖ \leq \frac{B α d_{0}}{1 - d_{0}^{t_{1} - 1}}},

where $t_{1}$ is the positive root of equation (11).

Theorem 2.3.

If the divided differences of the first order of the applicaiton $f$ verify condition (4) for every $x, y, z \in S$ and

i)

for every $x, y \in S, {[x, y; f]}^{- 1}$ exists and $‖ {[x, y, f]}^{- 1} ‖ \leq B$
ii)

the initial data $x_{0}, x_{1} \in X$ and $f$ verify the inequalities

(16) $‖ x_{1} - x_{0} ‖$ $< B α d_{0}, ‖ f (x_{0}) ‖ \leq α d_{0} and ‖ f (x_{1}) ‖ \leq α d_{0}^{t_{1}}$

where

(17) $α = \frac{1}{B^{\frac{1 + p}{p}} {(l_{1} + l_{2} + l_{3})}^{\frac{1}{p}}}$

the equation (1) has at least one solution $x^{*} \in S$ which is the limit of the sequence ${(x_{n})}_{n \geq 0}$ given by (2) the order of the convergence of this sequence and the error bound are given by

(18) $‖ x^{*} - x_{n} ‖ \leq \frac{B α d_{0}^{t_{1}^{n}}}{1 - d_{0}^{t_{1}^{n} (t_{1} - 1)}}, n = 1, 2, \dots$

Proof.

From (2), for $n = 2$ we have

‖ x_{2} - x_{1} ‖ \leq B ‖ f (x_{1}) ‖ \leq B α d_{0}^{t_{1}}

This inequality, together with the first inequality from (16), implies.

‖ x_{2} - x_{0} ‖

\leq ‖ x_{2} - x_{1} ‖ + ‖ x_{1} - x_{0} ‖ \leq B α d_{0} (1 + d_{0}^{t_{1} - 1}) \leq \frac{B α d_{0}}{1 - d_{0}^{t_{1} - 1}},

and so $x_{2} \in S$ .

Because $x_{2} \in S,$ from (14), (15) and using (4) we obtain:

(19)

‖ f (x_{2}) ‖ \leq B^{p + 1} α^{p + 1} (l_{1} + l_{2} + l_{3} d_{0}^{t_{1}^{2} - p}) d_{0}^{t_{1}^{2} - p} \leq α d_{0}^{t_{1}^{2}},

since

α^{p} B^{p + 1} (l_{1} + l_{2} + l_{3} d_{0}^{p (t_{1} - 1)}) \leq α^{p} B^{p + 1} (l_{1} +_{2} + l_{3}) \leq 1 .

Suppose

(20)		$x_{i}$	$\in S;$
(21)		$‖ f (x_{i}) ‖$	$\leq α d_{0}^{t_{1}^{i}}, hold for i = \bar{1, k .}$

Then

	$‖ x_{n + 1} - x_{k} ‖$	$\leq B α d_{0} (1 + d_{0}^{t_{1} - 1} + d_{0}^{t_{1}^{2} - 1} + \dots + d_{0}^{t_{1}^{k} - 1})$
		$\leq B α d_{0} (1 + d_{0}^{(t_{1} - 1)} + d_{0}^{2 (t_{1} - 1)} + \dots + d_{0}^{k (t_{1} - 1)}) \leq \frac{B α d_{0}}{1 - d_{0}^{t_{1} - 1}},$

that is, $x_{k + 1} \in S$ .

By the use of the same reasoning as for (19) we obtain

(22)

‖ f (x_{k + 1}) ‖ \leq B^{p + 1} α^{p + 1} (l_{1} + l_{2} + l_{3}^{p t_{1}^{k - 1} (t_{1} - 1)}) d_{0}^{t_{1}^{k - 1} (t_{1} + p)} \leq α_{0} d_{0}^{t_{1}^{k + 1}} .

The above relations imply that (20) and (21) hold for every $k \in ℕ$ .

Now notice that ${(x_{n})}_{n \geq 0}$ is a Cauchy sequence, because

(23)

‖ x_{n + s} - x_{n} ‖ \leq \sum_{k = n}^{n + s - 1} ‖ x_{k + 1} - x_{k} ‖ \leq B α \sum_{k = n}^{n + s - 1} d_{0}^{t_{1}^{k}} \leq \frac{B α d_{0}^{t_{1}^{n}}}{1 - d_{0}^{t_{1}^{n} (t_{1} - 1)}},

for any $n, s \in ℕ$ , $t_{1} > 1$ and $d_{0} \in (0, 1)$ .

Let $x^{*} = lim_{n \to \infty} x_{n}$ . Then, taking $s \to \infty$ in (23) we obtain

(24)

‖ x^{*} - x_{n} ‖ \leq \frac{B α d_{0}^{t_{1}^{n}}}{1 - d_{0}^{t_{1}^{n} (t_{1} - 1)}},

$n = 0, 1, \dots,$ that is, the inequality (18).

For $n = 0$ we obtain $x^{*} \in S$ .

If $k \to \infty$ in (22) then $‖ f (x^{*}) ‖ = 0,$ that is $x^{*}$ , is the solution of equation (1). ∎

3. Considerations on Steffensen Method

It is well known that the order of convergence of the secant method can be improved if the elements $x_{n - 1}$ and $x_{n}$ form (2) are related by an application $g : X \to X$ , described in the following.

Consider the sequence $(x_{n}) n \geq 0$ generated by

(25)

x_{n + 1} - x_{n} - {[x_{n}, g (x_{n}); f]}^{- 1} f (x_{n}), x_{0} \in X,

where $g$ is an operator whose fixed points coincide with solutions of equations (1).

Consider $x_{0} \in X$ , the nonnegative real numbers $B, ε_{0}, ρ_{0}, α,$ $β$ and $q \geq 1$ , where

(26)

ρ_{0} = B α (l_{1} B^{p} + l_{2} β^{p} + l_{3} B^{p} \cdot α^{p}) {‖ f (x_{0}) ‖}^{p (q - 1)}

(27)

ε_{0} = ρ_{0} \frac{1}{(p + q - 1)} ‖ f (x_{0}) ‖,

the numbers $l_{1}, l_{2}, l_{3}$ being given by condition (4).

(28)

S = {x \in X : ‖ x - x_{0} ‖ \leq \frac{r ε_{0}}{ρ_{0}^{\frac{1}{p + q - 1}} (1 - ε_{0}^{p + q - 1})}},

where $r = \max {B, β}$

Concerning the convergence of method (25), the following theorem holds:

Theorem 3.1.

If the real numbers $B, ε_{0}, ρ_{0}, p_{0}, p, α, β, q, l_{1}, l_{2}, l_{3}$ the applications $f$ and $g$ , and the element $x_{0}$ satisfy the conditions:

(i)

for every $x, y \in S$ there exist ${[x, y; f]}^{- 1}$ and $‖ {[x, y; f]}^{- 1} ‖ \leq B$ ;
(ii)

for every $x \in S, ‖ f (g (x)) ‖ \leq α {‖ f (x) ‖}^{q}$ ;
(iii)

for every $x \in S,$ $‖ x - g (x) ‖ \leq β ‖ f (x) ‖$ ;
(iv)

the divided differences of the first order of the applications $f$ verify condition (4) for every $x, y, z \in S$ ;
(v)

$ε_{0} < 1$ ,

then the sequence $(x_{n}), n \geq 0$ given by (25) is convergent and if $x^{*} = lim x_{n}$ , then $f (x^{*}) = 0$ . Moreover, we have

(29)

‖ x^{*} - x_{n} ‖ \frac{r ε_{0}^{{(p + q)}^{n}}}{ρ_{0}^{\frac{1}{p + q - 1}} (1 - ε_{0}^{p + q - 1})} .

Proof.

Let $x_{0} \in X$ be such that $ε_{0}$ verifies condition $(v)$ . Using similar relations to (14) and (15) and condition (4), we obtain from (25)

‖ x_{1} - x_{0} ‖ \leq B \cdot ‖ f (x_{0}) ‖ \leq \frac{B ρ_{0}^{\frac{1}{p + q - 1}}}{ρ_{0}^{\frac{1}{p + q - 1}}} ‖ f (x_{0}) ‖ \leq \frac{r ε_{0}}{ρ_{0}^{\frac{1}{p + q - 1}} (1 - ε_{0}^{p + q - 1})},

which means that $x_{1} \in S$ .

In the above inequality we have admitted the relation $g (x_{0}) \in S,$ which is implied by $(i i i)$ .

From (14), (15), (25), $(i),$ $(i i)$ and $(i i i)$ we obtain:

	$‖ f (x_{1}) ‖$	$\leq ‖ [g (x_{0}), x_{1}; f] - [x_{0}, g (x_{0}); f] ‖ ‖ x_{1} - g (x_{0}) ‖$
		$\leq B α (l_{1} B^{p} + l_{2} β^{p} + l_{3} B^{p} α^{p} {‖ f (x_{0}) ‖}^{p (q - 1)}) {‖ f (x_{0}) ‖}^{p + q}$
		$= ρ_{0} {‖ f (x_{0}) ‖}^{p + q} .$

From the above inequality there follows

ρ_{0}^{\frac{1}{p + q - 1}} ‖ f (x_{1}) ‖ \leq {(ρ_{0}^{\frac{1}{p + q - 1}} ‖ f (x_{0}) ‖)}^{p + q}

and if $ε_{1} = ρ_{0}^{\frac{1}{p + q - 1}} ‖ f (x_{1}) ‖$ then,

ε_{1} \leq ε_{0}^{p + q} .

It can be easily seen that $‖ f (x_{1}) ‖ \leq ‖ f (x_{0}) ‖$ and $ρ_{1} \leq ρ_{0},$ where $ρ_{1} = B α [l_{1} B^{p} + l_{2} β^{p} + l_{3} B^{p} α^{p} {‖ f (x_{1}) ‖}^{p (q - 1)}]$ . Suppose now that, for $s = \bar{1, k,}$ the following relations hold $x_{s} \in S, ‖ f (x_{s}) ‖ \leq ‖ f (x_{s - 1}) ‖,$ $ε_{s} < ε_{0}^{{(p + q)}^{s}},$ where $ε_{s} = ρ^{\frac{1}{p + q - 1}} ‖ f (x_{s}) ‖$ .

Using these assumptions and proceeding as above we get

(30)

‖ x_{k + 1} - x_{k} ‖ \leq B ‖ f (x_{k}) ‖ \leq \frac{r ε_{0}^{{(p + q)}^{k}}}{ρ_{0}^{\frac{1}{p + q - 1}}}

(31)

‖ x_{n + 1} - x_{0} ‖ \leq \frac{r ε_{0}}{ρ_{0}^{\frac{1}{p + q - 1}} (1 - ε_{0}^{p + q - 1})},

showing that $x_{k + 1} \in S$ .

It is also easy to see that

(32)

‖ g (x_{k}) - x_{k} ‖ \leq \frac{r ε_{0}^{{(p + q)}^{k}}}{ρ_{0}^{\frac{1}{p + q - 1}}}

whence

(33)

‖ g (x_{k}) - x_{0} ‖ \leq \frac{r ε_{0}}{ρ_{0}^{\frac{1}{p + q - 1}} (1 - ε_{0}^{p + q - 1})},

that is, $g (x_{k}) \in S$ .

We obtain further

(34)

‖ f (x_{k + 1}) ‖ \leq ρ_{0} {‖ f (x_{k}) ‖}^{p + q},

whence

(35)

ε_{k + 1} \leq ε_{0}^{{(p + q)}^{k + 1}}, when ε_{k + 1} = ρ_{0}^{\frac{1}{p + q - 1}} ‖ f (x_{k + 1}) ‖ .

From (30) it follows that, for every $s, n \in ℕ$ ,

(36)

‖ x_{n + s} - x_{n} ‖ \leq \frac{B ε_{0}^{{(p + q)}^{n}}}{ρ_{0}^{\frac{1}{p + q - 1}} (1 - ε_{0}^{p + q - 1})}

and by $(v)$ the sequence ${(x_{n})}_{n \geq 0}$ is fundamental, hence convergent. If $x^{*} = lim_{n \to \infty} x_{n}$ , from (36), for $s \to \infty$ , we get (29) and from (35) it follows that $x^{*}$ is a solution of (1).

From (29), for $n = 0$ we have that $x^{*} \in S$ . ∎

4. Considerations Concerning Newton’s Method

Consider the sequence given by Newton’s method,

(37)

x_{n + 1} = x_{n} - {[f^{'} (x_{n})]}^{- 1} f (x_{n}), n = 0, 1, \dots, x_{0} \in X

let $S (x_{0}, r) = {x \in X | ‖ x - x_{0} ‖ \leq r}$ , where $r \in ℝ$ , $r > 0$ .

Concerning the convergence of this sequence we have the following theorem.

Theorem 4.1.

If the application $f$ is Fréchet differentiable on $S (x_{0}, r),$ the Fréchet derivative $f^{'}$ satisfies (3) for every $x, y \in S (x_{0}, r)$ and the following conditions hold:

(i)

${[f^{'} (x_{0})]}^{- 1}$ exists and $‖ {[f^{'} (x_{0})]}^{- 1} ‖ \leq d$ ;
(ii)

$c r^{p} d < 1$ ;
(iii)

$ρ_{0} = α^{\frac{1}{p}} ‖ f (x_{0}) ‖ < 1,$ where $α = \frac{c β^{1 + p}}{1 + p}$ and $β = \frac{d}{1 - c d r^{p}},$
(iv)

$\frac{β ‖ f (x_{0}) ‖}{1 - α {‖ f (x_{0}) ‖}^{p}} \leq r,$

then,

(j)

$x_{n} \in S (x_{0}, r), f o r$ every $n \in ℕ$ ,
(jj)

there exists $Γ_{n} = {[f^{'} (x_{n})]}^{- 1}$ for every n $\in ℕ$ and $‖ Γ_{n} ‖ < \frac{d}{1 - d c r^{p}},$
(jjj)

$‖ x_{n + 1} - x_{n} ‖ \leq β α^{- \frac{1}{p}} ρ_{0}^{{(1 + p)}^{n}}$ ;
(jv)

the sequence ${(x_{n})}_{n \geq 0}$ is convergent, and if $x^{*} = lim_{n \to \infty} x_{n}$ then $f (x^{*}) = 0$ and

(38) $‖ x^{*} - x_{n} ‖ \leq \frac{β α^{- \frac{1}{p}} ρ_{0}^{{(1 + p)}^{n}}}{1 - ρ_{0}^{{(1 + p)}^{n}}}, n \in ℕ .$

Proof.

By (37), for $n = 1$ we get $x_{1} = x_{0} - {[f^{'} (x_{0})]}^{- 1} f (x_{0})$ , and from $(i)$ $‖ x_{1} - x_{0} ‖ \leq d ‖ f (x_{0}) ‖ \leq β ‖ f (x_{0}) ‖ \leq r$ , that is, $x_{1} \in S (x_{0}, r)$ .

By (3) and $i i)$ it follows

‖ {[f^{'} (x_{0})]}^{- 1} [f^{'} (x_{0}) - f^{'} (x_{1})] ‖ \leq d c {‖ x_{1} - x_{0} ‖}^{p} \leq d c r^{p} < 1,

whence ${[f^{'} (x_{1})]}^{- 1}$ exists and

‖ {[f^{'} (x_{1})]}^{- 1} ‖ \leq \frac{d}{1 - d c r^{p}} = β .

From (3) it follows

	$‖ f (x_{1}) ‖$	$= ‖ f (x_{1}) - f (x_{0}) - f^{'} (x_{0}) (x_{1} - x_{0}) ‖$
		$\leq \frac{c}{p + 1} {‖ x_{1} - x_{0} ‖}^{p + 1} \leq \frac{c β^{p + 1}}{p + 1} {‖ f (x_{0}) ‖}^{p + 1}$

and if

ρ_{1} = α^{\frac{1}{p}} ‖ f (x_{1}) ‖

then

ρ_{1} \leq ρ_{0}^{1 + p}, ‖ x_{2} - x_{1} ‖ \leq β α^{- \frac{1}{p}} ρ_{0}^{1 + p} .

If $ρ_{i} = α^{\frac{1}{p}} ‖ f (x_{i}) ‖$ and

(a)	$x_{i}$	$\in S (x_{0}, r), i = \bar{1, k},$
(b)	$‖ x_{i + 1} - x_{i} ‖$	$\leq β α^{- \frac{1}{p}} ρ_{0}^{{(1 + p)}^{i}}, i = \bar{1, k - 1},$
(c)	$ρ_{i}$	$\leq ρ_{0}^{{(1 + p)}^{i}}, i = \bar{1, k,}$

then we get by $(a),$ (3) and $(i)$

‖ {[f^{'} (x_{0})]}^{- 1} [f^{'} (x_{k}) - f^{'} (x_{0})] ‖ \leq d c {‖ x_{k} - x_{0} ‖}^{p} \leq c d r^{p} < 1 .

It follows that

‖ {[f^{'} (x_{k})]}^{- 1} ‖ \leq \frac{d}{1 - d c r^{p}} = β .

From (37) and from the above inequality we get that:

‖ x_{k + 1} - x_{k} ‖ \leq β ‖ f (x_{k}) ‖ \leq β α^{- \frac{1}{p}} ρ_{k} \leq β α^{- \frac{1}{p}} ρ_{0}^{{(1 + p)}^{k}},

which by $(b)$ implies

‖ x_{k + 1} - x_{0} ‖ \leq \frac{β ‖ f (x_{0}) ‖}{1 - α {‖ f (x_{0}) ‖}^{p}} \leq r,

that is, $x_{k + 1} \in S (x_{0}, r)$ .

Using the assumptions of the theorem we get that

	$‖ f (x_{k + 1}) ‖$	$= ‖ f (x_{k + 1}) - f (x_{k}) - f^{'} (x_{k}) (x_{k + 1} - x_{k}) ‖$
		$\leq \frac{c}{p + 1} {‖ x_{k + 1} - x_{k} ‖}^{p + 1} \leq α^{- \frac{1}{p}} ρ_{k}^{p + 1},$

whence

ρ_{k + 1} \leq ρ_{0}^{{(1 + p)}^{k + 1}} .

For every $m, n \in ℕ$

‖ x_{m + n} - x_{n} ‖ \leq \frac{β α^{- \frac{1}{p}} ρ_{0}^{{(1 + p)}^{n}}}{1 - ρ_{0}^{p {(1 + p)}^{n}}}

which, together with $ρ_{0} < 1$ , show that ${(x_{n})}_{n \geq 0}$ is a Cauchy sequence. If $x^{*} = lim_{n \to \infty} x_{n}$ then for $m \to \infty$ in the above inequality, we get (38), and from

‖ f (x_{n}) ‖ \leq α^{- \frac{1}{p}} ρ_{0}^{{(1 + p)}^{n}},

for $n \to \infty,$ we get $f (x^{*}) = 0$ . ∎

References

[1] Argyros, K.I., Concerning the convergence of Newton’s method, The Renjab University Journal of Mathematics, Vol. XXI (1988), pp.1–11.
[2] Argyros, K.I, The secant method and fixed points of nonlinear operrators, Mh. Math., 106 (1988) pp. 85–94.
[3] Dennis, J. E., Toward a unified convergence theory for Newton like methods, Nonlinear Functional Analysis and Applications. (Ed. by L.B. Rall). John Wiley, New York (1986).
[4] Lazăr, I., ^†^†margin: available soon,
refresh and click here $\to$ On Newton’s method for solving operator equations with Hölder continuous derivative. Rev. Anal. Numér. Théor. Approx., v. 23. no. 2 (1993), pp. 177–187.
[5] Ortega, J. M. and Rheinboldt, W., Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York and London, 1970.
[6] ^†^†margin: clickable $\to$ Păvăloiu, I., Remarks on the secant method for the solution of nonlinear operational equations. Research Seminars, Seminar on Mathematical analysis. Preprint nr.7 (1991) pp.127–132.
[7] ^†^†margin: clickable $\to$ Păvăloiu, I., On the convergence of a Steffensen-type method, Research Seminars. Seminar of Mathematical Analysis. Preprint nr.7 (1991), pp.121–126.
[8] Păvăloiu, I., ^†^†margin: available soon,
refresh and click here $\to$ Introduction in the theory of approximation of equations solutions. Dacia Ed., Cluj-Napoca, (1976) (in Romanian).
[9] ^†^†margin: clickable $\to$ Păvăloiu, I., Sur une généralisation de la méthode de Steffensen, Rev. Anal. Numér. Théor. Approx. v. 21, no. 1, (1992), pp.59–65.
[10] Schmidt, J. W. Konvergenzgesch windigkert der Regula falsi und der Steffensen Verfahrens in Banachraum. Z.A.M.M. 46, 2, (1996) pp. 146–148.
[11] U’lm, S., Ob. obobschennyh razdelennih raznostiakh I., Izv. Acad. Nauk Estonskoi SSR, 16 (1967), 13-36.
[12] U’lm, S., Ob. obobschennyh razdelennih raznostiakh II., Izv. Acad. Nauk Estonskoi SSR, 16 (1967), 146-155.
[13] U’lm, S., Ob. obobschenie metoda Steffensena dlea reshenia nelineingh-operatornih urovnenii. Jurnal vicisl. mat. i mat.-fiz. 4, 6, (1969).

Received 15 X 1993

Institutul de Calcul

Str. Republicii 37

P.O. Box 68

3400 Cluj-Napoca

România

1994

Approximation properties of a class of operators of Stancu-Kantorovich type

February 7, 2023

Some Problems of Stability in Physico-Chemical Hydrodinamics

July 21, 2025

Surface mobility of surfactant solutions XVI. Involvement of the fluid viscosities in the Marangoni flow – some aspects

September 25, 2018

Observations concerning some approximation methods for the solutions of operator equations

Abstract

Authors

Keywords

PDF

Cite this paper as:

About this paper

Journal

Publisher Name

Article on the journal website

Print ISSN

Online ISSN

Google Scholar Profile

References

Paper (preprint) in HTML form

Observations Concerning Some Approximation Methods for the Solutions of Operator Equations

1. Introduction

Definition 1.1.

Definition 1.2.

2. Considerations on the Secant Method

Theorem 2.1.

Lemma 2.1.

Lemma 2.2.

Theorem 2.2.

Theorem 2.3.

Proof.

3. Considerations on Steffensen Method

Theorem 3.1.

Proof.

4. Considerations Concerning Newton’s Method

Theorem 4.1.

Proof.

References

Related Posts