Comparison of the finite volume and lattice Boltzmann methods for solving natural convection heat transfer problems inside cavities and enclosures (Q1724922)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Comparison of the finite volume and lattice Boltzmann methods for solving natural convection heat transfer problems inside cavities and enclosures
scientific article

    Statements

    Comparison of the finite volume and lattice Boltzmann methods for solving natural convection heat transfer problems inside cavities and enclosures (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 February 2019
    0 references
    Summary: Different numerical methods have been implemented to simulate internal natural convection heat transfer and also to identify the most accurate and efficient one. A laterally heated square enclosure, filled with air, was studied. A FORTRAN code based on the lattice Boltzmann method (LBM) was developed for this purpose. The finite difference method was applied to discretize the LBM equations. Furthermore, for comparison purpose, the commercially available CFD package FLUENT, which uses finite volume Method (FVM), was also used to simulate the same problem. Different discretization schemes, being the first order upwind, second order upwind, power law, and QUICK, were used with the finite volume solver where the SIMPLE and SIMPLEC algorithms linked the velocity-pressure terms. The results were also compared with existing experimental and numerical data. It was observed that the finite volume method requires less CPU usage time and yields more accurate results compared to the LBM. It has been noted that the 1st order upwind/SIMPLEC combination converges comparatively quickly with a very high accuracy especially at the boundaries. Interestingly, all variants of FVM discretization/pressure-velocity linking methods lead to almost the same number of iterations to converge but higher-order schemes ask for longer iterations.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references