An octree-based immersogeometric approach for modeling inertial migration of particles in channels

Xu, Shanqin; Gao, Boshun; Lofquist, Alec; Fernando, Milinda; Hsu, Ming‐Chen; Sundar, Hari; Ganapathysubramanian, Baskar

doi:10.1016/j.compfluid.2020.104764

Cited by 43 publications

(16 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In formula (7), x k is the current position of the particle, v k is the current velocity vector of the particle, pbest k is the optimal solution position currently found by the particle, gbest k is the optimal solution position currently found for the entire (3) Octree algorithm: the octree algorithm is also called a hierarchical tree structure, which is a tree-like data structure that describes a three-dimensional space [9]. e application of octree is mainly concentrated in the fields of computer graphics, computer vision, and image processing.…”

Section: Optimization Methods Of Artificial Bee Colony Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Shortest Path Selection Algorithm for Cold Chain Logistics Transportation Based on Improved Artificial Bee Colony

Liu

2021

Scientific Programming

View full text Add to dashboard Cite

Aiming at the problems of low shortest path selection accuracy, longer response time, and poor selection effect in current cold chain logistics transportation methods, a cold chain logistics transportation shortest path selection algorithm based on improved artificial bee colony is proposed. The improved algorithm is used to initialize the food source, reevaluate the fitness value of the food source, generate a new food source, optimize the objective function and food source evaluation strategy, and get an improved artificial bee colony algorithm. Based on the improved artificial bee colony algorithm, the group adaptive mechanism of particle swarm algorithm is introduced to initialize the position and velocity of each particle randomly. Dynamic detection factor and octree algorithm are adopted to dynamically update the path of modeling environment information. According to the information sharing mechanism between individual particles, the group adaptive behavior control is performed. After the maximum number of cycles, the path planning is completed, the shortest path is output, and the shortest path selection of cold chain logistics transportation is realized. The experimental results show that the shortest path selection effect of the cold chain logistics transportation of the proposed algorithm is better, which can effectively improve the shortest path selection accuracy and reduce the shortest path selection time.

show abstract

Section: Optimization Methods Of Artificial Bee Colony Algorithmmentioning

confidence: 99%

“…In formula (9), area(A) refers to the range where obstacle A is located. If it is an environment with multiple obstacles, A in area(A) refers to the range of all obstacles.…”

Section: Improved Artificial Bee Colony Algorithmmentioning

confidence: 99%

Shortest Path Selection Algorithm for Cold Chain Logistics Transportation Based on Improved Artificial Bee Colony

Liu

2021

Scientific Programming

View full text Add to dashboard Cite

show abstract

“…Integration of cut cells using adaptive integration relies on the recursive subdivision of a cut cell and applying the quadrature rule for each relevant cell at finer levels. So far in the literature, adaptive integration has been widely used in the context of the generalised finite element method [39,40]; the Finite Cell Method (FCM) for solid mechanics [8, 9, 11-13, 35, 38, 44, 46], fluid flow [48] and wave propagation [10]; FEM for level set functions [29]; and fluid-structure interaction [5,21,49]. Because of the way the adaptive integration technique operates, it is expected that this technique requires a significant number of levels of refinement for accurately integrating the cut-cells.…”

Section: Introductionmentioning

confidence: 99%

“…Furthermore, to the best of the authors' knowledge, literature on the effect of inaccuracies in cut-cell integration on the force and displacement values for FSI problems is also lacking. Given the increasing interest in the use of cut-cell based methods for FSI simulations [2,19,21,43,49], it is important to assess the effect of inaccuracies in the integration of cut cells on the numerical results for FSI problems, and to the best of our knowledge, such a study is not yet available. Therefore, this paper aims to address this gap by performing a comprehensive assessment of the adaptive integration of cut cells on the numerical results of FSI problems involving laminar flows.…”

Section: Introductionmentioning

confidence: 99%

A comprehensive assessment of accuracy of adaptive integration of cut cells for laminar fluid-structure interaction problems

Kadapa¹,

Wang²,

Mei³

2021

Preprint

View full text Add to dashboard Cite

Finite element methods based on cut-cells are becoming increasingly popular because of their advantages over formulations based on body-fitted meshes for problems with moving interfaces. In such methods, the cells (or elements) which are cut by the interface between two different domains need to be integrated using special techniques in order to obtain optimal convergence rates and accurate fluxes across the interface. Adaptive integration technique in which the cells are recursively subdivided is one of the popular techniques for the numerical integration of cut-cells due to its advantages over tessellation, particularly for problems involving complex geometries in three dimensions. Although adaptive integration does not impose any limitations on the representation of the geometry of immersed solids as it requires only point location algorithms, it becomes computationally expensive for recovering optimal convergence rates. This paper presents a comprehensive assessment of the adaptive integration of cut-cells for applications in computational fluid dynamics and fluidstructure interaction. We assess the effect of the accuracy of integration of cut cells on convergence rates in velocity and pressure fields, and then on forces and displacements for fluid-structure interaction problems by studying several examples in two and three dimensions. By taking the computational cost and the accuracy of forces and displacements into account, we demonstrate that numerical results of acceptable accuracy for FSI problems involving laminar flows can be obtained with only fewer levels of refinement. In particular, we show that three levels of adaptive refinement are sufficient for obtaining force and displacement values of acceptable accuracy for laminar fluid-structure interaction problems.

show abstract

“…The time evolving geometry of migrating particles, and need to include nonlinear terms, favors numerical methods such as immersed boundary [9,10] or immersed interface [11] that embed moving boundaries within a fixed computational grid on which the Navier-Stokes equations are solved. Relative easy parallelization has boosted the popularity of Lattice-Boltzmann methods (LBM) for approximating the Navier-Stokes equations [12].…”

Section: Introductionmentioning

confidence: 99%

Fast Asymptotic-Numerical Method For Coarse Mesh Particle Simulation In Channels Of Arbitrary Cross Section

Christensen¹,

Chu²,

Anderson³

et al. 2021

Preprint

View full text Add to dashboard Cite

Particles traveling through inertial microfluidic devices migrate to focusing streamlines. We present a numerical method that calculates migration velocities of particles in inertial microfluidic channels of arbitrary cross section by representing particles by singularities. Refinements to asymptotic analysis are given that improve the regularity of the singularity approximation, making finite element approximations of flow and pressure fields more effective. Sample results demonstrate that the method is computationally efficient and able to capture bifurcations in particle focusing positions due to changes in channel shape and Reynolds number.

show abstract

An octree-based immersogeometric approach for modeling inertial migration of particles in channels

Cited by 43 publications

References 42 publications

Shortest Path Selection Algorithm for Cold Chain Logistics Transportation Based on Improved Artificial Bee Colony

Shortest Path Selection Algorithm for Cold Chain Logistics Transportation Based on Improved Artificial Bee Colony

A comprehensive assessment of accuracy of adaptive integration of cut cells for laminar fluid-structure interaction problems

Fast Asymptotic-Numerical Method For Coarse Mesh Particle Simulation In Channels Of Arbitrary Cross Section

Contact Info

Product

Resources

About