Faster relaxed multiplication

Joris van der Hoeven (1)

1 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]

In previous work, we have introduced several fast algorithms for relaxed power series multiplication (also known under the name on-line multiplication) up till a given order n. The fastest currently known algorithm works over an effective base field K with sufficiently many 2^p-th roots of unity and has algebraic time complexity O(n log n exp (2 sqrt (log 2 log log n))). In this note, we will generalize this algorithm to the cases when K is replaced by an effective ring of positive characteristic or by an effective ring of characteristic zero, which is also torsion-free as a Z-module and comes with an additional algorithm for partial division by integers. We will also present an asymptotically faster algorithm for relaxed multiplication of p-adic numbers.

Mots clés: power series; multiplication; on-line algorithm; FFT; computer algebra

Domaines: Logiciel mathématique [cs.MS]

Joris van der Hoeven. Faster relaxed multiplication. 2012. ⟨hal-00687479v2⟩