On the Complexity of Composition and Generalized Composition of Power Series

DOI10.1137/0209004zbMATH Open0447.68033OpenAlexW1990157214MaRDI QIDQ3893296FDOQ3893296

Authors: Richard P. Brent, J. F. Traub 

Publication date: 1980

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0209004

zbMATH Keywords

formal power seriessimilarity transformationscompositionfunctional equationsiterationfast algorithmsSchroeder function

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Formal power series rings (13F25)

Cited In (4)

• Differentiably finite power series
• Relax, but don't be too lazy
• On the square root of a Bell matrix
• On expansion of algebraic functions in power and Puiseux series. I

This page was built for publication: On the Complexity of Composition and Generalized Composition of Power Series

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3893296)