COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Geometric Analysis and Partial Differential Equations seminar > Then initial value problem for the Euler equations of fluids viewed as a convex optimisation problem

## Then initial value problem for the Euler equations of fluids viewed as a convex optimisation problemAdd to your list(s) Download to your calendar using vCal - Yann Brenier, CNRS & Ecole Normale SupĂ©rieure, Paris
- Monday 21 May 2018, 15:00-16:00
- CMS, MR13.
If you have a question about this talk, please contact Ivan Moyano. We consider the initial value problem for the Euler equations of inviscid fluids and, more generally, for “conservation laws with convex entropy”. It is shown that any smooth solution to the initial value problem, at least for short time, can be recovered by solving a suitable convex optimisation problem. This problem, which can be solved for arbitrarily long time intervals, makes bridges between the three theories of optimal transport, mean field game and convex integration. In the elementary case of the “inviscid” Burgers equation, it is shown that every entropy solution, including shocks, can be recovered without any restriction on the time interval. This talk is part of the Geometric Analysis and Partial Differential Equations seminar series. ## This talk is included in these lists:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- CMS, MR13
- DPMMS Lists
- DPMMS Pure Maths Seminar
- DPMMS info aggregator
- DPMMS lists
- Geometric Analysis and Partial Differential Equations seminar
- School of Physical Sciences
Note that ex-directory lists are not shown. |
## Other listsExternal Seminar DAK Group Meetings 2D and 3D Heterogeneous Photonic Integration for Future Information Systems - Professor S. J. Ben Yoo, University of California## Other talksParameter inference, model error and the goals of calibration Making a Crowdsourced Task Attractive: Measuring Workers Pre-task Interactions Low-rank tensor approximation for sampling high dimensional distributions Computer Vision Graphons and Graphexes as Limits of Sparse Graphs: Part II |