A fast algorithm for reversion of power series

DOI10.1090/S0025-5718-2014-02857-3zbMath1312.68236arXiv1108.4772MaRDI QIDQ5497035

Fredrik Johansson

Publication date: 30 January 2015

Published in: Mathematics of Computation (Search for Journal in Brave)

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

zbMATH Keywords

reversion of formal power series

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to functions of a complex variable (30-04)

Related Items (4)

Highest cusped waves for the Burgers-Hilbert equation ⋮ On the computation of modular forms on noncongruence subgroups ⋮ Modular composition via factorization ⋮ Fast multivariate multi-point evaluation revisited

Uses Software

• FLINT
• MPIR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast numerical algorithm for the composition of power series with complex coefficients
• Composing power series over a finite ring in essentially linear time
• Fast rectangular matrix multiplication and applications
• Relax, but don't be too lazy
• Faster algorithms for the square root and reciprocal of power series
• Fast Polynomial Factorization and Modular Composition
• Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
• On the Additive Complexity of Matrix Multiplication
• Fast Algorithms for Manipulating Formal Power Series
• Power series composition and change of basis
• Fast Library for Number Theory: An Introduction

This page was built for publication: A fast algorithm for reversion of power series