Edouard Oudet
|
|
|
|
|
| Adresse |
Lama, Université de Savoie |
| |
Campus scientifique |
| |
73376 Le Bourget du lac Cedex |
| Bureau |
101 |
| Téléphone |
+33 (0)4 79 75 87 65 |
| Télécopie |
+33 (0)4 79 75 81 42 |
| Email |
edouard.oudet(a)univ-savoie.fr |
|
-
Illustrations/Slideshow/im5.png
Optimal branched transport problem of the next four slides
-
Illustrations/Slideshow/im22.png
Approximation of the optimal vectorial measure for α = 0.6
-
Illustrations/Slideshow/im6.png
Support of the optimal vectorial measure for α = 0.6
-
Illustrations/Slideshow/im23.png
Approximation of the optimal vectorial measure for α = 0.95
-
Illustrations/Slideshow/im9.png
Support of the optimal vectorial measure for α = 0.95
-
Illustrations/Slideshow/im15.png
Eigenmodes and related tillings
-
Illustrations/Slideshow/im16.png
Best known (singular !) profile for Newton's problem (height = 0.7)
-
Illustrations/Slideshow/im17.png
Best known (singular !) profile for Newton's problem (height = 0.4)
-
Illustrations/Slideshow/im14.png
Periodic Kelvin's problem with 16 cells
-
Illustrations/Slideshow/im12.png
Periodic Kelvin's problem with 19 cells
-
Illustrations/Slideshow/im13.png
Periodic Kelvin's problem with 8 cells
-
Illustrations/Slideshow/im18.png
A local minimizer of the surface among constant width bodies
-
Illustrations/Slideshow/im20.png
Illustration of a raising dimension process for constant width bodies in 3D. Initial 2D shape. See the result on the next slide
-
Illustrations/Slideshow/im21.png
A 3D constant width body obtained by a raising dimension process
-
Illustrations/Slideshow/im0.png
Irrigation problem of the next four slides
-
Illustrations/Slideshow/im1.png
Optimal branched transport for α = 0.6
-
Illustrations/Slideshow/im2.png
Optimal branched transport for α = 0.75
-
Illustrations/Slideshow/im3.png
Optimal branched transport for α = 0.85
-
Illustrations/Slideshow/im4.png
Optimal branched transport for α = 0.95
Illustrations/Slideshow/im10.png
Optimal cutting of an hexagonal prism in 6 pieces
-
Illustrations/Slideshow/im11.png
Optimal cutting of a rhombic dodecahedron in 8 pieces
-
Illustrations/Slideshow/im24.png
Vlasov simulation of beams with a moving grid
-
Illustrations/Slideshow/im25.png
Optimal cutting of a triangle in 32 pieces by Γ-convergence
-
Illustrations/Slideshow/im26.png
Optimal cutting of a disk in 32 pieces by Γ-convergence
-
|
Domaines de recherche
- Minimisation de fonctionnelles géométriques : Ensembles de largeur constante, domaines de Cheeger, problème
d'Alexandrov, de Newton...
- Transport optimal, irrigation optimale
- Méthodes stochastiques et déterministes en optimisation globale (homogénéisation, algorithmes
génétiques, branch and bound algorithms, etc...)
- Optimisation de forme, méthode de lignes de niveaux
- Modes propres du Laplacien
- Analyse non harmonique et stabilisation
- Méthodes semi-lagrangiennes et équations de Vlasov-Maxwell