Related papers: Natural Gas Flow Solvers using Convex Relaxation
We consider the periodic problem for two-fluid non-isentropic Euler-Maxwell systems in plasmas. By means of suitable choices of symmetrizers and an induction argument on the order of the time-space derivatives of solutions in energy…
This paper investigates parallelization strategies for solving power flow problems in both transmission and unbalanced, three-phase distribution systems by developing a scalable power flow solver, ExaGridPF, which is compatible with…
This paper introduces a novel theoretical framework and a suite of highly efficient, parallelizable algorithms for solving the large-scale multicommodity flow (MCF) feasibility problem. We reframe the classical constraint-satisfaction…
While accurate simulations of dense gas flows far from the equilibrium can be achieved by Direct Simulation adapted to the Enskog equation, the significant computational demand required for collisions appears as a major constraint. In order…
The gas dynamics under gravitational field is usually associated with the multiple scale nature due to large density variation and a wide range of local Knudsen number. It is chal- lenging to construct a reliable numerical algorithm to…
We study a thermodynamically consistent diffuse-interface model that describes the motion of two macroscopically immiscible, incompressible, and viscous Newtonian fluids with unmatched densities. This model is compatible with continuum…
The classic pump scheduling or Optimal Water Flow (OWF) problem for water distribution networks (WDNs) minimizes the cost of power consumption for a given WDN over a fixed time horizon. In its exact form, the OWF is a computationally…
The Navier-Stokes-Cahn-Hilliard (NSCH) system governs the diffuse-interface dynamics of two incompressible and immiscible fluids. We consider a relaxation approximation of the NSCH system that is composed by a system of first-order…
MFC is an open-source tool for solving multi-component, multi-phase, and bubbly compressible flows. It is capable of efficiently solving a wide range of flows, including droplet atomization, shock-bubble interaction, and gas bubble…
Gradient-flow (GF) viewpoints unify and illuminate optimization algorithms, yet most GF analyses focus on unconstrained settings. We develop a geometry-respecting framework for constrained problems by (i) reparameterizing feasible sets with…
Determining the vanishing points (VPs) in a Manhattan world, as a fundamental task in many 3D vision applications, consists of jointly inferring the line-VP association and locating each VP. Existing methods are, however, either sub-optimal…
We employ the principle of minimum pressure gradient to transform problems in unsteady computational fluid dynamics (CFD) into a convex optimization framework subject to linear constraints. This formulation permits solving, for the first…
Melting and solidification processes are often affected by natural convection of the liquid, posing a multi-physics problem involving fluid flow, convective and diffusive heat transfer, and phase-change reactions. Enthalpy methods formulate…
In this paper, we derive a number of interesting properties and extensions of the convex flow problem from the perspective of convex geometry. We show that the sets of allowable flows always can be imbued with a downward closure property,…
For increasingly rarefied flowfields, the Navier-Stokes (NS) equations lose accuracy partially due to the single temperature approximation. To overcome this barrier, a continuum multi-temperature model based on the Bhatnagar-Gross-Krook…
The Maximum Flow Problem with Conflict Constraints is a generalization that adds conflict constraints to a classical optimization problem on networks used to model several real-world applications. In the last few years several approaches,…
In this work, the Navier-Stokes (NS) solver is combined with the Direct simulation Monte Carlo (DSMC) solver in a direct way, under the wave-particle formulation [J. Comput. Phys. 401, 108977 (2020)]. Different from the classical domain…
In light of the increasing coupling between electricity and gas networks, this paper introduces two novel iterative methods for efficiently solving the multiperiod optimal electricity and gas flow (MOEGF) problem. The first is an iterative…
This paper addresses the Graph Matching problem, which consists of finding the best possible alignment between two input graphs, and has many applications in computer vision, network deanonymization and protein alignment. A common approach…
We present a fully-coupled, implicit-in-time framework for solving a thermodynamically-consistent Cahn-Hilliard Navier-Stokes system that models two-phase flows. In this work, we extend the block iterative method presented in Khanwale et…