An efficient edge based data structure for the compressible Reynolds‐averaged Navier–Stokes equations on hybrid unstructured meshes

An efficient edge based data structure has been developed in order to implement an unstructured vertex based finite volume algorithm for the Reynolds‐averaged Navier–Stokes equations on hybrid meshes. In the present approach, the data structure is tailored to meet the requirements of the vertex base...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal for numerical methods in fluids Jg. 94; H. 1; S. 13 - 31
Hauptverfasser: Akkurt, Semih, Sahin, Mehmet
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Bognor Regis Wiley Subscription Services, Inc 01.01.2022
Schlagworte:
Additives
Algorithms
Compressibility
compressible flow
Computation
computational aerodynamics
Computer applications
Data structures
finite volume
Fluid flow
Grid refinement (mathematics)
Libraries
Mathematical analysis
mesh adaptation
Navier-Stokes equations
Numerical analysis
Reynolds averaged Navier-Stokes method
Reynolds averaged Navier–Stokes
Robustness (mathematics)
Solvers
Transonic flow
Turbulence
Turbulent flow
ISSN:0271-2091, 1097-0363
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:An efficient edge based data structure has been developed in order to implement an unstructured vertex based finite volume algorithm for the Reynolds‐averaged Navier–Stokes equations on hybrid meshes. In the present approach, the data structure is tailored to meet the requirements of the vertex based algorithm by considering data access patterns and cache efficiency. The required data are packed and allocated in a way that they are close to each other in the physical memory. Therefore, the proposed data structure increases cache performance and improves computation time. As a result, the explicit flow solver indicates a significant speed up compared to other open‐source solvers in terms of CPU time. A fully implicit version has also been implemented based on the PETSc library in order to improve the robustness of the algorithm. The resulting algebraic equations due to the compressible Navier–Stokes and the one equation Spalart–Allmaras turbulence equations are solved in a monolithic manner using the restricted additive Schwarz preconditioner combined with the FGMRES Krylov subspace algorithm. In order to further improve the computational accuracy, the multiscale metric based anisotropic mesh refinement library PyAMG is used for mesh adaptation. The numerical algorithm is validated for the classical benchmark problems such as the transonic turbulent flow around a supercritical RAE2822 airfoil and DLR‐F6 wing‐body‐nacelle‐pylon configuration. The efficiency of the data structure is demonstrated by achieving up to an order of magnitude speed up in CPU times. An efficient edge based data structure has been developed in order to implement an unstructured vertex based finite volume algorithm for the Reynolds‐averaged Navier–Stokes equations on hybrid meshes. In the present approach, the data structure is tailored to meet the requirements of the vertex based algorithm by considering data access patterns and cache efficiency. Therefore, the proposed data structure is highly efficient and its efficiency is demonstrated by achieving up to an order of magnitude speed up in CPU times.
Bibliographie:Funding information
Computing Centre of the Slovak Academy of Sciences through PRACE, ITMS 26230120002 and 26210120002; Istanbul Technical University ‐ Scientific Research Project (ITU‐BAP), MGA‐2017‐40828; National Center for High Performance Computing of Turkey (UYBHM), 10752009; Scientific and Technical Research Council of Turkey (TUBITAK), TUBITAK ULAKBIM, High Performance and Grid Computing Center.
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0271-2091
1097-0363
DOI:10.1002/fld.5045