An accurate immersed boundary method using radial-basis functions for incompressible flows
Bibliographic record
Abstract
In this work, we introduce a parallel computational solver based on the sharp-interface immersed boundary method for simulating three-dimensional incompressible flows over stationary and moving boundaries. Despite the robustness and ease of implementation of conventional body-conformal grid methods, they are limited to relatively simple immersed geometries, leading to challenges in grid generation and quality. Our approach employs a multi-dimensional ghost-cell methodology and radial basis functions interpolation/splines to achieve accurate boundary condition and superior efficiency. We utilize unstructured triangular elements for geometric surface discretization and non-uniform Cartesian grids for constructing flow domains around the immersed boundaries. Furthermore, full parallelization using domain decomposition ensures scalability on distributed memory platforms, facilitated through message-passing interface libraries. Additionally, we introduce a flow smoothing strategy to mitigate spurious pressure oscillations near immersed bodies. Through simulations of two- and three-dimensional fluid-structure interaction problems, we demonstrate the effectiveness, accuracy, and efficiency of our computational solver. • An immersed-boundary method is coupled with radial basis functions interpolation. • A smoothing strategy is introduced to mitigate spurious oscillations in pressure. • The full parallelization of the solver through domain decomposition is explained.
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.
How this classification was reachedexpand
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.001 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".