Numerical factorization of polynomials via a fast transversal filter (Q2732969)
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: Numerical factorization of polynomials via a fast transversal filter |
scientific article; zbMATH DE number 1632336
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Numerical factorization of polynomials via a fast transversal filter |
scientific article; zbMATH DE number 1632336 |
Statements
Numerical factorization of polynomials via a fast transversal filter (English)
0 references
2 December 2001
0 references
numerical factorization
0 references
univariate polynomials
0 references
difference equation
0 references
fast transversal filter
0 references
The author develops an algorithm for the numerical factorization of univariate polynomials into two factors. The algorithm is based on the asymptotic behaviour of sums of powers of complex numbers and Hankel matrices. Convergence properties of a difference equation associated to the polynomial are exploited, too. The problem is solved via the fast transversal filter technique. The algorithm together with a theoretical basis are sketched, and numerical examples are provided.
0 references
0.8101701140403748
0 references
0.8054466247558594
0 references
0.8052207827568054
0 references
0.7999882698059082
0 references
