Finite Volume adaptive mesh refinement based on graph applied to the Boundary Layer Problem

Univ. Fed. de Lavras (UFLA), Belo Horizonte, Brazil
IEEE Latin America Transactions (Impact Factor: 0.22). 04/2011; DOI: 10.1109/TLA.2011.5876428
Source: IEEE Xplore

ABSTRACT In physics and fluid mechanics, the boundary layer is the fluid layer in the immediate vicinity of a bounding surface. It is important in many aerodynamic problems. This work presents a numerical simulation of the two-dimensional laminar boundary-layer problem considering a steady incompressible flow with no-slip condition on the surface. The adaptive mesh refinement is performed by Autonomous Leaves Graph in the Finite Volume solution. A modified Hilbert curve algorithm is used to connect and provide the ordering of the graph nodes. Initially, the numerical solution for the flat plate problem is compared to its analytical solution, namely Blasius solution. Next, simulations of the flux around a NACA airfoil shape are presented. Computer experiments show that an adaptive mesh refinement using Autonomous Leaves Graph with the modified Hilbert curve ordering is appropriate for an aerodynamic problem. Finally, results illustrate that the method provides a good trade-off between speed and accuracy.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A graph-based implementation of quadtree meshes for dealing with adaptive mesh refinement (AMR) in the numerical solution of evolutionary partial differential equations is discussed using finite volume methods. The technique displays a plug-in feature that allows replacement of a group of cells in any region of interest for another one with arbitrary refinement, and with only local changes occurring in the data structure. The data structure is also specially designed to minimize the number of operations needed in the AMR. Implementation of the new scheme allows flexibility in the levels of refinement of adjacent regions. Moreover, storage requirements and computational cost compare competitively with mesh refinement schemes based on hierarchical trees. Low storage is achieved for only the children nodes are stored when a refinement takes place. These nodes become part of a graph structure, thus motivating the denomination autonomous leaves graph (ALG) for the new scheme. Neighbors can then be reached without accessing their parent nodes. Additionally, linear-system solvers based on the minimization of functionals can be easily employed. ALG was not conceived with any particular problem or geometry in mind and can thus be applied to the study of several phenomena. Some test problems are used to illustrate the effectiveness of the technique.
    Journal of Computational and Applied Mathematics 01/2006; 196(1):115-131. · 0.99 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Computational solutions are presented for flows ranging from incompressible viscous flows to inviscid transonic flows. The viscous flow problems are solved using the incompressible Navier-Stokes equations while the inviscid solutions are attained using the full potential equation. Results for the viscous flow problems focus on turbulence modeling when separation is present. The main focus for the inviscid results is the development of an unstructured solution algorithm. The subject dealing with turbulence modeling for separated flows is discussed first. Two different test cases are presented. The first flow is a low-speed converging-diverging duct with a rapid expansion, creating a large separated flow region. The second case is the flow around a stationary hydrofoil subject to small, oscillating hydrofoils. Both cases are computed first in a steady state environment, and then with unsteady flow conditions imposed. A special characteristic of the two problems being studied is the presence of strong adverse pressure gradients leading to flow detachment and separation. For the flows with separation, numerical solutions are obtained by solving the incompressible Navier-Stokes equations. These equations are solved in a time accurate manner using the method of artificial compressibility. The algorithm used is a finite volume, upwind differencing scheme based on flux-difference splitting of the convective terms. The Johnson and King turbulence model is employed for modeling the turbulent flow. Modifications to the Johnson and King turbulence model are also suggested. These changes to the model focus mainly on the normal stress production of energy and the strong adverse pressure gradient associated with separating flows. The performance of the Johnson and King model and its modifications, along with the Baldwin-Lomax model, are presented in the results. The modifications had an impact on moving the flow detachment location further downstream, and increased the sensitivity of the boundary layer profile to unsteady flow conditions. Following this discussion is the numerical solution of the full potential equation. The full potential equation assumes inviscid, irrotational flow and can be applied to problems where viscous effects are small compared to the inviscid flow field and weak normal shocks. The development of a code is presented which solves the full potential equation in a finite volume, cell centered formulation. The unique feature about this code is that solutions are attained on unstructured grids. Solutions are computed in either two or three dimensions. The grid has the flexibility of being made up of tetrahedra, hexahedra, or prisms. The flow regime spans from low subsonic speeds up to transonic flows. For transonic problems, the density is upwinded using a density biasing technique. If lift is being produced, the Kutta-Joukowski condition is enforced for circulation. An implicit algorithm is employed based upon the Generalized Minimum Residual method. To accelerate convergence, the Generalized Minimum Residual method is preconditioned. These and other problems associated with solving the full potential equation on an unstructured mesh are discussed. Results are presented for subsonic and transonic flows over bumps, airfoils, and wings to demonstrate the unstructured algorithm presented here.

Full-text (2 Sources)

Available from
May 21, 2014