A fast numerical algorithm for the composition of power series with complex coefficients
From MaRDI portal
Publication:1095657
DOI10.1016/0304-3975(86)90107-6zbMath0632.68039MaRDI QIDQ1095657
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
68Q25: Analysis of algorithms and problem complexity
68W30: Symbolic computation and algebraic computation
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