ILAS2016 — 11–15 July 2016 — KU Leuven, Belgium

20th Conference of the International Linear Algebra Society (ILAS)

20th ILAS Conference

Multivariate Polynomial Computations and Polynomial Systems
Organizers: Bernard Mourrain (Inria); Vanni Noferini (University of Essex); Marc Van Barel (KU Leuven).

Besides the classical topic of solving systems of multivariate polynomials, this mini contains also talks

  • on the inverse problem, i.e., given a set of points find the minimal set of points that vanish on these points;
  • on elimination theory involving arithmetic over the integers;
  • on methods to compute the Bernstein coefficients over a box and a simplex in the context of unconstrained and constrained global polynomial optimization problems over boxes and simplices;
  • on a generalization of Prony's method to decompose a Hankel operator as a sum of rank one Hankel operators in connection to solving multivariate polynomial systems.

    Monday 11/07, 10:30–12:30

    1. Mon 10:30–11:00, Room AV 91.12Overdetermined Polynomial Homotopies, Jan Verschelde (University of Illinois at Chicago).
    2. Mon 11:00–11:30, Room AV 91.12Solving Systems of Polynomial Equations, Simon Telen (KU Leuven).
    3. Mon 11:30–12:00, Room AV 91.12Inverse multivariate polynomial root-finding with the SVD, Kim Batselier (The University of Hong Kong).
    4. Mon 12:00–12:30, Room AV 91.12Multivariate Hankel matrices, roots and sparse decomposition, Bernard Mourrain (Inria).

    Monday 11/07, 16:00–18:00

    1. Mon 16:00–16:30, Room AV 91.12Resultants modulo p, Carlos D'Andrea (Universitat de Barcelona).
    2. Mon 16:30–17:00, Room AV 91.12Efficient matricial methods for the computation of the Bernstein coefficients over a box and a simplex, Jihad Titi (University of Konstanz).