Multiplicity estimating algorithm for zeros of a complex polynomial and its applications (Q1801851)
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: Multiplicity estimating algorithm for zeros of a complex polynomial and its applications |
scientific article; zbMATH DE number 218428
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multiplicity estimating algorithm for zeros of a complex polynomial and its applications |
scientific article; zbMATH DE number 218428 |
Statements
Multiplicity estimating algorithm for zeros of a complex polynomial and its applications (English)
0 references
19 December 1993
0 references
In previous paper the author has studied in detail the behaviour of the iterates of the Durand-Kerner method near a multiple zero of a complex polynomial. In the present paper she uses results to construct an algorithm which gives at each step of the Durand-Kerner iteration also an estimate for the multiplicities of the zeros. This can then be used to speed up the convergence and to improve the accuracy of the result.
0 references
convergence acceleration
0 references
Durand-Kerner method
0 references
multiple zero
0 references
complex polynomial
0 references
Durand-Kerner iteration
0 references
multiplicities of the zeros
0 references
