arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.06898cs.SCmath.COmath.RA
收藏

有效的理性创造性伸缩

Efficient Rational Creative Telescoping

Mark Giesbrecht, Hui Huang, George Labahn, Eugene Zima

摘要:

本文提出了一种计算两离散变量有理函数最小极值点的新算法。与最近的减少为基础的方法,我们的算法具有重要的功能,计算的望远镜是独立的证书。此外,我们的算法使用了一个紧凑的表示的证书,这使得它很容易被操纵和分析,而不知道精确的扩展形式。这种表示隐藏了潜在的表达式膨胀,直到最终(和可选的)扩展,这可以在扩展证书大小的时间多项式中完成。复杂性分析,以及Maple实现,表明我们的算法具有更好的理论和实际性能比减少为基础的方法在合理的情况下。

英文摘要:

We present a new algorithm to compute minimal telescopers for rational functions in two discrete variables. As with recent reduction-based approaches, our algorithm has the important feature that the computation of a telescoper is independent of its certificate. In addition, our algorithm uses a compact representation of the certificate, which allows it to be easily manipulated and analyzed without knowing the precise expanded form. This representation hides potential expression swell until the final (and optional) expansion, which can be accomplished in time polynomial in the size of the expanded certificate. A complexity analysis, along with a Maple implementation, indicates that our algorithm has better theoretical and practical performance than the reduction-based approach in the rational case.

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

↑