Faster exponentials of power series
Symbolic Computation
2009-11-17 v1 Data Structures and Algorithms
Abstract
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.1666... + o(1)) M(n) to compute exp(f) to order n. This improves on the previous best result, namely (2.333... + o(1)) M(n).
Cite
@article{arxiv.0911.3110,
title = {Faster exponentials of power series},
author = {David Harvey},
journal= {arXiv preprint arXiv:0911.3110},
year = {2009}
}
Comments
3 pages, requires algorithm2e package