A computational test for the existence of a polynomial zero (Q1121639)
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 4104264
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computational test for the existence of a polynomial zero |
scientific article; zbMATH DE number 4104264 |
Statements
A computational test for the existence of a polynomial zero (English)
0 references
1989
0 references
A computational test for the existence of a polynomial complex zero in a given complex region is introduced. The test can be combined with Newton- like methods to improve circular (or rectangular) approximation of the requested zero. An example is given.
0 references
computational test
0 references
polynomial complex zero
0 references
Newton-like methods
0 references
0.8129763603210449
0 references
0.7731883525848389
0 references
0.7694478034973145
0 references
0.7694478034973145
0 references
