A fast numerical algorithm for the composition of power series with complex coefficients

DOI10.1016/0304-3975(86)90107-6zbMath0632.68039OpenAlexW2030141403MaRDI QIDQ1095657

Peter Ritzmann

Publication date: 1986

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90107-6

zbMATH Keywords

formal power seriescomposition problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Related Items (7)

Fast evaluation and root finding for polynomials with floating-point coefficients ⋮ Root refinement for real polynomials using quadratic interval refinement ⋮ Computing real roots of real polynomials ⋮ Modular composition via factorization ⋮ Fast multivariate multi-point evaluation revisited ⋮ Nearly optimal computations with structured matrices ⋮ A fast algorithm for reversion of power series

Cites Work

• Unnamed Item
• The complexity of partial derivatives
• Fast modular transforms
• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
• Fast multiplication of large numbers
• Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
• An algorithm for division of powerseries
• Fast Algorithms for Manipulating Formal Power Series

This page was built for publication: A fast numerical algorithm for the composition of power series with complex coefficients