Locating multiple zeros interactively (Q1067359)
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 3928207
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Locating multiple zeros interactively |
scientific article; zbMATH DE number 3928207 |
Statements
Locating multiple zeros interactively (English)
0 references
1985
0 references
The paper is concerned with an algorithm, which is implemented interactively, for the total or partial factorization of a polynomial. In the first phase, a parallel search algorithm is used to locate successively smaller circles containing zeros. This continues until a reliable estimation of the multiplicities of the zeros is possible. In the second phase, an iteration is applied which provides convergence of order 3 or 4. It is considered as important that in the second phase no deflation of the given polynomial is necessary because of the separation of the zeros. There are comments on various inclusion tests. The list of references contains 33 items.
0 references
total or partial factorization of a polynomial
0 references
parallel search algorithm
0 references
circles containing zeros
0 references
iteration
0 references
convergence
0 references
0 references
0 references
0 references
0.8168831467628479
0 references
0.7989382147789001
0 references
0.7986491918563843
0 references
