An iterated eigenvalue algorithm for approximating roots of univariate polynomials (Q697487)
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: An iterated eigenvalue algorithm for approximating roots of univariate polynomials |
scientific article; zbMATH DE number 1801676
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An iterated eigenvalue algorithm for approximating roots of univariate polynomials |
scientific article; zbMATH DE number 1801676 |
Statements
An iterated eigenvalue algorithm for approximating roots of univariate polynomials (English)
0 references
17 September 2002
0 references
The author studies an iterative algorithm that approximates all roots of a univariate polynomial. The iteration is based on floating-point computation of the eigenvalues of a generalized companion matrix. A few interesting examples including ill-conditioned polynomials are carefully implemented for the algorithms.
0 references
univariate polynomials
0 references
eigenvalue
0 references
root
0 references
numerical examples
0 references
iterative algorithm
0 references
companion matrix
0 references
0 references
0 references
0.9251723885536194
0 references
0.8184013366699219
0 references
0.806320071220398
0 references
0.8044854998588562
0 references
0.8022979497909546
0 references
