A simple and fast algorithm for computing exponentials of power series

DOI10.1016/j.ipl.2009.03.012zbMath1202.65031arXiv1301.5804OpenAlexW2037357482MaRDI QIDQ989478

Alin Bostan, Éric Schost

Publication date: 20 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.5804

zbMATH Keywords

algorithmsfast Fourier transformNewton iterationpower seriesexponential

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Numerical computation of solutions to single equations (65H05) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (3)

Solving composite sum of powers via Padé approximation and orthogonal polynomials with application to optimal PWM problem ⋮ Homotopy techniques for multiplication modulo triangular sets ⋮ Fast algorithms for elementary operations on complex power series

Cites Work

• Unnamed Item
• Unnamed Item
• Newton's method and FFT trading
• Variations on computing reciprocals of power series
• Relax, but don't be too lazy
• Fast Algorithms for Manipulating Formal Power Series
• The truncated fourier transform and applications

This page was built for publication: A simple and fast algorithm for computing exponentials of power series