Dan Luca
Tiberiu Popoviciu Institute of Numerical Analysis
Ion Păvăloiu
Tiberiu Popoviciu Institute of Numerical Analysis
D. Luca, I. Păvăloiu, On the Heron’s method for approximating the cubic root of a real number , Rev. Anal. Numér. Théor. Approx., 26 (1997) nos. 1-2, pp. 103-108.
[1] G. Deslauries and S. ubuc, Le calcul de la racine cubique selon Heron, Elemente der 51, I (1996), pp. 28-34.
[2] M. Ostrowski, A Solution of Equations and Systems of Equation, Academic Press, New York-London, 1960.
[3] I. Păvăloiu I., On the monotonicity of the sequences of approximations obtained by Steffensen,s method, Mathematica (Cluj) 35 (58),1 (1993), pp. 71-76.
[4] T. Popoviciu, Sur la delimiation de l’erreur dans l’approximation des racines d’une equation par interpolation lineaire ou quadratique, Rev. Roumaine Math. Pures Appl. XIII, 1 (1968), pp. 75-78.
/*======================================================================
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; }
On the Heron’s method for approximating the cubic root of a real number
On the Heron’s method for approximating
the cubic root of a real number
Dan Luca, Ion Păvăloiu
1991 Mathematics Subject Classification: 65G05, 65B05
1. Introduction
In this paper we shall specify and go deeply into some problems presented in
[2 ] , concerning the Heron’s method for approximating the
cubic root of a positive number.
The authors of [2 ] construct a method based on the
Heron’s algorithm for computing the cubic root of 100.
The method works as follows: Given two real numbers a and b satisfying
a 3 < N < b 3 , the Heron’s method for approximating N 3 is
(1)
ϕ ( N , a , b ) = a + b d 1 b d 1 + a d 2 ( b − a ) ,
where d 1 = N − a 3 and d 2 = b 3 − N . We shall show that the
approximation (1 ) of N 3 follows from the regula
falsi applied to the equation x 2 − N x = 0 [3 ] . This
will given a rigorous interpretation of (1 ), and the results from
[2 ] will be reached again.
Using results from [5 ] , we shall give other error bounds than
those in [2 ] . On the other hand, the method is
generalized to the case N p , p ∈ ℕ , p ≥ 2 , the method
also offering bilateral approximations. Some remarks on applying the results
in [5 ] for the error bounds will lead us to the generalization
of the Heron’s method.
2. Herons’s method and regula falsi
A. In order to approximate the cubic root of N > 0 by (1 ),
consider the function f : [ a , b ] → ℝ , f ( x ) = x 3 − N , 0 < a < b and the function g : [ a , b ] → ℝ , g ( x ) = f ( x ) x .
It is well known that regula falsi applied to the equation g ( x ) = 0 leads to the following approximation of its root
[ u , v ; g ] denoting the first-order divided difference of g
on the nodes u and v . It can be easily verified that c = ϕ ( N , a , b ) .
Taking into account that c ∈ ( a , b ) and denoting by [ u , v , w ; g ] the second-order divided difference of g on the points
u , v , w , we get
(3)
g ( x ) = g ( a ) + [ a , b ; g ] ( x − a ) + [ a , b , x ; g ] ( x − a ) ( x − b )
for all x ∈ ( a , b ) .
For x = N 3 in (3 ) we obtain
g ( a ) + [ a , b ; g ] ( N 3 − a ) + [ a , b , N 3 ; g ] ( N − a 3 ) ( N 3 − b ) = 0 ,
from which, by dividing [ a , b ; g ] it follows
(4)
c − N 3 = [ a , b , N 3 ; g ] [ a , b ; g ] ( N 3 − a ) ( N 3 − b ) .
An elementary calculation on [ a , b , N 3 ; g ] [ a , b ; g ] shows that
(5)
c − N 3 N 3 = N 3 + a b N 3 [ a b ( a + b ) + N ] ( N 3 − a ) ( N − b 3 ) ( N 3 − a b ) ,
which gives Theorem 3, [2 ] .
Taking into account the above remarks and using the evaluations obtained by T.
Popoviciu in [5 ] , (4 ) gives the following error
bounds
(6)
m 2 M 1 ( N 3 − a ) ( b − N 3 ) ≤ | c − N 3 | ≤ M 2 m 1 ( N 3 − a ) ( b − N 3 ) ,
where
m 1 =
3 a
m 2 =
min { N a 3 − 1 , 1 − N b 3 }
M 1 =
max { 2 a 3 + N a 2 , 2 b 3 + N b 2 }
M 2 =
max { N a 3 − 1 , 1 − N b 3 } .
Note that (6 ) leads to a very good error evalutation; since a and
b are close to N , then m 2 and M 2 are close to zero. This is
implied by the fact that the function g and its second derivative vanish at
the same point x = N 3 .
B. It can be easily seen that the method presented at A can
be generalized. For the approximation of the root of order p of the real
number N , p ∈ ℕ , p ≥ 2 , consider the function f 1 : [ a 1 , b 1 ] → ℝ ,
f 1 ( x ) = x p − N , 0 < a 1 < b 1 , a 1 p < N < b 1 p
and the function g 1 : [ a 1 , b 1 ] → ℝ ,
g 1 ( x ) = f 1 ( x ) x q , where q = p − 1 2 .
The function
g 1 satisfies g 1 ( N p ) = g 1 ′′ ( N p ) .
Applying regula falsi to the equation g 1 ( x ) = 0 , we
obtain
(7)
c 1 = a 1 − g 1 ( a 1 ) [ a 1 , b 1 ; g 1 ]
Similarly to A , we obtain
(8)
c 1 − N p = [ a 1 , b 1 , N p ; g 1 ] [ a 1 , b 1 ; g 1 ] ( N p − b 1 ) ( N p − a 1 ) ,
which gives
(9)
t 2 2 T 1 ( N p − a 1 ) ( b 1 − N p ) ≤ | c 1 − N p | ≤ T 2 2 t 1 ( N p − a 1 ) ( b 1 − N p ) ,
where
t 1 =
p a 1 p − 1 2
t 2 =
min { ( p − 1 ) ( p + 1 ) ( N − a 1 p ) 4 a 1 p + 3 2 ; ( p − 1 ) ( p + 1 ) ( b 1 p − N ) 4 b 1 p + 3 2 }
T 1
= max { ( p + 1 ) a 1 p + ( p − 1 ) N 2 a 1 p + 1 2 ; ( p + 1 ) b 1 p + ( b − 1 ) N 2 b 1 p + 1 2 }
T 2
= max { ( p − 1 ) ( p + 1 ) ( N − a 1 p ) 4 a 1 p + 3 2 ; ( p − 1 ) ( p + 1 ) ( b 1 p − N ) 4 b 1 p + 3 2 } .
3. Steffensen’s method for approximating the p th-order root
Let I = [ α , β ] , α < β be an interval of the real axis.
Consider the equation
where F : I → ℝ . Suppose that equation (10 )has a
root x ¯ ∈ ( α , β ) . Consider also a function
h : I → ℝ such that equation
is equivalent to (10 ).
The Steffensen’s method consists in the generation of two sequences ( x n ) and ( h ( x n ) ) by the
relations
(12)
x n + 1 = x n − F ( x n ) [ x n , h ( x n ) ; F ] , n = 0 , 1 , … , x 0 ∈ I .
As we shall see, this method offers the possibility to obtain better both
upper and lower approximations, by starting with a lower approximation of
N p . Then, by applying only once the regula falsi
(7 ), the precision can be increased.
As concerns the convergence of ( x n ) and ( h ( x n ) ) in (12 ), in [4 ] the following
theorem is proved.
Theorem 3.1 .
[ 4 ] . If the functions F : I → ℝ
and h : I → ℝ are continuous and satisfy the following conditions:
i)
the function h is decreasing on I ,
ii)
the function F is increasing and convex on I ,
iii)
there exists x 0 ∈ I such that F ( x 0 ) < 0
and h ( x 0 ) ∈ I ,
iv)
the equations (10 ) and (11 ) are equivalent,
then the following properties hold:
j)
the sequence ( x n ) is increasing,
jj)
the sequence ( h ( x n ) ) is decreasing,
jjj)
jv)
the relations x n ≤ x n + 1 ≤ x ¯ ≤ h ( x n ) hold for all n = 0 , 1 , … ,
v)
Applying this Theorem for F : [ α , β ] → ℝ ,
F ( x ) = x p − N , h : [ α , β ] → ℝ ,
where 0 < α < β and
p ∈ ℕ , p ≥ 2 , we obtain
x n + 1 = x n + ( p α p − 1 ) p − 1 ( x n − N ) 2 ( p α p − 1 x n − x n p + N ) p − ( p α p − 1 x n ) p , n = 0 , 1 , … , x 0 = α ; α p < N .
Since F is increasing and convex [ α , β ] , it follows
that h is decreasing on [ α , β ] , and the equations
F ( x ) = 0 and h ( x ) − x = 0 are equivalent. So the
conclusion of Theorem 3.1 follows.
The sequences ( x n ) and ( h ( x n ) ) being convergent, it follows that for all ε > 0 there
exists n 0 ∈ ℕ such that for n ≥ n 0 we have
which implies N p − x n < ε and h ( x n ) − N p < ε .
If we use (7 ) for a 1 = x n and b 1 = h ( x n )
and g 1 ( x ) = F ( x ) x p − 1 2 ,
and we denote the approximation obtained by c n , then by (9 ) we
have
where
{ T 2 ′ = max { ( p − 1 ) ( p + 1 ) ( N − x n p ) 4 x n p + 3 2 ; ( p − 1 ) ( p + 1 ) ( h p ( x n ) − N ) 4 h ( x n ) p + 3 2 } t 1 ′ = p x n p − 1 2 .
4. A Numerical example
We intend to apply the method described in Section 3 for the approximation of
the number 100 5 , i.e., for solving the equation x 3 − 100 = 0 . In
this case we have
and, taking α = 2 , for the function h we have
Considering x 0 = α = 2 and using (12 ), with F and h given
above, we obtain for the sequences ( x n ) n ≥ 0 and
( h ( x n ) ) n ≥ 0 the following values:
Table 1.
References
[1]
[2]
G. Deslauries and S. Dubuc, Le calcul de
la racine cubique selon Héron , Elemente der Mathematik 51 ,
(1996) 1, 28–34.
[3]
M. Ostrowski, The solution of Equations and Systems
of Equations , Academic Press, New York-London, 1960.
[4]
† † margin:
clickable →
I. Păvăloiu, On the monotonicity of the
sequences of approximations obtained by Steffensen’s method , Mathematica
(Cluj) 35 (58) , (1993) 1, 71–76.
[5]
T. Popoviciu, S ur la dèlimitation de
† † margin:
available soon,
refresh and click here →
l’erreur dans l’approximation des racines d’une équation par interpolation
linéaire ou quadratique , Rev. Roumaine Math. Pures Appl. XIII ,
(1968) 1, 75–78.