No label defined (Q3785822)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4048919
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4048919 |
Statements
1988
0 references
Newton correction
0 references
Gauss-Seidel method
0 references
numerical example
0 references
Halley's corrections
0 references
iterative method
0 references
multiple complex zeros of a polynomial
0 references
Halley-like algorithm
0 references
convergence order
0 references
R-order of convergence
0 references
0.9133458733558656
0 references
0.9045081734657288
0 references
0.8860423564910889
0 references
[For the entire collection see Zbl 0641.00024.] Using Newton's and Halley's corrections, some modifications of the iterative method for the simultaneous finding multiple complex zeros of a polynomial, based on the Halley-like algorithm, are obtained. The convergence order of the proposed methods is five and six, respectively. Further improvements of these methods are performed by applying the Gauss-Seidel approach. The lower bounds of the R-order of convergence for the accelerated (single-step) methods are also given. Faster convergence is attained without additional calculations which makes the proposed methods be very efficient. The considered iterative procedures are illustrated numerically in the example of an algebraic equation.
0 references