Volume 24, Issue 5
Scalable Domain Decomposition Algorithms for Simulation of Flows Passing Full Size Wind Turbine

Rongliang Chen, Zhengzheng Yan, Yubo Zhao & Xiao-Chuan Cai

Commun. Comput. Phys., 24 (2018), pp. 1503-1522.

Published online: 2018-06

Preview Full PDF 49 1671
Export citation
  • Abstract

Accurate numerical simulation of fluid flows around wind turbine plays an important role in understanding the performance and also the design of the wind turbine. The computation is challenging because of the large size of the blades, the large computational mesh, the moving geometry, and the high Reynolds number. In this paper, we develop a highly parallel numerical algorithm for the simulation of fluid flows passing three-dimensional full size wind turbine including the rotor, nacelle, and tower with realistic geometry and Reynolds number. The flow in the moving domain is modeled by unsteady incompressible Navier-Stokes equations in the arbitrary Lagrangian-Eulerian form and a non-overlapping sliding-interface method is used to handle the relative motion of the rotor and the tower. A stabilized moving mesh finite element method is introduced to discretize the problem in space, and a fully implicit scheme is used to discretize the temporal variable. A parallel Newton-Krylov method with a new domain decomposition type preconditioner, which combines a non-overlapping method across the rotating interface and an overlapping Schwarz method in the remaining subdomains, is applied to solve the fully coupled nonlinear algebraic system at each time step. To understand the efficiency of the algorithm, we test the algorithm on a supercomputer for the simulation of a realistic 5MW wind turbine. The numerical results show that the newly developed algorithm is scalable with over 8000 processor cores for problems with tens of millions of unknowns.

  • Keywords

Wind turbine aerodynamics, 3D unsteady incompressible flows, domain decomposition method, fully implicit methods, parallel computing, unstructured finite element method.

  • AMS Subject Headings

65F10, 65F08, 68W10, 76D05, 76U05

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{CiCP-24-1503, author = {}, title = {Scalable Domain Decomposition Algorithms for Simulation of Flows Passing Full Size Wind Turbine}, journal = {Communications in Computational Physics}, year = {2018}, volume = {24}, number = {5}, pages = {1503--1522}, abstract = {

Accurate numerical simulation of fluid flows around wind turbine plays an important role in understanding the performance and also the design of the wind turbine. The computation is challenging because of the large size of the blades, the large computational mesh, the moving geometry, and the high Reynolds number. In this paper, we develop a highly parallel numerical algorithm for the simulation of fluid flows passing three-dimensional full size wind turbine including the rotor, nacelle, and tower with realistic geometry and Reynolds number. The flow in the moving domain is modeled by unsteady incompressible Navier-Stokes equations in the arbitrary Lagrangian-Eulerian form and a non-overlapping sliding-interface method is used to handle the relative motion of the rotor and the tower. A stabilized moving mesh finite element method is introduced to discretize the problem in space, and a fully implicit scheme is used to discretize the temporal variable. A parallel Newton-Krylov method with a new domain decomposition type preconditioner, which combines a non-overlapping method across the rotating interface and an overlapping Schwarz method in the remaining subdomains, is applied to solve the fully coupled nonlinear algebraic system at each time step. To understand the efficiency of the algorithm, we test the algorithm on a supercomputer for the simulation of a realistic 5MW wind turbine. The numerical results show that the newly developed algorithm is scalable with over 8000 processor cores for problems with tens of millions of unknowns.

}, issn = {1991-7120}, doi = {https://doi.org/10.4208/cicp.OA-2017-0196}, url = {http://global-sci.org/intro/article_detail/cicp/12487.html} }
TY - JOUR T1 - Scalable Domain Decomposition Algorithms for Simulation of Flows Passing Full Size Wind Turbine JO - Communications in Computational Physics VL - 5 SP - 1503 EP - 1522 PY - 2018 DA - 2018/06 SN - 24 DO - http://dor.org/10.4208/cicp.OA-2017-0196 UR - https://global-sci.org/intro/cicp/12487.html KW - Wind turbine aerodynamics, 3D unsteady incompressible flows, domain decomposition method, fully implicit methods, parallel computing, unstructured finite element method. AB -

Accurate numerical simulation of fluid flows around wind turbine plays an important role in understanding the performance and also the design of the wind turbine. The computation is challenging because of the large size of the blades, the large computational mesh, the moving geometry, and the high Reynolds number. In this paper, we develop a highly parallel numerical algorithm for the simulation of fluid flows passing three-dimensional full size wind turbine including the rotor, nacelle, and tower with realistic geometry and Reynolds number. The flow in the moving domain is modeled by unsteady incompressible Navier-Stokes equations in the arbitrary Lagrangian-Eulerian form and a non-overlapping sliding-interface method is used to handle the relative motion of the rotor and the tower. A stabilized moving mesh finite element method is introduced to discretize the problem in space, and a fully implicit scheme is used to discretize the temporal variable. A parallel Newton-Krylov method with a new domain decomposition type preconditioner, which combines a non-overlapping method across the rotating interface and an overlapping Schwarz method in the remaining subdomains, is applied to solve the fully coupled nonlinear algebraic system at each time step. To understand the efficiency of the algorithm, we test the algorithm on a supercomputer for the simulation of a realistic 5MW wind turbine. The numerical results show that the newly developed algorithm is scalable with over 8000 processor cores for problems with tens of millions of unknowns.

Rongliang Chen, Zhengzheng Yan, Yubo Zhao & Xiao-Chuan Cai. (2020). Scalable Domain Decomposition Algorithms for Simulation of Flows Passing Full Size Wind Turbine. Communications in Computational Physics. 24 (5). 1503-1522. doi:10.4208/cicp.OA-2017-0196
Copy to clipboard
The citation has been copied to your clipboard