首页| English| 中国科学院

Algorithms for Creative Telescoping

副标题:

时间:2019-12-30  来源:

题目:         Algorithms for Creative Telescoping

报告人:    Huang Hui (University of Waterloo)

时间地点: 2019.12.30  15:00pm  N219

摘要:        In this talk, we explore the prominent method of creative telescoping. This is a powerful method pioneered by Zeilberger in the 1990s and has now become the cornerstone for finding closed forms for definite sums (and definite integrals) in computer algebra. After a brief overview of the method, the talk is divided into two parts. In the first part, we restrict our attentions to the case of rational functions and introduce two most recent algorithms for creative telescoping in this context. In the second part, these two algorithms will be exploited under the more general framework of hypergeometric terms. Difficultiesfor this generalization will be discussed then.

This talk is based on joint papers with Shaoshi Chen, Hao Du, Mark Giesbrecht, Qing-Hu Hou, Manuel Kauers, George Labahn, Ziming Li, Rong-Hua Wang and Eugene Zima.

相关附件
相关文档