Bounds for Creative Telescoping

Activity: Talk or presentation › Invited talk › unknown

Description

Algorithms for definite summation or integration produce a linear recurrence of differential operator with polynomial coefficients as output. These operators are called telescopers. The telescopers for a given summation or integration problem are not unique, so the question arises whether some of them are easier to compute than others. To answer this, we first have to understand the possible sizes of the telescopers. We give an overview over some recent results in this direction. Some of them are joint work with Shaoshi Chen, others are joint work with Lily Yen.
Period22 Jan 2014
Event titleCASTA 2014
Event typeConference
LocationJapanShow on map

Fields of science

  • 101013 Mathematical logic
  • 101001 Algebra
  • 101012 Combinatorics
  • 101020 Technical mathematics
  • 101 Mathematics
  • 101009 Geometry
  • 101005 Computer algebra

JKU Focus areas

  • Computation in Informatics and Mathematics