AbstractWe study the average complexity of certain numerical algorithms when adapted to solving systems of multivariate polynomial equations whose coefficients belong to some fixed proper real subspace of the space of systems with complex coefficients. A particular motivation is the study of the case of systems of polynomial equations with real coefficients. Along these pages, we accept methods that compute either real or complex solutions of these input systems. This study leads to interesting problems in Integral Geometry: the question of giving estimates on the average of the normalized condition number along great circles that belong to a Schubert subvariety of the Grassmannian of great circles on a sphere. We prove that this average eq...
AbstractWe exhibit sharp upper bounds for the probability distribution of the distance from a system...
AbstractWe prove that the real roots of normal random homogeneous polynomial systems with n+1 variab...
We propose an algorithm for quickly evaluating polynomials. It pre-conditions a complex polynomial $...
International audienceWe study the average complexity of certain numerical algorithms when adapted t...
International audienceHow many operations do we need on the average to compute an approximate root o...
AbstractWe show several estimates on the probability distribution of some data at points in real com...
The condition-based complexity analysis framework is one of the gems of modern numerical algebraic...
We apply average-case complexity theory to physical problems modeled by continuous-time dynamical sy...
AbstractIn this paper we apply for the first time a new method for multivariate equation solving whi...
AbstractThis paper is concerned with exact real solving of well-constrained, bivariate polynomial sy...
AbstractLet f≔(f1,…,fn) be a random polynomial system with fixed n-tuple of supports. Our main resul...
This PhD thesis deals with some particular aspects of the algebraic systems resolution. Firstly, we ...
We propose new Las Vegas randomized algorithms for the solution of a multivariate generic or sparse ...
We present three algorithms in this paper: the first algorithm solves zero-dimensional parametric ho...
International audienceCritical point methods are at the core of the interplay between polynomial opt...
AbstractWe exhibit sharp upper bounds for the probability distribution of the distance from a system...
AbstractWe prove that the real roots of normal random homogeneous polynomial systems with n+1 variab...
We propose an algorithm for quickly evaluating polynomials. It pre-conditions a complex polynomial $...
International audienceWe study the average complexity of certain numerical algorithms when adapted t...
International audienceHow many operations do we need on the average to compute an approximate root o...
AbstractWe show several estimates on the probability distribution of some data at points in real com...
The condition-based complexity analysis framework is one of the gems of modern numerical algebraic...
We apply average-case complexity theory to physical problems modeled by continuous-time dynamical sy...
AbstractIn this paper we apply for the first time a new method for multivariate equation solving whi...
AbstractThis paper is concerned with exact real solving of well-constrained, bivariate polynomial sy...
AbstractLet f≔(f1,…,fn) be a random polynomial system with fixed n-tuple of supports. Our main resul...
This PhD thesis deals with some particular aspects of the algebraic systems resolution. Firstly, we ...
We propose new Las Vegas randomized algorithms for the solution of a multivariate generic or sparse ...
We present three algorithms in this paper: the first algorithm solves zero-dimensional parametric ho...
International audienceCritical point methods are at the core of the interplay between polynomial opt...
AbstractWe exhibit sharp upper bounds for the probability distribution of the distance from a system...
AbstractWe prove that the real roots of normal random homogeneous polynomial systems with n+1 variab...
We propose an algorithm for quickly evaluating polynomials. It pre-conditions a complex polynomial $...