MétaCan
Menu
Back to cohort
Record W1977737476 · doi:10.1137/130927504

Relaxing the CFL Number of the Discontinuous Galerkin Method

2014· article· en· W1977737476 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

VenueSIAM Journal on Scientific Computing · 2014
Typearticle
Languageen
FieldEngineering
TopicComputational Fluid Dynamics and Aerodynamics
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsSuperconvergenceMathematicsDiscontinuous Galerkin methodCourant–Friedrichs–Lewy conditionConservation lawDiscretizationStencilDissipationNorm (philosophy)Mathematical analysisExponential functionApplied mathematicsFinite element methodPhysicsQuantum mechanics

Abstract

fetched live from OpenAlex

We propose a family of high order methods for the solution of hyperbolic conservation laws which are based on the discontinuous Galerkin (DG) spatial discretization. In the standard DG method, the dispersion and dissipation errors and the spectrum of the semidiscrete scheme are related to the $[\frac{p}{p+1}]$ Padé approximants of $\exp(z)$ and $\exp(-z)$. These Padé approximants are responsible for the superconvergent $\mathcal{O}(h^{2p+2})$ and $\mathcal{O}(h^{2p+1})$ errors in dispersion and dissipation, respectively, and the restriction of the CFL number when increasing the order of approximation, $p$. By modifying the DG method we obtain different rational approximations of the exponential, thereby sacrificing some of the superconvergence of the method, and construct new schemes which allow larger time steps than the original DG method, while having the same order of convergence in the $\mathcal{L}^2$ norm. This is achieved through modifications to the numerical flux. The schemes preserve the attractive properties of the usual DG method, such as the high order accuracy and compact stencil.

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.003
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: Empirical · Consensus signal: Empirical
Teacher disagreement score0.294
Threshold uncertainty score0.465

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0010.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.006
GPT teacher head0.248
Teacher spread0.242 · 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