arXiv Open Access 2009

Faster exponentials of power series

David Harvey

Lihat Sumber

Abstrak

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

Topik & Kata Kunci

cs.SC cs.DS

Penulis (1)

David Harvey

Format Sitasi

APA MLA BibTeX

Harvey, D. (2009). Faster exponentials of power series. https://arxiv.org/abs/0911.3110

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2009
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓