Séminaire du 21 septembre 2009,
10h30: Bernhard Beckermann,
Université des Sciences et Technologies de Lille.
Fraction-Free Computation of Simultaneous Padé Approximants.
In this talk we describe a new, fast algorithm for solving the
simultaneous Padé approximation problem. The algorithm is
fraction-free and is suitable for computation in domains where
growth of coefficients in intermediate computations are a central
concern. The algorithm gives significant improvement on previous
fraction-free methods, in particular when solved via the use of
vector Hermite-Padé approximation using the FFFG order basis
algorithm previously done by the authors. The improvements are
both in terms of bit complexity and in reduced size of the
intermediate quantities. This is joint work with George Labahn, Waterloo.
Last modified: Mon Mar 30 14:53:58 CEST 2009