MétaCan
Menu
Back to cohort
Record W2996917989 · doi:10.2514/6.2020-0806

Fine-grain Parallel Smoothing by Asynchronous Iterations and Incomplete Sparse Approximate Inverses for Computational Fluid Dynamics

2020· article· en· W2996917989 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

VenueAIAA Scitech 2020 Forum · 2020
Typearticle
Languageen
FieldEngineering
TopicComputational Fluid Dynamics and Aerodynamics
Canadian institutionsMcGill University
Fundersnot available
KeywordsComputer scienceAsynchronous communicationBenchmark (surveying)Parallel computingBlock (permutation group theory)Multigrid methodAerodynamicsSparse matrixSparse approximationSolverXeonComputational scienceIterated functionAlgorithmApplied mathematicsMathematical optimizationMathematicsPartial differential equationGaussian

Abstract

fetched live from OpenAlex

We demonstrate the use of fine-grain parallel iterations in multigrid smoothers for computational fluid dynamics. Asynchronous iterations, incomplete sparse approximate inverses and their combinations are proposed and their effectiveness studied for a few benchmark cases of external aerodynamics. Our implementations of these solvers have focused on exploiting the wide vector units and the large number of cores on the Xeon Phi Knights Landing processors. The new smoothers have been tested on some benchmark aerodynamics cases. Two of the proposed solvers, block symmetric Gauss-Seidel and asynchronous block incomplete LU factorization, both with incomplete sparse approximate inverse application, have been found to be promising.

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 categoriesMeta-epidemiology (narrow)
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.867
Threshold uncertainty score1.000

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.206
Teacher spread0.198 · 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