On the efficiency of some combined methods for polynomial complex zeros (Q911229)
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: Publication:911229 |
scientific article; zbMATH DE number 4141407
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the efficiency of some combined methods for polynomial complex zeros |
scientific article; zbMATH DE number 4141407 |
Statements
On the efficiency of some combined methods for polynomial complex zeros (English)
0 references
1990
0 references
Several combined methods are obtained from two kinds of algorithms for approximating, simultaneously, the complex zeros of a polynomial: firstly it is applied an algorithm in point-complex arithmetic, then, in the final steps, it is applied an algorithm in circular interval arithmetic, providing in this manner the enclosure of zeros. Estimations of computational efficiency in order to appraise the expected accuracy for the interval methods and the combined methods are devised. In addition, the efficiency and the convergence properties of some combined methods are demonstrated by means of a few numerical examples.
0 references
inclusion of polynomial zeros
0 references
simultaneous iterative methods
0 references
interval arithmetic
0 references
complex zeros of a polynomial
0 references
algorithm
0 references
point-complex arithmetic
0 references
circular interval arithmetic
0 references
computational efficiency
0 references
interval methods
0 references
convergence
0 references
numerical examples
0 references
0 references
0 references
0.8146923184394836
0 references
0.8137893676757812
0 references
0.8106858730316162
0 references
0.8010837435722351
0 references
0.8010053634643555
0 references
