Title
Newton and Hensel techniques in scientific computing

Organizers
Marc Moreno Maza
Ontario Research Centre for Computer Algebra
Department of Computer Science Middlesex College
The University of Western Ontario. London, Ontario, Canada N6A 5B7
moreno@orcca.on.ca
http://www.csd.uwo.ca/~moreno

Eric Schost
LIX, Ecole polytechnique, 91128 Palaiseau, France
Eric.Schost@polytechnique.fr
www.stix.polytechnique.fr/~schost

Aim and Scope
We believe that these methods have become of central importance in different areas from numerical to symbolic computations.

We aim at attracting together active researchers from these different areas so that they can share their experience on topics like Newton iteration and Hensel lifting.

List of talks
  • Height estimates for the equiprojectable decomposition
    by Xavier Dahan (Ecole Polytechnique, France)
    abstract

  • Technical issues on lifting and a unified algorithm for factorization of multivariate polynomials
    by Maki Iwami (Univ. Tsukuba, Japan)
    abstract

  • Evaluation Techniques for Polynomial System Solving
    by Gr\'egoire Lecerf (Universit\'e de Versailles, France)
    abstract

  • Improved Dense Multivariate Polynomial Factorization Algorithms
    by Gr\'egoire Lecerf (Universit\'e de Versailles, France)
    abstract

  • Hensel Lifting via Groebner bases
    by Daniel Lichtblau (Wolfram Research, USA)
    abstract

  • Toeplitz and Hankel Meet Hensel and Newton Modulo a Power of Two
    by Victor Pan (The City University of New York, USA)
    abstract

  • An Approach to Singularity from Extended Hensel Construction
    by Tateaki Sasaki, Daiju Inaba, (Univ. Tsukuba, Japan) and Kentaroh Katamati (Iwate Prefectural Univ., Japan)
    abstract

  • Fast algorithms for Newton sums in small characteristic
    by Eric Schost (Ecole Polytechnique, France)
    abstract