An Efficient Edge Based Data Structure Implementation for a Vertex Based Finite Volume Method

Akkurt, Semih; Şahin, Mehmet

doi:10.2514/6.2017-3292

Cited by 1 publication

(2 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The present three-dimensional data structure is an extension to the two-dimensional version. 3 Although the data structure is capable of managing arbitrary polyhedrons in three dimensions, it is currently limited to tetrahedra, hexahedra, wedge, and pyramids. The main element of the 3D edge data structure is called facet-edge which is shown in Figure 1A.…”

Section: Data Structurementioning

confidence: 99%

“…Finally, the onext pointer plays a slightly different role in 3D case compared to its 2D version. 3 Using the onext pointer, it is possible to rotate around edges of an element that are outgoing from a single node. In the classical finite volume approach, there are numerous arrays which store different type of data such as coordinates, state variables, and their gradients.…”

Section: Data Structurementioning

confidence: 99%

See 1 more Smart Citation

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

Akkurt

Şahin

2021

Numerical Methods in Fluids

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Data Structurementioning

confidence: 99%

Section: Data Structurementioning

confidence: 99%