Related papers: Optimal mixing enhancement
Accurate transport algorithms are crucial for computational fluid dynamics and more accurate and efficient schemes are always in development. One dimensional limiting is commonly employed to suppress nonphysical oscillations. However, the…
This work proposes a novel shape optimization framework for geometric inverse problems governed by the advection--diffusion equation, based on the coupled complex boundary method (CCBM). Building on recent developments [Afr22, Rab23, Rab25,…
A method is proposed to estimate the velocity field of an unsteady flow using a limited number of flow measurements. The method is based on a non-linear low-dimensional model of the flow and on expanding the velocity field in terms of…
Optimal-order uniform-in-time $H^1$-norm error estimates are given for semi- and full discretizations of mean curvature flow of surfaces in arbitrarily high codimension. The proposed and studied numerical method is based on a parabolic…
The paper is concerned with an adjoint complement to the Volume-of-Fluid (VoF) method for immiscible two-phase flows, e.g. air and water, which is widely used in marine engineering due to its computational efficiency. The particular…
The performance of particle advection-based flow visualization techniques is complex, since computational work can vary based on many factors, including number of particles, duration, and mesh type. Further, while many approaches have been…
Engineered injection and extraction systems that create chaotic advection are promising procedures for enhancing mixing between two species. Mixing efficiencies vary considerably, so carefully selecting the design parameters, like pumping…
Implicit time-stepping for advection is applied locally in space and time where Courant numbers are large, but standard explicit time-stepping is used for the remaining solution which is typically the majority. This adaptively implicit…
In a wide range of applications it is desirable to optimally control a dynamical system with respect to concurrent, potentially competing goals. This gives rise to a multiobjective optimal control problem where, instead of computing a…
In a series of recent works, Boyd, Diaconis, and their co-authors have introduced a semidefinite programming approach for computing the fastest mixing Markov chain on a graph of allowed transitions, given a target stationary distribution.…
Our goal is to develop a flux limiter of the Flux-Corrected Transport method for a nonconservative convection-diffusion equation. For this, we consider a hybrid difference scheme that is a linear combination of a monotone scheme and a…
Numerical simulation of compressible fluid flows is performed using the Euler equations. They include the scalar advection equation for the density, the vector advection equation for the velocity and a given pressure dependence on the…
We show a deterministic constant-time local algorithm for constructing an approximately maximum flow and minimum fractional cut in multisource-multitarget networks with bounded degrees and bounded edge capacities. Locality means that the…
A fully discrete finite element method, based on a new weak formulation and a new time-stepping scheme, is proposed for the surface diffusion flow of closed curves in the two-dimensional plane. It is proved that the proposed method can…
Generation of graphs is a major challenge for real-world tasks that require understanding the complex nature of their non-Euclidean structures. Although diffusion models have achieved notable success in graph generation recently, they are…
This paper proposes an image-based robot motion planning method using a one-step diffusion model. While the diffusion model allows for high-quality motion generation, its computational cost is too expensive to control a robot in real time.…
A comprehensive scheme for the spatial discretisation of continuity equation, momentum advection and normal and shear stresses at the fluid interfaces is presented for numerically simulating the incompressible two phase flows based on the…
We study an incremental network design problem, where in each time period of the planning horizon an arc can be added to the network and a maximum flow problem is solved, and where the objective is to maximize the cumulative flow over the…
For optimal power flow problems with chance constraints, a particularly effective method is based on a fixed point iteration applied to a sequence of deterministic power flow problems. However, a priori, the convergence of such an approach…
The moment-of-fluid method (MOF) is known as an extension of the volume-of-fluid method with piecewise linear interface construction (VOF-PLIC). In this study, several directional splitting advection algorithms are extended from the…