Related papers: Optimal mixing enhancement
We propose a distributed algorithm based on Alternating Direction Method of Multipliers (ADMM) to minimize the sum of locally known convex functions using communication over a network. This optimization problem emerges in many applications…
In this paper we provide an algorithm which given any $m$-edge $n$-vertex directed graph with integer capacities at most $U$ computes a maximum $s$-$t$ flow for any vertices $s$ and $t$ in $m^{11/8+o(1)}U^{1/4}$ time with high probability.…
Mainstream flow matching methods typically focus on learning the local velocity field, which inherently requires multiple integration steps during generation. In contrast, Mean Velocity Flow models establish a relationship between the local…
For general connections, the problem of finding network codes and optimizing resources for those codes is intrinsically difficult and little is known about its complexity. Most of the existing solutions rely on very restricted classes of…
We use numerical simulations to examine two-dimensional particle mixtures that strongly phase separate in equilibrium. When the system is externally driven in the presence of quenched disorder, plastic flow occurs in the form of meandering…
One-step generative modeling has emerged as a leading approach to amortize the inference cost of diffusion and flow-matching models. Among distillation-free methods, MeanFlow training is notoriously unstable, with non-decreasing loss and…
Numerical simulation of multi-component flow systems characterized by the simultaneous presence of pressure-velocity coupling and pressure-density coupling dominated regions remains a significant challenge in computational fluid dynamics.…
While flow optimization has been extensively studied in the continuum regime, its extension to rarefied gas flows remains less explored. Here, based on the Boltzmann model equation, an adjoint topology optimization method is employed to…
We formulate a finite-particle method of mass transport that accounts for general mixed boundary conditions. The particle method couples a geometrically-exact treatment of advection; Wasserstein gradient-flow dynamics; and a…
We investigate a family of approximate multi-step proximal point methods, accelerated by implicit linear discretizations of gradient flow. The resulting methods are multi-step proximal point methods, with similar computational cost in each…
Recent work has shown that leveraging learned predictions can improve the running time of algorithms for bipartite matching and similar combinatorial problems. In this work, we build on this idea to improve the performance of the widely…
Microfluidic devices are gaining attention for their small size and ability to handle tiny fluid volumes. Mixing fluids efficiently at this scale, known as micromixing, is crucial. This article builds upon previous research by introducing a…
Most of numerical methods for deterministic simulations of rarefied gas flows use the discrete velocity (or discrete ordinate) approximation. In this approach, the kinetic equation is approximated with a global velocity grid. The grid must…
We consider a class of optimal control problems for measure-valued nonlinear transport equations describing traffic flow problems on networks. The objective isto minimise/maximise macroscopic quantities, such as traffic volume or average…
This paper proposes a convex optimization based distributed algorithm to solve multi-period optimal gas-power flow (OGPF) in coupled energy distribution systems. At the gas distribution system side, the non-convex Weymouth gas flow…
In this paper, we consider the complex flows when all three regimes pre-Darcy, Darcy and post-Darcy may be present in different portions of a same domain. We unify all three flow regimes under mathematics formulation. We describe the flow…
A model for the development of turbulent shear flows, created by non-uniform parallel flows in a confining channel, is used to identify the diffuser shape that maximises pressure recovery when the inflow is non-uniform. Wide diffuser angles…
The mixing in three-dimensional enclosures is investigated numerically using flow in cubical cavity as a geometrically simple model of various natural and engineering flows. The mixing rate is evaluated for up to the value of Reynolds…
In this paper we provide an algorithm which given any $m$-edge $n$-vertex directed graph with integer capacities at most $U$ computes a maximum $s$-$t$ flow for any vertices $s$ and $t$ in $m^{4/3+o(1)}U^{1/3}$ time. This improves upon the…
Ensemble calculations are essential for systems with uncertain data but require substantial increase in computational resources. This increase severely limits ensemble size. To reach beyond current limits, we present a first-order…