MétaCan
Menu
Back to cohort
Record W2314095842 · doi:10.2514/6.2015-2757

Investigation of Efficient High-Order Implicit Runge-Kutta Methods Based on Generalized Summation-by-Parts Operators

2015· article· en· W2314095842 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

Venue22nd AIAA Computational Fluid Dynamics Conference · 2015
Typearticle
Languageen
FieldMathematics
TopicNumerical methods for differential equations
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsRunge–Kutta methodsDiagonalMathematicsNumerical methods for ordinary differential equationsStability (learning theory)Quadrature (astronomy)Applied mathematicsGaussGauss–Seidel methodNumerical analysisComputer scienceDifferential equationAlgorithmMathematical analysisOrdinary differential equationGeometryIterative methodDifferential algebraic equation

Abstract

fetched live from OpenAlex

This paper summarizes several new developments in the theory of high-order implicit Runge-Kutta (RK) methods based on generalized summation-by-parts (GSBP) operators. The theory is applied to the construction of several known and novel Runge-Kutta schemes. This includes the well-known families of fully-implicit Radau IA/IIA and Lobatto IIIC Runge-Kutta methods. In addition, a novel family of GSBP-RK schemes based on Gauss quadrature rules is presented along with a few optimized diagonally-implicit GSBP-RK schemes. The novel schemes are all L-stable and algebraically stable. The stability and relative efficiency of the schemes is investigated with numerical simulation of the linear convection equation with both time-independent and time-dependent convection velocities. The numerical comparison includes a few popular non-GSBP Runge-Kutta time-marching methods for reference.

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.001
metaresearch head score (Gemma)0.001
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: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.308
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
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.076
GPT teacher head0.363
Teacher spread0.286 · 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