A simple and fast online power series multiplication and its analysis

This paper focuses on online (or relaxed) algorithms for the multiplication of power series over a field and their complexity 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 o...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of symbolic computation Vol. 72; pp. 231 - 251
Main Authors:	Lebreton, Romain, Schost, Éric
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01-01-2016 Elsevier
Subjects:	Arithmetic complexity Computational Complexity Computer Arithmetic Computer Science Multiplication of power series Online algorithm Relaxed algorithm Symbolic Computation Online algorithm Relaxed algorithm Arithmetic complexity Multiplication of power series arithmetic complexity multiplication of power series relaxed algorithm
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	This paper focuses on online (or relaxed) algorithms for the multiplication of power series over a field and their complexity 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 experimental results.
ISSN:	0747-7171 1095-855X
DOI:	10.1016/j.jsc.2015.03.001