Michael Sagraloff

activity

20062021

most citedComputing Real Roots of Real Polynomials ... and now For Real!

33 citations · 106 across the 19 of their papers we have counts for

collaborators

Showing math.NAShow all

3 papers · 1 filter

math.NA2015

A Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration

Ruben Becker, Michael Sagraloff, Vikram Sharma +1

We describe a subdivision algorithm for isolating the complex roots of a polynomial $F \in C [x]$ . Given an oracle that provides approximations of each of the coefficients of…

math.NA2014

A Near-Optimal Algorithm for Computing Real Roots of Sparse Polynomials

Michael Sagraloff

Let $p \in Z [x]$ be an arbitrary polynomial of degree $n$ with $k$ non-zero integer coefficients of absolute value less than $2^{τ}$ . In this paper, we answer the open questio…

math.NA2013★ 17 cited

Fast Approximate Polynomial Multipoint Evaluation and Applications

Alexander Kobel, Michael Sagraloff

It is well known that, using fast algorithms for polynomial multiplication and division, evaluation of a polynomial $F \in C [x]$ of degree $n$ at $n$ complex-valued points…