Academic Commons Search Results
http://academiccommons.columbia.edu/catalog.rss?f%5Bauthor_facet%5D%5B%5D=Brent%2C+R.+P.&f%5Bdepartment_facet%5D%5B%5D=Computer+Science&q=&rows=500&sort=record_creation_date+desc
Academic Commons Search Resultsen-usOn the Complexity of Composition and Generalized Composition of Power Series
http://academiccommons.columbia.edu/catalog/ac:141071
Brent, R. P.; Traub, Joseph F.http://hdl.handle.net/10022/AC:P:11681Mon, 31 Oct 2011 16:16:01 +0000Let F(x) = f1x + f2(x)(x) + . . . be a formal power series over a field Delta. Let F superscript 0(x) = x and for q = 1,2 . . . , define F superscript q(x) = F superscript (q-1) (F(x)). The obvious algorithm for computing the first n terms of F superscript q(x) is by the composition position analogue of repeated squaring. This algorithm has complexity about log 2 q times that of a single composition. The factor log 2 q can be eliminated in the computation of the first n terms of (F(x)) to the q power by a change of representation, using the logarithm and exponential functions. We show the factor log 2 q can also be eliminated for the composition problem. F superscript q(x) can often, but not always, be defined for more general q. We give algorithms and complexity bounds for computing the first n terms of F superscript q(x) whenever it is defined.Computer sciencejft2Computer ScienceTechnical reports