On the Complexity of Composition and Generalized Composition of Power Series

DOI10.1137/0209004zbMath0447.68033OpenAlexW1990157214MaRDI QIDQ3893296

J. F. Traub, Richard P. Brent

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

iterationfast algorithmsfunctional equationscompositionformal power seriessimilarity transformationsSchroeder function

Mathematics Subject Classification ID

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

Related Items

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