## Fast Algorithms for Manipulating Formal Power Series

### Cached

### Download Links

- [wwwmaths.anu.edu.au]
- [www.csd.uwo.ca]
- [www.csd.uwo.ca]
- DBLP

### Other Repositories/Bibliography

Citations: | 102 - 9 self |

### BibTeX

@MISC{Brent_fastalgorithms,

author = {R P. Brent and H T Kung},

title = {Fast Algorithms for Manipulating Formal Power Series },

year = {}

}

### Years of Citing Articles

### OpenURL

### Abstract

The classical algorithms require order n ~ operations to compute the first n terms in the reversion of a power series or the composition of two series, and order nelog n operations if the fast Founer transform is used for power series multiplication In this paper we show that the composition and reversion problems are equivalent (up to constant factors), and we give algorithms which require only order (n log n) ~/2 operations In many cases of practical importance only order n log n operations are required, these include certain special functions of power series and power series solution of certain differential equations Applications to root-finding methods which use inverse interpolation and to queueing theory are described, some results on multivariate power series are stated, and several open questions are mentioned.