Abstract
The composition problem for univariate complex power series P, Q (i.e., the computation of the first n + 1 coefficients of the composition Q ° P) is numerically solved by interpolation methods. Using multitape Turing machines as a model of computation, the composition problem of power series with integer coefficients of modulus ⩽ν, ⩾ n, is possible in time O(ψ( n 2 log n log ν)), where ψ( m) bounds the amount of time for the multiplication of m-bit numbers (e.g., ψ( m) = cm log( m + 1) log log( m + 2) for multitape Turing machines). This algorithm is asymptotically faster than an implementation of the Brent-Kung algorithm on a multitape Turing machine; the improvement is of order n 1 2 (up to logarithmic terms).
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
