The Dean–Kawasaki Equation: Theory, Numerics, and Applications
Abstract
Professor Ana Djurdjevac will talk about; 'The Dean–Kawasaki Equation: Theory, Numerics, and Applications'
The Dean–Kawasaki equation provides a stochastic partial differential equation description of interacting particle systems at the level of empirical densities and has attracted considerable interest in statistical physics, stochastic analysis, and applied modeling. In this work, we study analytical and numerical aspects of the Dean–Kawasaki equation, with a particular focus on well-posedness, structure preservation, and possible discretization strategies. In addition, we extend the framework to the Dean–Kawasaki equation posed on smooth hypersurfaces. We discuss applications of the Dean–Kawasaki framework to particle-based models arising in biological systems and modeling social dynamics.
A Riemannian Approach for PDE-Constrained Shape Optimization Using Outer Metrics
Abstract
Speaker Estefania Loayza Romero will talk about: A Riemannian Approach for PDE-Constrained Shape Optimization Using Outer Metrics
In PDE-constrained shape optimisation, shapes are traditionally viewed as elements of a Riemannian manifold, specifically as embeddings of the unit circle into the plane, modulo reparameterizations. The standard approach employs the Steklov-Poincaré metric to compute gradients for Riemannian optimisation methods. A significant limitation of current methods is the absence of explicit expressions for the geodesic equations associated with this metric. Consequently, algorithms have relied on retractions (often equivalent to the perturbation of identity method in shape optimisation) rather than true geodesic paths. Previous research suggests that incorporating geodesic equations, or better approximations thereof, can substantially enhance algorithmic performance. This talk presents numerical evidence demonstrating that using outer metrics, defined on the space of diffeomorphisms with known geodesic expressions, improves Riemannian gradient-based optimisation by significantly reducing the number of required iterations and preserving mesh quality throughout the optimisation process.
This talk is hosted at RAL.