Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • Simulation of Turbulent Flows Using a Finite-Volume Based Lattice Boltzmann Flow Solver

  • Goktan Guzel, Ilteris Koc
  • Journal:
    Communications in Computational Physics / Volume 17 / Issue 1 / January 2015
    Published online by Cambridge University Press:
    28 November 2014, pp. 213-232
    Print publication:
    January 2015

  • In this study, the Lattice Boltzmann Method (LBM) is implemented through a finite-volume approach to perform 2-D, incompressible, and turbulent fluid flow analyses on structured grids. Even though the approach followed in this study necessitates more computational effort compared to the standard LBM (the so called stream and collide scheme), using the finite-volume method, the known limitations of the stream and collide scheme on lattice to be uniform and Courant-Friedrichs-Lewy (CFL) number to be one are removed. Moreover, the curved boundaries in the computational domain are handled more accurately with less effort. These improvements pave the way for the possibility of solving fluid flow problems with the LBM using coarser grids that are refined only where it is necessary and the boundary layers might be resolved better.