IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-540-36183-1_25.html
   My bibliography  Save this book chapter

Investigations of Flow and Species Transport in Packed Beds by Lattice Boltzmann Simulations

In: High Performance Computing in Science and Engineering ’06

Author

Listed:
  • Thomas Zeiser

    (Universität Erlangen-Nürnberg, Regionales Rechenzentrum Erlangen)

Abstract

This report summarizes selected results of investigations of the flow and species transport in packed beds. First of all, the difficulty of segmenting image data with respect to the correct choice of the threshold value and thus the resulting porosity is discussed. Then, the accuracy of lattice Boltzmann flow simulations is compared with CFX-5 simulations. The 3-D flow data is furthermore used to show how the pressure drop is made up by shear forces and dissipation owing to elongation and deformation. For the species transport, a random walk particle tracking algorithm is used to complement the lattice Boltzmann method thus allowing a wide range of Peclet numbers. In the last part, preliminary performance results of a new 1-D list based lattice Boltzmann implementation (“sparse lattice”) are summarized which soon will replace the currently used full array based code. It is shown that outstanding performance on vector as well as cache based parallel computers can be achieved with this 1-D list based “sparse lattice” code, too. Despite sophisticated optimizations for cache based microprocessors, the sustained application performance of a single NEC SX-8 CPU is about 10–20 times higher than that of any commodity CPU. For parallel calculations, this gap even grows further.

Suggested Citation

  • Thomas Zeiser, 2007. "Investigations of Flow and Species Transport in Packed Beds by Lattice Boltzmann Simulations," Springer Books, in: Wolfgang E. Nagel & Willi Jäger & Michael Resch (ed.), High Performance Computing in Science and Engineering ’06, pages 343-354, Springer.
  • Handle: RePEc:spr:sprchp:978-3-540-36183-1_25
    DOI: 10.1007/978-3-540-36183-1_25
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-540-36183-1_25. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.