A hybrid method for polynomial complex zero (Q758127)
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 4195053
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A hybrid method for polynomial complex zero |
scientific article; zbMATH DE number 4195053 |
Statements
A hybrid method for polynomial complex zero (English)
0 references
1991
0 references
The paper deals with an iterative algorithm for finding isolated simple complex zeroes of a polynomial. Using Weierstrass' interval formula for the simultaneous inclusion of all zeroes of the polynomial and rectangular floating-point arithmetic, a hybrid method with high computational efficiency is presented. Furthermore, error bounds of the approximate solution are determined. In a second part, a computationally verifiable test for the existence of a zero in a given disc is established. A numerical example is given, too.
0 references
rectangular arithmetic
0 references
iterative algorithm
0 references
isolated simple complex zeroes
0 references
polynomial
0 references
Weierstrass' interval formula
0 references
simultaneous inclusion
0 references
floating-point arithmetic
0 references
hybrid method
0 references
error bounds
0 references
numerical example
0 references
0 references
0.8603442311286926
0 references
0.8255758285522461
0 references
0.8228087425231934
0 references
0.8187183737754822
0 references
0.8186993598937988
0 references
