Computing multisections of a given series solution to a linear differential operator

Frederic Chyzak, Project Algorithms, INRIA

Wednesday October 12th, 2005 at 3:30pm in K9509.


A natural problem when implementing algorithms for resummation theory is,
given a series f solution to a linear ordinary differential equation with
polynomial coefficients, to reconstruct a linear ODE satisfied by the
sub-series obtained by keeping every r terms of f.
We propose several methods and discuss how their outputs differ.

Joint work with Moulay Barkatou and Michele Loday-Richaud.