Orateur
Romain Lebreton
(LIRMM - Université de Montpellier)
Description
There exists a vast literature dedicated to algorithms for structured matrices,
but relatively few descriptions of actual implementations and their practical
performance in symbolic computation. In this talk, we consider the problem of
solving Cauchy-like systems, and its application to mosaic Toeplitz systems, in
two contexts: first over finite fields where basic operations have unit cost,
then over Q. We introduce new variants of previous algorithms and describe an
implementation of these techniques and its practical behavior. We pay a special
attention to particular cases such as the computation of algebraic
approximants.
Co-auteurs
Eric Schost
Seung Gyu Hyun
