Sidi's generalized secant method: Difference between revisions

Content deleted Content added
Created page with '{{User sandbox}} <!-- EDIT BELOW THIS LINE --> == Sidi's method == Sidi's method is a root-finding algorithm, i.e. a numerical method for solving equations ...'
 
Line 22:
The estimate ''x''<sub>''n''+''k''+1</sub> is calculated as follows in the ''n''-th iteration. A polynomial ''p'' <sub>''n'', ''k'' </sub> (''x'') of degree ''k'' is fitted to the ''k'' + 1 points (''x''<sub>''n''</sub>, ''f''(''x''<sub>''n''</sub>)), …, (''x''<sub>''n''+''k''</sub>, ''f''(''x''<sub>''n''+''k''</sub>)). The next approximation ''x''<sub>''n''+''k''+1 </sub> of α is calculated as
 
:<math> x_{n+k+1} = x_{n+k} - \frac{f(x_{n+k})}{p_{n,k}'(x_{n+k})} </math>
[[File:D:\Marco\Root-finding algorithms\Sidi's method\Next estimate.PNG|thumbnail]]
 
with ''p’ '' <sub>''n'',''k''</sub>(''x''<sub>''n''+''k''</sub>) the derivative of ''p'' <sub>''n'',''k''</sub> at ''x''<sub>''n''+''k''</sub>.
 
== References ==