A fast and stable algorithm for splitting polynomials

G. Malajovich, J. P. Zubelli

Research output: Contribution to journalArticlepeer-review

10 Scopus citations


This paper concerns the fast numerical factorization of degree a + b polynomials in a neighborhood of the polynomial xa. We want to obtain the so-called splitting of one such polynomial, i.e., a degree a factor with roots close to zero and a degree b factor with roots close to infinity. An important application of splitting is complete polynomial factorization or root finding. A new algorithm for splitting polynomials is presented. This algorithm requires O(dlog∈-1)1+δ floating point operations, with O(log∈e-1)1+δ bits of precision. As far as complexity is concerned, this is the fastest algorithm known by the authors for that problem.

Original languageBritish English
Pages (from-to)1-23
Number of pages23
JournalComputers and Mathematics with Applications
Issue number3
StatePublished - Feb 1997


  • Factorization
  • Polynomial equations
  • Splitting


Dive into the research topics of 'A fast and stable algorithm for splitting polynomials'. Together they form a unique fingerprint.

Cite this