arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.08982math.NTcs.DM
收藏

将Karatsuba的递归树展平为单个求和

Flattening Karatsuba's recursion tree into a single summation

Thomas Baruchel

摘要:

这里使用交织分裂方案而不是传统的左/右分裂方案来构建由Karatsuba公式产生的递归树。这允许更容易地访问树的节点,并且它们中的$2n-1$最初被一次展平为单个递归公式。整个树,然后进一步扁平成卷积公式涉及较少的基本乘法比通常的柯西产品。与传统的分裂方法不同,交错方法也可以应用于无穷幂级数,并给出了相应的公式。

英文摘要:

The recursion tree resulting from Karatsuba's formula is built here by using an interleaved splitting scheme rather than the traditional left/right one. This allows an easier access to the nodes of the tree and $2n-1$ of them are initially flattened all at once into a single recursive formula. The whole tree is then flattened further into a convolution formula involving less elementary multiplications than the usual Cauchy product. Unlike the traditional splitting scheme, the interleaved approach may also be applied to infinite power series, and corresponding formulas are also given.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑