88 citations · 270 across the 33 of their papers we have counts for
Showing 2009 · cs.SCShow all
2 papers · 2 filters
cs.SC2009★ 4 cited
Faster exponentials of power series
David Harvey
We describe a new algorithm for computing exp(f) where f is a power series in C[[x]]. If M(n) denotes the cost of multiplying polynomials of degree n, the new algorithm costs (2.16…
cs.SC2009★ 2 cited
Faster algorithms for the square root and reciprocal of power series
David Harvey
We give new algorithms for the computation of square roots and reciprocals of power series in C[[x]]. If M(n) denotes the cost of multiplying polynomials of degree n, the square ro…