MétaCan
Menu
Back to cohort
Record W4317632843 · doi:10.2514/6.2023-2127

Paired Explicit Runge-Kutta Schemes for Ansys Fluent's Density-Based Solver

2023· article· en· W4317632843 on OpenAlexaff
Siavash Hedayati Nasab, Jean‐Sébastien Cagnone, Brian C. Vermeire

Bibliographic record

VenueAIAA SCITECH 2023 Forum · 2023
Typearticle
Languageen
FieldMathematics
TopicNumerical methods for differential equations
Canadian institutionsConcordia University
Fundersnot available
KeywordsRunge–Kutta methodsSolverFinite volume methodAirfoilComputer scienceBenchmark (surveying)Applied mathematicsLaminar flowCascadeIntegratorTurbulenceTurbineFlow (mathematics)Control theory (sociology)MathematicsMathematical optimizationMechanicsPhysicsDifferential equationMathematical analysisEngineeringGeometryAerospace engineeringBandwidth (computing)

Abstract

fetched live from OpenAlex

View Video Presentation: https://doi.org/10.2514/6.2023-2127.vid Recently, a novel time integrator referred to as Paired Explicit Runge-Kutta (P-ERK) schemes, has been proposed for the solution of locally-stiff systems of equations. This approach allows different Runge-Kutta schemes with different numbers of active stages to be assigned based on local stiffness criteria. In this paper, we develop P-ERK schemes for finite volume methods. Then, we verify that P-ERK schemes obtain their designed order of accuracy using an isentropic vortex case. We then evaluate performance of P-ERK schemes in a finite volume solver with benchmark simulations including laminar flow over a circular cylinder, turbulent flow over an SD7003 airfoil, and turbulent flow over a T106A turbine blade cascade. Results demonstrate that P-ERK schemes can significantly accelerate simulations and achieve speed-up factors in excess of four when compared to a standard explicit temporal scheme, while maintaining accuracy with respect to reference data.

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.001
metaresearch head score (Gemma)0.002
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.060
Threshold uncertainty score0.201

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.000
Scholarly communication0.0010.001
Open science0.0020.001
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0600.012

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.112
GPT teacher head0.382
Teacher spread0.269 · 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

Citations0
Published2023
Admission routes1
Has abstractyes

Explore more

Same venueAIAA SCITECH 2023 ForumSame topicNumerical methods for differential equationsFrench-language works237,207