|
This article is cited in 2 scientific papers (total in 2 papers)
Fast algorithms for elementary operations on complex power series
I. S. Sergeev
Abstract:
It is shown that the inversion of a complex-valued power series can be realised asymptotically with complexity of 5/4 multiplications (if we compare the upper bounds). It is shown that the calculation of the square root requires asymptotically also no more than 5/4 multiplications, the computation of an exponential has the complexity equal to 13/6 multiplications, and raising to an arbitrary power requires 41/12 multiplications.
Received: 02.08.2008
Citation:
I. S. Sergeev, “Fast algorithms for elementary operations on complex power series”, Diskr. Mat., 22:1 (2010), 17–49; Discrete Math. Appl., 20:1 (2010), 25–60
Linking options:
https://www.mathnet.ru/eng/dm1082https://doi.org/10.4213/dm1082 https://www.mathnet.ru/eng/dm/v22/i1/p17
|
Statistics & downloads: |
Abstract page: | 667 | Full-text PDF : | 262 | References: | 57 | First page: | 24 |
|