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
关键词
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 条
  • [31] THE EFFICIENCY OF USING K-D TREES FOR FINDING NEAREST NEIGHBORS IN DISCRETE SPACE
    MURPHY, OJ
    SELKOW, SM
    INFORMATION PROCESSING LETTERS, 1986, 23 (04) : 215 - 218
  • [32] RANS Modeling of Turbulent Flow and Heat Transfer in a Droplet-Laden Mist Flow through a Ribbed Duct
    Pakhomov, Maksim A.
    Terekhov, Viktor I.
    WATER, 2022, 14 (23)
  • [33] Balanced aspect ratio trees:: Combining the advantages of k-d trees and octrees
    Duncan, CA
    Goodrich, MT
    Kobourov, S
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2001, 38 (01): : 303 - 333
  • [34] Resilient k-d trees: k-means in space revisited
    Gieseke, Fabian
    Moruz, Gabriel
    Vahrenhold, Jan
    FRONTIERS OF COMPUTER SCIENCE, 2012, 6 (02) : 166 - 178
  • [35] Resilient k-d trees: k-means in space revisited
    Fabian Gieseke
    Gabriel Moruz
    Jan Vahrenhold
    Frontiers of Computer Science, 2012, 6 : 166 - 178
  • [36] On the average cost of insertions on random relaxed K-d trees
    Duch, Amalia
    Martinez, Comado
    PROCEEDINGS OF THE NINTH WORKSHOP ON ALGORITHM ENGINEERING AND EXPERIMENTS AND THE FOURTH WORKSHOP ON ANALYTIC ALGORITHMICS AND COMBINATORICS, 2007, : 194 - 200
  • [38] Balanced Aspect Ratio trees:: Combining the advantages of k-d trees and octrees
    Duncan, CA
    Goodrich, MT
    Kobourov, S
    PROCEEDINGS OF THE TENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1999, : 300 - 309
  • [39] K-D trees are better when cut on the longest side
    Dickerson, Matthew
    Duncan, Christian A.
    Goodrich, Michael T.
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2000, 1879 : 179 - 190
  • [40] Fast Search Using k-d Trees with Fine Search for Spectral Data Identification
    Son, Youngjae
    Chen, Tiejun
    Baek, Sung-June
    MATHEMATICS, 2025, 13 (04)