33 citations · 106 across the 19 of their papers we have counts for
Showing 2013 · cs.SCShow all
2 papers · 2 filters
cs.SC2013★ 3 cited
Computing Real Roots of Real Polynomials
Michael Sagraloff, Kurt Mehlhorn
Computing the roots of a univariate polynomial is a fundamental and long-studied problem of computational algebra with applications in mathematics, engineering, computer science, a…
cs.SC2013★ 7 cited
From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition
Kurt Mehlhorn, Michael Sagraloff, Pengming Wang
We present an algorithm for isolating the roots of an arbitrary complex polynomial that also works for polynomials with multiple roots provided that the number of distinct…