A combinatorial algorithm for the Euler equations of incompressible flows

DOI10.1016/0045-7825(89)90033-9zbMath0687.76016OpenAlexW1995116215MaRDI QIDQ1263396

Yann Brenier

Publication date: 1989

Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0045-7825(89)90033-9

zbMATH Keywords

Euler equationsinviscid incompressible flowsLagrangian time discretizationleast square projectionmanifold of volume preserving diffeomorphismsvolume-preserving mapping

Mathematics Subject Classification ID

Navier-Stokes equations (35Q30) Incompressible inviscid fluids (76B99) Basic methods in fluid mechanics (76M99)

Related Items (8)

Well-posedness and regularity for a polyconvex energy ⋮ A fast approach to optimal transport: the back-and-forth method ⋮ An entropic interpolation problem for incompressible viscous fluids ⋮ A Lagrangian scheme à la Brenier for the incompressible Euler equations ⋮ The Monge-Ampère-Kantorovich approach to reconstruction in cosmology ⋮ Optimal Multiphase Transportation with prescribed momentum ⋮ Discretization of Euler's equations using optimal transport: Cauchy and boundary value problems ⋮ Various formulations and approximations of incompressible fluid motions in porous media

Cites Work

• Unnamed Item
• Unnamed Item
• A competitive (dual) simplex method for the assignment problem
• Numerical Solution of the Navier-Stokes Equations
• Approximation of measure preserving transformations

This page was built for publication: A combinatorial algorithm for the Euler equations of incompressible flows