A fast and stable algorithm for splitting polynomials (Q679271): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0898-1221(96)00233-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2071565529 / rank | |||
Normal rank |
Latest revision as of 10:09, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A fast and stable algorithm for splitting polynomials |
scientific article |
Statements
A fast and stable algorithm for splitting polynomials (English)
0 references
3 June 1999
0 references
A numerical algorithm to factorize a degree \(n\) polynomial \(f\) may be described as follows. First pack the roots into clusters near zero and infinity, by means of Graeffe iterations, then factor the transformed polynomial \(G_f\) into two factors \(G_g\) and \(G_h\), where \(G_g\) has all its roots close to zero (respectively, \(G_h\) has all its roots close to infinity). This problem is called splitting. Next, one may return from Graeffe's transformations to obtain \(f=gh\) and, finally, \(g\) and \(h\) may be recursively factorized until one obtains degree 1 or 2 polynomials. The authors develop, analyze and implement an algorithm to perform the splitting of a polynomial whose complexity is in \(O(n \log \varepsilon^{-1})^{1+\delta}\) floating point operations with \(O(\log \varepsilon^{-1})^{1+\delta}\) bits of precision, improving upon previous known algorithms. The paper finishes by presenting tables with numerical results.
0 references
splitting
0 references
factorization
0 references
polynomial equations
0 references
fast algorithm
0 references
numerical stability
0 references
Greffe's transformations
0 references
complexity
0 references
numerical results
0 references
0 references