EOEdouard Oudet

Edouard Oudet

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Edouard Oudet has a total of 51 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    On the numerical approximation of Blaschke–Santaló diagrams using Centroidal Voronoi Tessellations

    by Beniamin Bogosel, Giuseppe Buttazzo, Edouard Oudet

    Blaschke–Santaló diagrams are images of maps defined on a set of parameters, taking values into an Euclidean space. Typically, the dimension of the source space is high, possibly infinite, while the target space is two or three dimensional. These diagrams help characterize geometrically various inequalities and are of particular interest in the field of shape optimization. We propose a numerical method, based on Centroidal Voronoi Tessellations, which produces sample points in the parameter space that have uniformly distributed images in the Blaschle–Santaló diagram, therefore providing an accurate description of the latter. Compared with the classical Monte Carlo methods, which simply use a large number of images corresponding to random parameters, the method proposed is computationally efficient and precise. Simulations for two and three dimensional diagrams are presented involving examples in algebra and shape optimization.


  • Harmonic Functions on Finitely Connected Tori

    by Chiu-Yen Kao, Braxton Osting, Édouard Oudet

    In this paper, we prove a logarithmic conjugation theorem on finitely connected tori. The theorem states that a harmonic function can be written as the real part of a function whose derivative is analytic and a finite sum of terms involving the logarithm of the modulus of a modified Weierstrass sigma function. We implement the method using arbitrary precision and use the result to find approximate solutions to the Laplace problem and the Steklov eigenvalue problem. Using a posteriori estimation, we show that the solution of the Laplace problem on a torus with a few holes has error less than [Formula: see text] using a few hundred degrees of freedom and the Steklov eigenvalues have similar error.


  • Open Access

    Harmonic functions on finitely-connected tori

    by Chiu-Yen Kao, Braxton Osting, Édouard Oudet

    In this paper, we prove a Logarithmic Conjugation Theorem on finitely-connected tori. The theorem states that a harmonic function can be written as the real part of a function whose derivative is analytic and a finite sum of terms involving the logarithm of the modulus of a modified Weierstrass sigma function. We implement the method using arbitrary precision and use the result to find approximate solutions to the Laplace problem and Steklov eigenvalue problem. Using a posteriori estimation, we show that the solution of the Laplace problem on a torus with a few circular holes has error less than $10^{-100}$ using a few hundred degrees of freedom and the Steklov eigenvalues have similar error.

  • Open Access

    The Fixed Landscape Inference MethOd (flimo): a versatile alternative to Approximate Bayesian Computation, faster by several orders of magnitude

    by Sylvain Moinard, Edouard Oudet, Didier Piau, Eric Coissac, Christelle Gonindard-Melodelima

    Modelling in biology must adapt to increasingly complex and massive data. The efficiency of the inference algorithms used to estimate model parameters is therefore questioned. Many of these are based on stochastic optimization processes that require significant computing time. We introduce the Fixed Landscape Inference MethOd (flimo), a new likelihood-free inference method for continuous state-space stochastic models. It applies deterministic gradient-based optimization algorithms to obtain a point estimate of the parameters, minimizing the difference between the data and some simulations according to some prescribed summary statistics. In this sense, it is analogous to Approximate Bayesian Computation (ABC). Like ABC, it can also provide an approximation of the distribution of the parameters. Three applications are proposed: a usual theoretical example, namely the inference of the parameters of g-and-k distributions; a population genetics problem, not so simple as it seems, namely the inference of a selective value from time series in a Wright-Fisher model; and simulations from a Ricker model, representing chaotic population dynamics. In the two first applications, the results show a drastic reduction of the computational time needed for the inference phase compared to the other methods, despite an equivalent accuracy. Even when likelihood-based methods are applicable, the simplicity and efficiency of flimo make it a compelling alternative. Implementations in Julia and in R are available on https://metabarcoding.org/flimo. To run flimo, the user must simply be able to simulate data according to the chosen model.


  • Maximization of Neumann Eigenvalues

    by Dorin Bucur, Eloi Martinet, Edouard Oudet


  • Open Access

    On the numerical approximation of Blaschke-Santaló diagrams using Centroidal Voronoi Tessellations

    by Beniamin Bogosel, Giuseppe Buttazzo, Edouard Oudet

    Identifying Blaschke-Santal\'o diagrams is an important topic that essentially consists in determining the image $Y=F(X)$ of a map $F:X\to{\mathbb{R}}^d$, where the dimension of the source space $X$ is much larger than the one of the target space. In some cases, that occur for instance in shape optimization problems, $X$ can even be a subset of an infinite-dimensional space. The usual Monte Carlo method, consisting in randomly choosing a number $N$ of points $x_1,\dots,x_N$ in $X$ and plotting them in the target space ${\mathbb{R}}^d$, produces in many cases areas in $Y$ of very high and very low concentration leading to a rather rough numerical identification of the image set. On the contrary, our goal is to choose the points $x_i$ in an appropriate way that produces a uniform distribution in the target space. In this way we may obtain a good representation of the image set $Y$ by a relatively small number $N$ of samples which is very useful when the dimension of the source space $X$ is large (or even infinite) and the evaluation of $F(x_i)$ is costly. Our method consists in a suitable use of {\it Centroidal Voronoi Tessellations} which provides efficient numerical results. Simulations for two and three dimensional examples are shown in the paper.

  • Open Access

    Cut Locus on Compact Manifolds and Uniform Semiconcavity Estimates for a Variational Inequality

    by François Générau, Édouard Oudet, Bozhidar Velichkov

    We study a family of gradient obstacle problems on a compact Riemannian manifold. We prove that the solutions of these free boundary problems are uniformly semiconcave and, as a consequence, we obtain some fine convergence results for the solutions and their free boundaries. More precisely, we show that the elastic and the $$\lambda $$ λ -elastic sets of the solutions Hausdorff converge to the cut locus and the $$\lambda $$ λ -cut locus of the manifold.


  • Optimal dense and random addressing design of emissive points in a retinal projection device

    by Fabian Rainouard, Matthias Colard, Olivier Haeberlé, Edouard Oudet, Christophe Martinez

    One of the big challenges of Augmented Reality (AR) is to create ergonomic smart glasses. Our laboratory proposes an unconventional concept of AR glasses based on self-focusing of multiple beams into the eye. The device comprises a dense electrode network that allows extracting light from a dense waveguide network at the intersections points. Each beam emitted at these points is reflected by a holographic element that directs light towards the eye with a proper angular direction. The image pixels are created on the retina by the interferences of various beam distributions. This paper presents a method to optimize the design of waveguides and electrodes to increase the number of pixels on the final image. Our method considers a first waveguide (resp. electrode) as a curve described by a succession of segments with a unique absolute angle crossing a horizontal (resp. vertical) axe. The other waveguides (resp. electrodes) are created by the translation of the curves so that the minimal distance between two curves is equal to a fixed value. We use the B-Splines mathematical model to approximate the succession of segments. An iterative method adapted to B-Splines allows calculating the intersections between waveguides and electrodes. An Emissive Point Distribution (EPD) is obtained by selecting random groups of waveguides and electrodes. Each EPD forms one pixel onto the retina. The Point Spread Function (PSF) of this EPD characterizes the self-focusing efficiency. We calculate the Signal-to-Noise-Ratio of each EPD to evaluate the quality of the whole self-focusing process and we compare it to the Airy function. Our new mathematical model improves by a factor 3.5 the number of pixels for an equivalent SNR in comparison to the model we previously used.


  • Open Access

    Numerical computation of the cut locus via a variational approximation of the distance function

    by François Générau, Edouard Oudet, Bozhidar Velichkov

    We propose a new method for the numerical computation of the cut locus of a compact submanifold of ℝ3 without boundary. This method is based on a convex variational problem with conic constraints, with proven convergence. We illustrate the versatility of our approach by the approximation of Voronoi cells on embedded surfaces of ℝ3.


  • Open Access

    Longest minimal length partitions

    by Beniamin Bogosel, Edouard Oudet

    This article provides numerical evidence that under volume constraint the ball is the set which maximizes the perimeter of the least-perimeter partition into cells with prescribed areas. We introduce a numerical maximization algorithm which performs multiple optimizations steps at each iteration to approximate minimal partitions. Using these partitions we compute perturbations of the domain which increase the minimal perimeter. The initialization of the optimal partitioning algorithm uses capacity-constrained Voronoi diagrams. A new algorithm is proposed to identify such diagrams, by computing the gradients of areas and perimeters for the Voronoi cells with respect to the Voronoi points.