Affiliation:
1. Wrocław University of Science and Technology, Poland
Abstract
This chapter presents the challenges and techniques in the efficient LBM implementations for sparse geometries. The first part contains a review of applications requiring support for sparse geometries including industry, geology, and life sciences. For each category, a short description of a geometry characteristic and the typical LBM extensions are provided. The second part describes implementations for single-core and parallel computers. Four main methods allowing for the reduction of memory usage and computational complexity are presented: hierarchical grids, tiles, and two techniques based on the indirect addressing (the fluid index array and the connectivity matrix). For parallel implementations, the advantages and disadvantages of the different methods of domain decomposition and workload balancing are discussed.