- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- BIRS Workshop Lecture Videos /
- Reduction-Based Creative Telescoping for D-Finite Functions
Open Collections
BIRS Workshop Lecture Videos
BIRS Workshop Lecture Videos
Reduction-Based Creative Telescoping for D-Finite Functions Koutschan, Christoph
Description
Creative telescoping is a powerful technique to tackle summation and integration problems symbolically, but it can be computationally very costly. Many existing algorithms compute two objects, called telescoper and certificate, but in many applications only the first one is of interest, while typically the second one is larger in size. In the past few years a new direction of research was initiated, namely to develop creative telescoping algorithms that are based on Hermite-type reductions, which avoid the computation of the certificate and therefore can be more efficient in practice. In our 2016 ISSAC paper, we have developed an algorithm for constructing minimal-order telescopers for algebraic functions, based on Trager's reduction and on a so-called polynomial reduction. Later we have extended this algorithm to fuchsian D-finite functions. This is joint work with Shaoshi Chen, Mark van Hoeij, and Manuel Kauers.
Item Metadata
Title |
Reduction-Based Creative Telescoping for D-Finite Functions
|
Creator | |
Publisher |
Banff International Research Station for Mathematical Innovation and Discovery
|
Date Issued |
2017-09-19T11:01
|
Description |
Creative telescoping is a powerful technique to tackle summation and integration problems symbolically, but it can be computationally very costly. Many existing algorithms compute two objects, called telescoper and certificate, but in many applications only the first one is of interest, while typically the second one is larger in size. In the past few years a new direction of research was initiated, namely to develop creative telescoping algorithms that are based on Hermite-type reductions, which avoid the computation of the certificate and therefore can be more efficient in practice. In our 2016 ISSAC paper, we have developed an algorithm for constructing minimal-order telescopers for algebraic functions, based on Trager's reduction and on a so-called polynomial reduction. Later we have extended this algorithm to fuchsian D-finite functions. This is joint work with Shaoshi Chen, Mark van Hoeij, and Manuel Kauers.
|
Extent |
28 minutes
|
Subject | |
Type | |
File Format |
video/mp4
|
Language |
eng
|
Notes |
Author affiliation: Austrian Academy of Sciences
|
Series | |
Date Available |
2018-03-31
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
DOI |
10.14288/1.0364596
|
URI | |
Affiliation | |
Peer Review Status |
Unreviewed
|
Scholarly Level |
Postdoctoral
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International