Skip to Main content Skip to Navigation
Journal articles

A simple and fast online power series multiplication and its analysis

Romain Lebreton 1 Éric Schost 2 
1 ECO - Exact Computing
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : This paper focus on online (or relaxed) algorithms for the multiplication of power series over a field and their analysis. We propose a new online algorithm for the multiplication using middle and short products of polynomials as building blocks, and we give the first precise analysis of the arithmetic complexity of various online multiplications. Our algorithm is faster than Fischer and Stockmeyer's by a constant factor; this is confirmed by our experimental results.
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Romain Lebreton Connect in order to contact the contributor
Submitted on : Monday, November 24, 2014 - 5:07:24 PM
Last modification on : Friday, August 5, 2022 - 3:02:58 PM
Long-term archiving on: : Wednesday, February 25, 2015 - 11:26:50 AM


Files produced by the author(s)




Romain Lebreton, Éric Schost. A simple and fast online power series multiplication and its analysis. Journal of Symbolic Computation, Elsevier, 2016, 72, pp.231-251. ⟨10.1016/j.jsc.2015.03.001⟩. ⟨lirmm-00867279v2⟩



Record views


Files downloads