MétaCan
Menu
Back to cohort
Record W7132906095

Toward Robust and Efficient High-Order Summation-By-Parts Discretizations for Compressible Viscous Flows on Unstructured Simplicial Meshes

2024· dissertation· W7132906095 on OpenAlexfundno aff
Zelalem Arega Worku

Bibliographic record

VenueTSpace · 2024
Typedissertation
Language
FieldEngineering
TopicAdvanced Numerical Methods in Computational Mathematics
Canadian institutionsnot available
FundersUniversity of TorontoMcGill University
KeywordsDiscretizationPolygon meshRobustness (evolution)Scheme (mathematics)SuperconvergenceComputational fluid dynamicsMorphingKey (lock)Compressibility
DOInot available

Abstract

fetched live from OpenAlex

This thesis presents several advancements that contribute to the development of robust, efficient, and flexible high-order methods for computational fluid dynamics (CFD). The underpinning tool in these advancements is the summation-by-parts (SBP) framework along with simultaneous approximation terms (SATs). The SBP-SAT method enables the construction of provably stable discretizations of the governing equations of fluid dynamics, thereby enhancing the robustness of CFD algorithms. Additionally, the application of this approach on unstructured simplicial meshes facilitates automatic mesh generation, providing flexibility to handle complex geometries. Relative to some of the popular high-order methods, the entropy-stable SBP-SAT scheme on simplicial meshes is computationally expensive. To mitigate this drawback, we have made advancements in three key areas: the development of efficient entropy-stable viscous SATs, the development of alternative entropy-stable formulation, and the construction of novel SBP operators. We establish that the existing viscous SAT framework can be used to construct entropy-stable discretizations of the Navier--Stokes equations, enabling the use of entropy-stable SATs that couple only immediate neighboring elements. Furthermore, the viscous SAT framework is extended to encompass a wider class of SATs, and functional superconvergence is shown for the SATs that satisfy primal and adjoint consistency conditions. Building upon the entropy-split formulation primarily used within the traditional finite-difference framework, we develop an entropy-split entropy-stable discretization for element-type SBP-SAT schemes. The method offers substantial improvements in terms of efficiency compared to the Hadamard-form entropy-stable discretizations based on two-point flux functions. Furthermore, a locally conservative hybrid formulation of the scheme is proposed to mitigate the loss of conservation. Finally, a new matrix-type interface dissipation operator is developed to enable the use of the entropy-split entropy-stable scheme for problems with discontinuities. To further enhance the efficiency of the entropy-stable SBP-SAT method, several novel SBP operators are constructed. Construction of efficient SBP operators necessitate the derivation of high-order quadrature rules with minimal node count. We derived symmetric quadrature rules with positive weights that include boundary nodes as well as those with exclusively interior nodes, extending the available sets of quadrature rules to higher degrees than currently available while also maintaining high level of quadrature efficiency. Finally, we introduced a novel approach to construct SBP operators on simplices with a tensor-product structure. The accuracy and sparsity of these tensor-product split-simplex operators substantially enhance the efficiency of SBP-SAT discretizations on simplicial meshes.

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.004
Version: metacan-v3-hybrid-931329e0061cValidation 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: none
Teacher disagreement score0.002
Threshold uncertainty score0.000

Distilled classifier scores by category (both heads)

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

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.030
GPT teacher head0.346
Teacher spread0.317 · 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 designSimulation or modeling
Domainnot available
GenreEmpirical

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
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueTSpaceSame topicAdvanced Numerical Methods in Computational MathematicsFrench-language works237,207