【24h】

Symbolic Summation with Single-Nested Sum Extensions

机译:单嵌套和扩展的符号求和

获取原文
获取原文并翻译 | 示例

摘要

We present a streamlined and refined version of Karr's summation algorithm. Karr's original approach constructively decides the telescoping problem in ΠΣ-fields, a very general class of difference fields that can describe rational terms of arbitrarily nested indefinite sums and products. More generally, our new algorithm can decide constructively if there exists a so called single-nested ΠΣ-extension over a given ΠΣ-field in which the telescoping problem for f can be solved in terms that are not more nested than f itself. This allows to eliminate an indefinite sum over f by expressing it in terms of additional sums that are not more nested than f. Moreover, our refined algorithm contributes to definite summation: it can decide constructively if the creative telescoping problem for a fixed order can be solved in single-nested Σ~*-extensions that are less nested than the definite sum itself.
机译:我们提出了Karr求和算法的精简版本。卡尔的原始方法以建设性的方式确定了ΠΣ场中的伸缩问题,这是一类非常通用的差分场,可以描述任意嵌套的不确定和和积的有理项。更笼统地说,我们的新算法可以建设性地决定在给定的ΠΣ场上是否存在所谓的单嵌套ΠΣ扩展,其中f的伸缩问题可以通过嵌套而不是f本身来解决。通过用不比f多嵌套的附加和表示它,可以消除f上的不确定和。此外,我们改进的算法有助于确定求和:它可以建设性地决定是否可以在嵌套比确定总和本身少的单嵌套Σ〜*扩展中解决固定顺序的创造性伸缩问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号