PolSys Seminar
The PolSys seminar hosts talks on algebraic algorithms and applications.
[Next talk] [Upcoming talks] [Past talks] [Directions] [Contact]
Press on the title to see the abstract.
Next Talk
Fast(er) linear algebra on multivariate Hankel matrices
Bernard Mourrain
AROMATH, Inria Sophia Antipolis Mediterranee
Date: 17 Noe 2016, Time: 11:00-12:00, Room: 26-00/101
Hankel operators and matrices occur in many problems, such as sparse interpolation, representation of functions as sums of exponentials, tensor decomposition, quadrature formulae, recurrence relations of sequences, algebraic code decoding... These applications often require to compute kernels of Hankel matrices and eigenvectors of some sub-matrices.

We give some properties of these Hankel matrices in the multivariate case, which are related to their decomposition as sum of Hankel matrices of small rank. We present a fast algorithm to compute the kernel of such matrices, which compares favorably with Berlekamp-Massey-Sakata algorithm used in the decoding of Reed-Solomon codes by syndrome. We describe how to deduce a decomposition of these multivariate Hankel matrices, that accelerate some linear algebra operations. Some examples of applications will illustrate these methods.

Symbolic Determinants support Numerical Methods
Christoph Koutschan
Johann Radon Institute for Computational and Applied Mathematics (RICAM), Linz Austria
Date: 8 Noe 2016, Time: 11:00-12:00, Room: 25-26/105

Some previous talks could be seen here.


View Larger Map

LIP6 - Universite Paris 6, 4 place Jussieu, 75005 Paris - France


You can contact Jean-Charles Faugère or Elias Tsigaridas if you want to give a talk.

If you are interested in receiving email announcements of upcoming talks then join PolSys diffusion list or send us an email.