A simple and fast online power series multiplication and its analysis
From MaRDI portal
Publication:492037
DOI10.1016/j.jsc.2015.03.001zbMath1337.68299OpenAlexW1964452015MaRDI QIDQ492037
Publication date: 19 August 2015
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2015.03.001
Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Complexity and performance of numerical algorithms (65Y20) Online algorithms; streaming algorithms (68W27) Acceleration of convergence in numerical analysis (65B99)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relaxed algorithms for \(p\)-adic numbers
- On short multiplications and divisions
- Fast on-line integer multiplication
- Relax, but don't be too lazy
- The middle product algorithm. I: Speeding up the division and square root of power series
- New algorithms for relaxed multiplication
- A long note on Mulders' short product
- Modern Computer Arithmetic
- Faster relaxed multiplication
- The truncated fourier transform and applications
- Fast online multiplication of real numbers
- Relaxed p-adic Hensel lifting for algebraic systems
- Boolean Memories
This page was built for publication: A simple and fast online power series multiplication and its analysis