A simple and fast algorithm for computing exponentials of power series

  • Authors:

  • Alin Bostan;Éric Schost

  • Affiliations:

  • Algorithms Project, INRIA Paris-Rocquencourt, 78153 Le Chesnay Cedex, France;ORCCA and Computer Science Department, Middlesex College, University of Western Ontario, London, Canada

  • Venue:
  • Information Processing Letters
  • Year:
  • 2009

Quantified Score

Hi-index 0.89

Visualization

Abstract

As was initially shown by Brent, exponentials of truncated power series can be computed using a constant number of polynomial multiplications. This note gives a relatively simple algorithm with a low constant factor.