MétaCan
Menu
Back to cohort
Record W1978205588 · doi:10.1002/fld.1189

Discretization and parallel performance of an unstructured finite volume Navier–Stokes solver

2006· article· en· W1978205588 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueInternational Journal for Numerical Methods in Fluids · 2006
Typearticle
Languageen
FieldEngineering
TopicComputational Fluid Dynamics and Aerodynamics
Canadian institutionsWestern University
Fundersnot available
KeywordsDiscretizationSolverComputer scienceParallel computingInterpolation (computer graphics)Computational scienceFinite volume methodUnstructured gridSPMDScalabilityCode (set theory)Navier–Stokes equationsComputational fluid dynamicsApplied mathematicsMathematicsMechanicsMathematical analysisPhysicsMotion (physics)CompressibilityArtificial intelligence

Abstract

fetched live from OpenAlex

Abstract The discretization, parallelization and performance of an implicit, unstructured, time‐dependent Computational Fluid Dynamics code is described. A detailed description is provided of the improvements made on second‐order accurate tools for spatial interpolation and gradient calculation to discretize the Navier–Stokes equations in an unstructured framework. The main goal in the development of the discretization tools was to ensure a scalable and accurate parallel code. The performance of the discretization tools has been validated using standard bench‐mark problems for non‐uniform, non‐orthogonal grids. Parallelization of the code is done within the PETSc framework using a single‐program‐multiple‐data (SPMD) parallelization model. The resulting parallel code is shown to scale linearly within the limit of the available number of processors. Copyright © 2006 John Wiley & Sons, Ltd.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.223
Threshold uncertainty score0.509

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.009
GPT teacher head0.311
Teacher spread0.303 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it