MétaCan
Menu
Back to cohort
Record W4406549712 · doi:10.1115/1.4067686

Adjoint Error Correction on Unstructured Finite Volume Solvers

2024· article· en· W4406549712 on OpenAlexaff
Akhil Jayasankar, Carl Ollivier‐Gooch

Bibliographic record

VenueJournal of Verification Validation and Uncertainty Quantification · 2024
Typearticle
Languageen
FieldComputer Science
TopicMatrix Theory and Algorithms
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsFinite volume methodVolume (thermodynamics)Computer scienceUnstructured dataApplied mathematicsMathematicsMechanicsData miningPhysicsThermodynamics

Abstract

fetched live from OpenAlex

Abstract One of the major applications of the adjoint method is the improvement in the order of accuracy of integral quantities obtained from CFD simulations. Although the theory requires the use of a smooth interpolation of the solution, this has seldom been used with unstructured finite volume solvers. In this paper, the adjoint based correction is applied to output functionals obtained using finite volume method on unstructured meshes. A smoothing spline based on a C1 continuous representation of the discrete solution is employed to reduce the random noise in the solution and to improve the rate of convergence of the derivatives. Tests performed on randomly perturbed meshes in 1-D showed fourth-order convergence of output functionals obtained from second-order solution, corrected using the truncation error obtained using the smoothing spline and second-order accurate adjoint solution. The extension of this method to 2-D problems showed superconvergence for output functionals and improvements over existing results.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.007
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.002
Threshold uncertainty score0.009

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.007
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.027
GPT teacher head0.281
Teacher spread0.254 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

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

Quick stats

Citations1
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Verification Validation and Uncertainty QuantificationSame topicMatrix Theory and AlgorithmsFrench-language works237,207