Quadratically convergent multiple roots finding method without derivatives (Q5948824)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Quadratically convergent multiple roots finding method without derivatives |
scientific article; zbMATH DE number 1672048
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quadratically convergent multiple roots finding method without derivatives |
scientific article; zbMATH DE number 1672048 |
Statements
Quadratically convergent multiple roots finding method without derivatives (English)
0 references
12 November 2001
0 references
single nonlinear equation
0 references
modified Steffensen's method
0 references
quadratic convergence
0 references
multiple root finding
0 references
simple root finding
0 references
numerical examples
0 references
0.90773964
0 references
0.8978777
0 references
0.8902335
0 references
0.88367605
0 references
0.87984383
0 references
0.8726412
0 references
0 references
0.8715323
0 references
According to the fact that multiple root finding of a single nonlinear equation (1) \(f(x)=0\) may be reduced to simple root finding of a corresponding equation (2) \(F(x)=0\), the authors use a modified Steffensen's method, given by NEWLINE\[NEWLINEx_{n+1}=x_n-F(x_n){F(x_n)+(F(x_n+F(x_n))-F(x_n))/F(x_n)}^{-1}, \tag{3} NEWLINE\]NEWLINE which does not involve any derivative of \(F\). NEWLINENEWLINENEWLINEHowever, in order to prove that (3) is at least quadratic convergent, the existence of the second derivative of \(F\) is assumed. Numerical examples are given for single root equations of the form (2), as well as for multiple roots equations of the form (1).
0 references