Modeling droplet-laden flows in moisture separators using k-d trees

被引：28
|
作者：
Zhang, Huang [1 ]
Liu, Qianfeng [1 ]
Qin, Benke [1 ]
Bo, Hanliang [1 ]
机构：
[1] Tsinghua Univ, Inst Nucl & New Energy Technol, Key Lab Adv Reactor Engn & Safety, Minist Educ, Beijing 100084, Peoples R China
来源：
ANNALS OF NUCLEAR ENERGY | 2015年 / 75卷
关键词：
Droplet; Separator; Simulation; k-d trees; BEHAVIOR; DRYER; GAS;
D O I：
10.1016/j.anucene.2014.08.036
中图分类号：
TL [原子能技术]; O571 [原子核物理学];
学科分类号：
0827 ; 082701 ;
摘要：
Moisture separators, such as cyclone and swirl-vane separators, are crucial devices that are used for eliminating droplets in flows, and supply dry-saturation steam for turbines. In this paper, droplet-laden flows were simulated in cyclone and swirl-vane separators based on Lagranian-Eulerian approach. With respect to details, the actual droplets are represented by some characteristic droplets, and the carrier phase is described by Reynolds-Averaged Navier-Stokes (RANS) equations. Our solving routine of the model was coupled with the commercial CFD (computational fluid dynamic) softwares, which were used to calculate the fluid properties of the carrier phase and store them on the mesh grids. However, the CFD softwares could hardly export the grids in an explicit data structure. Therefore, we carried out a data structure called k-d trees to rearrange the grids. Firstly, the results show that the executing speed of our new solver using k-d trees is thousands times larger than the old approach. Secondly, we computed the separation efficiencies of cyclone and swirl-vane separators. Thirdly, our modeling outcomes are verified against experimental data. Finally, the moisture distributions of the separators were analyzed. (C) 2014 Elsevier Ltd. All rights reserved.
引用
收藏
页码：452 / 461
页数：10
相关论文
共 50 条
  • [21] On Fusing Recursive Traversals of K-d Trees
    Rajbhandari, Samyam
    Kim, Jinsung
    Krishnamoorthy, Sriram
    Poucheti, Louis-Noel
    Rastello, Fabrice
    Harrison, Robert J.
    Sadayappan, P.
    PROCEEDINGS OF THE 25TH INTERNATIONAL CONFERENCE ON COMPILER CONSTRUCTION (CC 2016), 2016, : 152 - 162
  • [22] PARTIALLY SPECIFIED NEAREST NEIGHBOR SEARCHES USING K-D TREES
    EASTMAN, CM
    ZEMANKOVA, M
    INFORMATION PROCESSING LETTERS, 1982, 15 (02) : 53 - 56
  • [23] K-D Bonsai: ISA-Extensions to Compress K-D Trees for Autonomous Driving Tasks
    Becker, Pedro H. E.
    Arnau, Jose-Maria
    Gonzalez, Antonio
    PROCEEDINGS OF THE 2023 THE 50TH ANNUAL INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE, ISCA 2023, 2023, : 275 - 287
  • [24] Numerical investigation of two-phase ethanol ignition in uniform droplet-laden weakly turbulent flows
    Garzon, Ernesto Sandoval
    Mehl, Cedric
    Colin, Olivier
    De Oliveira, Pedro M.
    Mastorakos, Epaminondas
    COMBUSTION THEORY AND MODELLING, 2024,
  • [25] Using k-d trees for robust 3D point pattern matching
    Li, BH
    Holstein, H
    FOURTH INTERNATIONAL CONFERENCE ON 3-D DIGITAL IMAGING AND MODELING, PROCEEDINGS, 2003, : 95 - 102
  • [26] Collaborative Recommendations using Hierarchical Clustering based on K-d Trees and Quadtrees
    Das, Joydeep
    Majumder, Subhashis
    Gupta, Prosenjit
    Mali, Kalyani
    INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS, 2019, 27 (04) : 637 - 668
  • [27] Analysis of range search for random k-d trees
    Chanzy, P
    Devroye, L
    Zamora-Cura, C
    ACTA INFORMATICA, 2001, 37 (4-5) : 355 - 383
  • [28] Partial match queries in random k-d trees
    Chern, HH
    Hwang, HK
    SIAM JOURNAL ON COMPUTING, 2006, 35 (06) : 1440 - 1466
  • [29] Analysis of range search for random k-d trees
    Philippe Chanzy
    Luc Devroye
    Carlos Zamora-Cura
    Acta Informatica, 2001, 37 : 355 - 383
  • [30] A COUNTER EXAMPLE TO A MONOTONICITY PROPERTY OF K-D TREES
    HOSHI, M
    YUBA, T
    INFORMATION PROCESSING LETTERS, 1982, 15 (04) : 169 - 173
12345