Improved treatments for general boundary conditions in the lattice Boltzmann method for convection-diffusion and heat transfer processes
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In spite of the increasing applications of the lattice Boltzmann method (LBM) in simulating various flow and transport systems in recent years, complex boundary conditions for the convection-diffusion and heat transfer processes in LBM have not been well addressed. In this paper, we propose an improved bounce-back method by using the midpoint concentration value to modify the bounced-back density distribution for LBM simulations of the concentration field. An accurate finite-difference scheme in the normal boundary direction has also been introduced for gradient boundary conditions. Compared with existing boundary methods, our method has a simple algorithm and can easily deal with boundaries with general geometries, motions, and surface conditions (the Dirichlet, Neumann, and mixed conditions). Carefully designed simulations are performed to examine the capacity and accuracy of this proposed boundary method. Simulation results are compared with those from theory and a representative boundary method, and an improved performance is observed. We have also simulated the effect of reference velocity on global accuracy to examine the performance of our model in preserving the fundamental Galilean invariance. These boundary treatments for concentration boundary conditions can be readily applied to other processes such as heat transfer systems.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it