Back to search

Technical University of Crete (TUC)

Παραλληλοποιήσιμες πολυπλεγματικές τεχνικές σε επιλυτές Navier-Stokes για τη μοντελοποίηση ασυμπίεστων ροών

Abstract

dc:description

The Navier-Stokes equations, that govern the motion of an incompressible or compressible uid, were introduced more than a hundred years ago. Their nonlinearity leads to signicant diculties, sometimes insurmountable, when trying to nd an analytical solution. In order to obtain an exact solution, specic geometries and initial/boundary conditions must be considered. In more complex situations, such as applications in uid structure interaction, low speed aerodynamics, biomechanics etc., the application of numerical methods may providereliablesolutions forthe Navier-Stokesequations. Furthermore, the necessity for a fast high-resolution numerical solver for the incompressible Navier-Stokes equations emerges from real-life simulations, such as ows over hydrofoils, wind-turbine blades, and aircraft wings during takeo and landing. Thus, the objective of this thesis is to develop, explicateanddemonstratetheperformanceofahighlyecientow-solver,whichexploits the computational power of architectures with computing accelerators. In the rst part of this thesis, and after the preliminaries, an elliptic PDE multigrid solver is developed and demonstrated. The solver is capable of handling highly anisotropic 2D Boundary Value Problems (BVPs) and is based on high-order cell-centered Finite Difference Compact schemes and Multigrid techniques. Compact schemes provide a representation of the shorter length scales, when applied to problems with a range of spatial scales, compared to traditional nite dierence approximations. An improvement of the proposed method is the treatment of PDE boundary conditions. Boundary closure formulas for Dirichlet, Neumann, Robin or mixed-type boundary conditions applied to the physical boundary are derived and tested herein for several simulation problems. Moreover, novel multigrid components for cell-centered discretization are being constructed, which could also be generalized to three dimensional problems in a straightforward manner. In particular, the new intergrid operators involve less non-zero entries than common operators in cell-centered grids, preserving at the same time the accuracy of high-order operators. Next, some theoretical convergence results for the multigrid solver using Local Fourier Analysis (LFA)are given in order to improve its multigrid convergence factors. The analysis focuseson both the relaxation method used within the multigrid, as well as in the remaining components of the multigrid method. The proposed multigrid elliptic solver is evaluated on two classical BVPs, so that the fourth-order accuracy of the solver, as well as the boundary treatments, could be validated. The multigrid convergence rates for every acknowledged transfer operator, along with every novel one, are evaluated as to determine the convergence behavior of the corresponding multigrid solver. These results are also compared to the theoretical convergence factors based on the LFA. The concordance of the analytical and numerical results is acceptable. A comparison between the calculated convergence rates to the corresponding values, obtained from the second-order compact scheme, indicates the superiority of the high-order compact scheme. In addition, these convergence rates are as good as the factors one obtains from the vertex-centered case. It is noted, that the cell-centered multigrid numerical analysis is presented for a high-order scheme, opposed to earlier studies. Along with the investigation on the improvement of multigrid techniques for the high-order scheme, iterative methods are also tested for the resulting sparse linear system and compared with the multigrid numerical solver. The comparison results indicate the necessity of a multigrid solver for this kind of problems, as it is proved to be hundreds of times faster than the optimal iterative method when ne discretizations are used. The proposed spatial discretization solver is incorporated in an eective Navier-Stokes solver capable of handling highly anisotropic ow problems. The solver is based on the pressure-velocity coupling and uses fourth-order compact schemes for discretizing each spatial dimension, formulated on a staggered grid arrangement. The temporal discretization is carried out by a fourth-order Runge-Kutta (RK4) method. Incompressibility is enforced at each time step using a global pressure correction method solving a Poisson-type PDE. In this method, the multigrid solver is being used within each stage of the RK4 method to compute the pressure correction. The spatial and temporal fourth-order accuracy of this Navier-Stokes solver are validated for a set of steady and unsteady classical test problems. Further, the performance results indicate that multigrid accelerates the solution procedure more than 10 times, comparing with other solvers in the literature. The numerical study of the sequential Navier-Stokes solver evince that, in cases of grid sizes up to 256×256, the incorporation of the multigrid scheme handles the increasing execution time moderately. However, in case of ner grid sizes, the computational cost becomes intolerable despite the High convergence rates of the Multigrid method. It is noted that the most time-consuming part of the solver is the pressure correction procedure. This time restriction gives motive to redesign and develop an ecient parallel multigrid based Navier-Stokes algorithm, to exploit the benets of modern parallel computer architectureswith accelerators. In order to increase parallelism at each computing phase of the algorithm, the horizontal red-black coloring scheme for grid nodes is chosen. The Block Cyclic Reduction method is also applied for the solution of the arising linear sub-systems, without modifying the multigrid cycling nature in the algorithm. This enables the execution of the entire simulation in the acceleration device, minimizing the communication cost between memory units. In addition, the proposed parallelization exploits the block structure of the coecient matrix, minimizing data storage and increasing again the parallelism. The solver is implemented and examined on three parallel machines with dierent type of accelerator devices. The realization is developed using the OpenACC and OpenMP APIs. The eect of several multigrid components on modern and legacy acceleration architectures is investigated Application’s performance investigation demonstrates that the proposed parallel multigrid solver accomplishes an acceleration of more than ten times over the sequential solver and more than four times over multi-coreCPU-only realizations. In case of highly anisotropic problems, the parallel semi-coarsening multigrid solver is preferred to the full-coarsening one, as the division of labor by the accelerator device provides faster computational rates, in case of non-uniform discretizations. The proposed numerical algorithm can be easily extended for the case of three dimensional ow problems, on curvilinear coordinates, expanding the applicability of the current methodology. Furthermore, the proposed numerical methodology can be applied for solving comparable problems, e.g. Maxwells equations. The design of a parallel algorithm for the utilization of a Heterogeneous Multi-Accelerator architecture using the MPI, OpenMP and OpenACC APIs, is considered to be a promising improvement.

Degree

thesis:*
Grantor dc:publisher
Technical University of Crete (TUC)
Year dc:date
2017

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Mandikas, Vassilios
  • Μάνδικας, Βασίλειος

Subjects

dc:subject × 21

Rights

dc:rights
Statement dc:rights
  • BY
Language dc:language
eng

Identifiers

dc:identifier.*
Identifier
10.12681/eadd/41751

Chain of custody

source
Harvested from
Greek National Archive of PhD Theses
Base URL
phdtheses.ekt.gr/eadd_oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Mandikas, Vassilios; Μάνδικας, Βασίλειος. Παραλληλοποιήσιμες πολυπλεγματικές τεχνικές σε επιλυτές Navier-Stokes για τη μοντελοποίηση ασυμπίεστων ροών. Technical University of Crete (TUC), 2017. http://hdl.handle.net/10442/hedi/41751