Related papers: Flow Computations on Imprecise Terrains
State estimation from limited sensor measurements is ubiquitously found as a common challenge in a broad range of fields including mechanics, astronomy, and geophysics. Fluid mechanics is no exception -- state estimation of fluid flows is…
Hydrophobic textured surfaces are studied for their low wettability and their capacity to create a 'slippery' fluid on the surface during lubrication. To this end, the flow between two parallel surfaces is numerically addressed by computing…
Many applications in aerodynamics, particularly in closed-loop control, depend on sensors to estimate the evolving state of the flow. This estimation task is inherently accompanied by uncertainty due to the noisy measurements of sensors or…
The hillslope hydrological processes are very important in watershed hydrology research. In this paper we focus on the water flow over the soil surface with vegetation in a hydrographic basin. We introduce a PDE model based on general…
Two methods for solid body representation in flow simulations available in the Pencil Code are the immersed boundary method and overset grids. These methods are quite different in terms of computational cost, flexibility and numerical…
We consider the problem of finding the value of a maximum flow over time in a network with uniform edge lengths where the edge capacities change at specific time instants. To solve this problem, we show how to construct a condensed version…
We consider flow rounding: finding an integral flow from a fractional flow. Costed flow rounding asks that we find an integral flow with no worse cost. Randomized flow rounding requires we randomly find an integral flow such that the…
The majority of available numerical algorithms for interfacial two-phase flows either treat both fluid phases as incompressible (constant density) or treat both phases as compressible (variable density). This presents a limitation for the…
We consider the statistical inverse problem of estimating a background flow field (e.g., of air or water) from the partial and noisy observation of a passive scalar (e.g., the concentration of a solute), a common experimental approach to…
A machine-learning strategy for investigating the stability of fluid flow problems is proposed herein. The goal is to provide a simple yet robust methodology to find a nonlinear mapping from the parametric space to an indicator representing…
Fractures form the main pathways for flow in the subsurface within low-permeability rock. For this reason, accurately predicting flow and transport in fractured systems is vital for improving the performance of subsurface applications.…
Modeling flow in geosystems with natural fault is a challenging problem due to low permeability of fault compared to its surrounding porous media. One way to predict the behavior of the flow while taking the effects of fault into account is…
What is the best way to divide a rugged landscape? Since ancient times, watersheds separating adjacent water systems that flow, for example, toward different seas, have been used to delimit boundaries. Interestingly, serious and even tense…
In this paper we consider imprecise terrains, that is, triangulated terrains with a vertical error interval in the vertices. In particular, we study the problem of removing as many local extrema (minima and maxima) as possible from the…
In this work, physics-informed neural networks are applied to incompressible two-phase flow problems. We investigate the forward problem, where the governing equations are solved from initial and boundary conditions, as well as the inverse…
In this paper, the general formulation for inextensible flows of curves on oriented surface in $\mathbb{R}^3 $ is investigated. The necessary and sufficient conditions for inextensible curve flow lying an oriented surface are expressed as a…
We consider the problem of finding maximum flows in planar graphs with capacities on both vertices and edges and with multiple sources and sinks. We present three algorithms when the capacities are integers. The first algorithm runs in $O(n…
Lagrangian motions of fluid particles in a general velocity field oscillating in time are studied with the use of the two-timing method. Our aims are: (i) to calculate systematically the most general and practically usable asymptotic…
We introduce a methodology to study the possible matter flows of an ecosystem defined by observational biomass data and realistic biological constraints. The flows belong to a polyhedron in a multi dimensional space making statistical…
We propose to study maximum flow problems for connectome graphs. We suggest a few computational problems: finding vertex pairs with maximal flow, finding new edges which would increase the maximal flow. Initial computation results for some…