Related papers: A detailed introduction to density-based topology …
Fluid data completion is a research problem with high potential benefit for both experimental and computational fluid dynamics. An effective fluid data completion method reduces the required number of sensors in a fluid dynamics experiment,…
Designing the topology of three-dimensional structures is a challenging problem due to its memory and time consumption. In this paper, we present a robust and efficient algorithm for solving large-scale 3D topology optimization problems.…
Real world networks are often subject to severe uncertainties which need to be addressed by any reliable prescriptive model. In the context of the maximum flow problem subject to arc failure, robust models have gained particular attention.…
The present paper deals with the problem of improving the efficiency of large scale turbulent flow simulations. The high-fidelity methods for modelling turbulent flows become available for a wider range of applications thanks to the…
This paper introduces "\texttt{TOPress3D}," a 3D topology optimization MATLAB code for structures subjected to design-dependent pressure loads. With a primary focus on pedagogical objectives, the code provides an easy learning experience,…
A new topology optimization method called the Proportional Topology Optimization (PTO) is presented. As a non-gradient method, PTO is simple to understand, easy to implement, and is also efficient and accurate at the same time. It is…
A substantial number of algorithms exists for the simulation of moving particles suspended in fluids. However, finding the best method to address a particular physical problem is often highly non-trivial and depends on the properties of the…
Computational modeling and simulation of fluid-structure interactions constitute a fundamental cornerstone for advancing aerospace engineering endeavors. This paper addresses the notion and implementation of the immersed boundary method for…
This work analyzes a fully discrete mixed finite element method in a Banach space framework for solving nonstationary coupled fluid flow problems modeled by the Brinkman-Forchheimer equations, with applications to reverse osmosis. The model…
Discrete particle simulations are widely used to study large-scale particulate flows in complex geometries where particle-particle and particle-fluid interactions require an adequate representation but the computational cost has to be kept…
It is well known that there are two integral steps of streaming and collision in the lattice Boltzmann method (LBM). This concept has been changed by the author's recently proposed macroscopic lattice Boltzmann method (MacLAB) to solve the…
We examine the dynamic network flow problem under the assumption that the flow consists of discrete units. The dynamic network flow problem is commonly addressed in the context of developing evacuation plans, where the flow is typically…
Deep learning method has attracted tremendous attention to handle fluid dynamics in recent years. However, the deep learning method requires much data to guarantee the generalization ability and the data of fluid dynamics are deficient.…
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…
A detailed analysis is presented to demonstrate the capabilities of the lattice Boltzmann method. Thorough comparisons with other numerical solutions for the two-dimensional, driven cavity flow show that the lattice Boltzmann method gives…
We present a simple modification of the direct-forcing immersed boundary method (IBM) proposed by Uhlmann [J. Comput. Phys, 2005] in order to enable it to be applied to particulate flows with solid-to-fluid density ratios around unity. The…
In this paper, we generalize the minimum flow decomposition problem (MFD) to incorporate uncertain edge capacities and tackle it from the perspective of robust optimization. In the classical flow decomposition problem, a network flow is…
We present faster approximation algorithms for generalized network flow problems. A generalized flow is one in which the flow out of an edge differs from the flow into the edge by a constant factor. We limit ourselves to the lossy case,…
A systematic study is carried out on a fully resolved fluid-particle model which couples the Lattice Boltzmann Method (LBM) and the Discrete Element Method (DEM) using an immersed moving boundary technique. Similar algorithms have been…
We investigate a family of approximate multi-step proximal point methods, framed as implicit linear discretizations of gradient flow. The resulting methods are multi-step proximal point methods, with similar computational cost in each…