Faster exponentials of power series

Details Faster exponentials of power series Faster exponentials of power series

2009-11-16

arxiv.org/abs/0911.3110v1

Computer Science

Symbolic Computation

3 pages, requires algorithm2e package

Scientific paper

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).

Affiliated with

Also associated with

No associations

Rating

Faster exponentials of power series does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Faster exponentials of power series, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Faster exponentials of power series will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-499599