On zeros of a complex polynomial (Q1891444)
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 760299
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On zeros of a complex polynomial |
scientific article; zbMATH DE number 760299 |
Statements
On zeros of a complex polynomial (English)
0 references
18 October 1995
0 references
In this paper the authors develop an algorithm to find the zeros of polynomials having complex coefficients. The procedure is based upon a technique that combines integer preserving Bareiss's algorithm or Euclidean algorithm, iterative division using Newton's method for solving system of equations, argument-principle and deflated polynomial approximations. It is observed that the method works well and produces accurate zeros within a specified accuracy.
0 references
zeros of complex polynomials
0 references
Routh Array-type algorithm
0 references
Bareiss's algorithm
0 references
Euclidean algorithm
0 references
0.8249506950378418
0 references
0.8187183737754822
0 references
0.8140481114387512
0 references
0.8133236169815063
0 references
0.8132953643798828
0 references
