On a family of iterative methods for simultaneous extraction of all roots of algebraic polynomial (Q1763292)
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: On a family of iterative methods for simultaneous extraction of all roots of algebraic polynomial |
scientific article; zbMATH DE number 2136182
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a family of iterative methods for simultaneous extraction of all roots of algebraic polynomial |
scientific article; zbMATH DE number 2136182 |
Statements
On a family of iterative methods for simultaneous extraction of all roots of algebraic polynomial (English)
0 references
22 February 2005
0 references
A family of iterative methods based on the frame: \[ x_{k+1}=x_k-u_k\left(1+{f(x_k-u_k)\over f(x_k)-2\lambda f(x_k-u_k)}\right) \] is discussed for simultaneous approximation of all the zeros of a polynomial \(f(x)\). Here \(u_k=f(x_k)/f'(x_k)\) and \(\lambda\) is a parameter. It is shown that Newton, Newton-secant, Traub and Traub-Ostrowski methods can be recovered by the appropriate value of the parameter \(\lambda\). It is proven this family of iterative methods has the convergence order of three. Numerical examples confirm convergence of the proposed method.
0 references
zero of polynomial
0 references
Newton method
0 references
convergence
0 references
secant method
0 references
multi-point iterative methods
0 references
Traub and Traub-Ostrowski methods
0 references
numerical examples
0 references
0.9379268
0 references
0.9314917
0 references
0.92415506
0 references
0.91763586
0 references