Discontinuous Galerkin Methods for Partial Differential Equations
Bibliographic record
Abstract
The purpose of this meeting was to bring together researchers in a wide variety of areas working on discontinuous Galerkin (DG) methods for partial differential equations, to investigate and identify problems of current interest and to exchange ideas and viewpoints on the most recent developments of these meth-ods. There were 33 participants, mostly from American and Canadian universities, including students and postdoctoral fellows. The program of the workshop consisted of 28 half-hour talks. 1 Overview of the Field The origins of discontinuous Galerkin methods can be traced back to the seventies where they were introduced as non-standard discretization techniques for the numerical approximation of linear transport equations [1]. A remarkable adavantage of the original DG method is that the approximate solutions can be computed element-by-element when the elements are suitably ordered along the characteristic directions of the transport field. The success of DG methods for linear equations prompted several researchers to try to extend them to non-linear hyperbolic conservation laws. In the early eighties and beginning of the nineties, Cockburn and Shu introduced the Runge-Kutta discontinuous Galerkin (RKDG) methods for scalar conservation laws, see the review article [3] and the references therein. These methods are based on piecewise polynomial space discretizations, combined with total variation diminishing (TVD) explicit time-stepping algorithms. The resulting schemes have several important advantages as compared to, e.g., finite difference methods. The variational structure of DG methods greatly facilitates the handling of complicated geometries and elements of various shapes and types, as well as the treatment of boundary conditions. Moreover, DG mass matrices are block-diagonal and can be inverted at a very low computational cost, giving rise to very efficient time-stepping algorithms. Soon after their introduction, RKDG methods were extended to non-linear hyperbolic systems and to more general convection-diffusions problems. 2
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.004 |
| Insufficient payload (model declined to judge) | 0.004 | 0.002 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".