MétaCan
Menu
Back to cohort
Record W4299891047 · doi:10.48550/arxiv.1303.5681

A Sharp-Interface Active Penalty Method for the Incompressible\n Navier-Stokes Equations

2013· preprint· en· W4299891047 on OpenAlexfundno aff
David Shirokoff, Jean‐Christophe Nave

Bibliographic record

VenuearXiv (Cornell University) · 2013
Typepreprint
Languageen
FieldEngineering
TopicAdvanced Numerical Methods in Computational Mathematics
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsPenalty methodNavier–Stokes equationsCompressibilityConvergence (economics)Term (time)MathematicsFunction (biology)Applied mathematicsMathematical optimizationMathematical analysisPhysicsMechanics

Abstract

fetched live from OpenAlex

The volume penalty method provides a simple, efficient approach for solving\nthe incompressible Navier-Stokes equations in domains with boundaries or in the\npresence of moving objects. Despite the simplicity, the method is typically\nlimited to first order spatial accuracy. We demonstrate that one may achieve\nhigh order accuracy by introducing an active penalty term. One key difference\nfrom other works is that we use a sharp, unregularized mask function. We\ndiscuss how to construct the active penalty term, and provide numerical\nexamples, in dimensions one and two. We demonstrate second and third order\nconvergence for the heat equation, and second order convergence for the\nNavier-Stokes equations. In addition, we show that modifying the penalty term\ndoes not significantly alter the time step restriction from that of the\nconventional penalty method.\n

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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.003
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0030.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.136
GPT teacher head0.288
Teacher spread0.151 · 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
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
Published2013
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicAdvanced Numerical Methods in Computational MathematicsFrench-language works237,207