![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Édouard Oudet
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j22]Chiu-Yen Kao, Braxton Osting
, Édouard Oudet
:
Harmonic Functions on Finitely Connected Tori. SIAM J. Numer. Anal. 61(6): 2795-2812 (2023) - [i5]Beniamin Bogosel, Giuseppe C. Buttazzo, Édouard Oudet:
On the numerical approximation of Blaschke-Santaló diagrams using Centroidal Voronoi Tessellations. CoRR abs/2302.00603 (2023) - [i4]Chiu-Yen Kao, Braxton Osting, Édouard Oudet:
Harmonic functions on finitely-connected tori. CoRR abs/2309.12459 (2023) - 2020
- [j21]Charles Dapogny, Nicolas Lebbe
, Édouard Oudet:
Optimization of the shape of regions supporting boundary conditions. Numerische Mathematik 146(1): 51-104 (2020) - [i3]François Générau, Édouard Oudet, Bozhidar Velichkov:
Numerical computation of the cut locus via a variational approximation of the distance function. CoRR abs/2006.08240 (2020)
2010 – 2019
- 2019
- [j20]Nicolas Lebbe
, Charles Dapogny
, Édouard Oudet, Karim Hassan
, Alain Glière:
Robust shape and topology optimization of nanophotonic devices using the level set method. J. Comput. Phys. 395: 710-746 (2019) - [j19]Giovanni Alberti, Giuseppe M. Buttazzo, Serena Guarino Lo Bianco, Édouard Oudet:
Optimal reinforcing networks for elastic membranes. Networks Heterog. Media 14(3): 589-615 (2019) - 2018
- [j18]François Générau, Édouard Oudet:
Large Volume Minimizers of a Nonlocal Isoperimetric Problem: Theoretical and Numerical Approaches. SIAM J. Math. Anal. 50(3): 3427-3450 (2018) - [j17]Mauro Bonafini, Giandomenico Orlandi, Édouard Oudet:
Variational Approximation of Functionals Defined on 1-dimensional Connected Sets: The Planar Case. SIAM J. Math. Anal. 50(6): 6307-6332 (2018) - 2017
- [j16]Beniamin Bogosel
, Édouard Oudet:
Partitions of Minimal Length on Manifolds. Exp. Math. 26(4): 496-508 (2017) - [j15]Pedro R. S. Antunes, Édouard Oudet:
Numerical Minimization of Dirichlet Laplacian Eigenvalues of Four-Dimensional Geometries. SIAM J. Sci. Comput. 39(3) (2017) - 2016
- [j14]Quentin Mérigot, Édouard Oudet:
Discrete Optimal Transport: Complexity, Geometry and Applications. Discret. Comput. Geom. 55(2): 263-283 (2016) - [j13]Jean-David Benamou, Guillaume Carlier, Quentin Mérigot, Édouard Oudet:
Discretization of functionals involving the Monge-Ampère operator. Numerische Mathematik 134(3): 611-636 (2016) - [j12]Beniamin Bogosel
, Édouard Oudet:
Qualitative and Numerical Analysis of a Spectral Problem with Perimeter Constraint. SIAM J. Control. Optim. 54(1): 317-340 (2016) - 2015
- [j11]Elie Bretin, Simon Masnou, Édouard Oudet:
Phase-field approximations of the Willmore functional and flow. Numerische Mathematik 131(1): 115-171 (2015) - 2014
- [j10]Nicolas Papadakis, Gabriel Peyré
, Édouard Oudet:
Optimal Transport with Proximal Splitting. SIAM J. Imaging Sci. 7(1): 212-238 (2014) - [j9]Quentin Mérigot, Édouard Oudet:
Handling Convexity-Like Constraints in Variational Problems. SIAM J. Numer. Anal. 52(5): 2466-2487 (2014) - [j8]Braxton Osting, Chris D. White, Édouard Oudet:
Minimal Dirichlet Energy Partitions for Graphs. SIAM J. Sci. Comput. 36(4) (2014) - [i2]Jean-David Benamou, Guillaume Carlier, Quentin Mérigot, Édouard Oudet:
Discretization of functionals involving the Monge-Ampère operator. CoRR abs/1408.4536 (2014) - 2013
- [j7]Édouard Oudet:
Shape Optimization Under Width Constraint. Discret. Comput. Geom. 49(2): 411-428 (2013) - [i1]Braxton Osting, Chris D. White, Édouard Oudet:
Minimal Dirichlet energy partitions for graphs. CoRR abs/1308.4915 (2013) - 2011
- [j6]Édouard Oudet:
Approximation of Partitions of Least Perimeter by Γ-Convergence: Around Kelvin's Conjecture. Exp. Math. 20(3): 260-270 (2011) - [j5]Elie Bretin, Jacques-Olivier Lachaud, Édouard Oudet:
Regularization of Discrete Contour by Willmore Energy. J. Math. Imaging Vis. 40(2): 214-229 (2011)
2000 – 2009
- 2009
- [j4]Giorgio C. Buttazzo, Chloé Jimenez, Édouard Oudet:
An Optimization Problem for Mass Transportation with Congested Dynamics. SIAM J. Control. Optim. 48(3): 1961-1976 (2009) - [j3]Blaise Bourdin
, Dorin Bucur, Édouard Oudet:
Optimal Partitions for Eigenvalues. SIAM J. Sci. Comput. 31(6): 4100-4114 (2009) - 2005
- [j2]Thomas Lachand-Robert, Édouard Oudet:
Minimizing within Convex Bodies Using a Convex Hull Method. SIAM J. Optim. 16(2): 368-379 (2005) - 2004
- [j1]Eric Sonnendrücker, Francis Filbet
, Alex Friedman
, Édouard Oudet, Jean-Luc Vay:
Vlasov simulations of beams with a moving grid. Comput. Phys. Commun. 164(1-3): 390-395 (2004)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint