.inria.fr
1 rue Honoré d'Estienne d'Orves
Campus de l'École polytechnique
91120 Palaiseau
France
map
Recent and forthcoming activities
-
20 may 2021new preprint
“Computing the dimension of a real algebraic set”, accepted at ISSAC 2021.
-
9 mar 2021news
I will give a 6-lecture course entitled Computing with integrals in nonlinear algebra. Virtually held at MPI Leipzig, it will be given on zoom.
Schedule:
- Tuesday, March 9, 15-17h (UTC+1)
- Thursday, March 11, 15-17h
- Tuesday, March 16, 15-17h
- Thursday, March 18, 15-17h
- Tuesday, March 23, 15-17h
- Thursday, March 25, 15-17h
-
25 nov 2020new preprint
-
21 oct 2020new preprint
-
25 jun 2020seminar
Calcul symbolique-numérique d’intégrales de volumes, séminaire AriC, LIP, ENS Lyon (online).
-
24 feb 2020seminar
Périodes : calcul numérique et applications, kick off seminar of ANR project “De rerum natura”, Palaiseau.
-
7 oct 2019conference
Numerical periods in effective algebraic geometry, opening conference of the thematic Einstein semester on algebraic geometry, FU Berlin.
-
19 aug 2019conference
Finding one root of a polynomial system (How to improve the complexity?), Complexity of numerical computation, Felipe's Fest, Berlin.
Latest work
Average analysis of structured polynomial system solving
2020
w/ P. Bürgisser and F. Cucker
In “Rigid continuation paths II”, we develop an algorithm to compute an approximate zero of a polynomial system given as a black-box evaluation function. It follows the main lines of the algorithm from Part I but with a probabilistic estimation of the step length for the numerical continuation.
Going a step further, we show that, on average, the algorithm behaves well on a universal family of polynomial system with low evaluation cost. More precisely, we introduce the model of Gaussian random algebraic branching program and show that our algorithm performs $\operatorname{poly}(n, \delta)$ operations on average to solve a random ABP in $n$ variables, of degree $\delta$ and of size $\operatorname{poly}(n, \delta)$.
