How fast can we compute products?
V. V. Kislenkov, V. Mitrofanov, Eugene V. Zima · 1999
In this paper we consider the problem of fast computation ofn-ary products, for largen, over arbitrary precision integer or rational number domains. The combination of loop unrolling, chains of recurrences techniques and analogs of binary powering allows us to obtain order-of-magnitude speed improvements for such computations. Three di erent implementations of the technique (in Maple, C++ and Java) are described. Many examples together with timings are given.