MétaCan
Menu
Back to cohort
Record W4414654105 · doi:10.14293/pr2199.002014.v1

Neural Networks and Existence Theory for the Navier-Stokes Equations

2025· preprint· en· W4414654105 on OpenAlexaff
Terry Moschandreou

Bibliographic record

Venuenot available
Typepreprint
Languageen
FieldPhysics and Astronomy
TopicModel Reduction and Neural Networks
Canadian institutionsWestern University
Fundersnot available
KeywordsSmoothnessNonlinear systemCompressibilityArtificial neural networkQuadratic equationAlgebraic numberVector field

Abstract

fetched live from OpenAlex

The study of fluid dynamics occupies a central role in applied mathematics and physics, withthe Navier-Stokes equations (NSE) modeling incompressible viscous flows. Despite theirsimple appearance, three-dimensional incompressible NSE are challenging both analyticallyand numerically. Classical methods include finite difference, finite volume, and spectralmethods. Recently, neural networks have emerged as a flexible framework for approximatingcomplex functional relationships. Physics-informed neural networks (PINNs) incorporate thegoverning PDEs directly into the loss function, allowing accurate approximations of velocityand pressure fields while leveraging physics to improve generalization. In this bookthe 2PCF and 3PCF are considered. The analysis of the Navier–Stokes equations and their derived forms is often complicatedby the potential lack of smoothness of solutions. In particular, when the velocity field uloses regularity for instance, if it develops only H¨older continuity of low order or singularstructures the nonlinear convective term(u · ∇)a in associated PDEs may become unbounded or even ill-defined. This fundamental obstruc-tion highlights the difficulty of reconciling the nonlinear transport structure of fluid equationswith weak solution concepts. A central question therefore arises: under what conditions cansuch convective terms be consistently defined, and what approximations or closures are avail-able when smoothness is absent?One proposed remedy is the introduction of algebraic closures, which replace the originalvelocity field by a composite field built from quadratic products of its components. Theprototypical example is the closureu = b = (uyuz ) i + (uxuz ) j + (uxuy) k,which enforces algebraic dependencies among the velocity components. This relation dras-tically reduces the effective degrees of freedom of the velocity vector: only two componentsremain independent, while the third is reconstructed via nonlinear constraints. In this way,the closure projects the dynamics onto a nonlinear surface in R3, thereby regularizing orconstraining certain convective interactions. In the framework of Cannone and Karch, the forcing terms can be modeled as elements in singular spaces (e.g., Besov-type or critical Morreyspaces), and the existence of solutions depends on delicate balance conditions between thesingularity of the forcing and the integrability/smoothness of the velocity field.If the velocity field is H¨older continuous with blowup in first or second derivatives, then:- The Laplacian ∇2 b and nonlinear term b · ∇b may become singular. - However, the closureremains valid in the weak or distributional sense as long as the products are in L1_loc or canbe interpreted via compensated compactness. The closure model u = b is universal under the assumption of locally H¨oldercontinuous velocity components ui provided: - The singularities are such that the nonlinearterms and derivatives remain in suitable weak function spaces. - The forcing terms can bematched to these singular behaviors, as in the theory of Cannone and Karch (2022).

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 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.000
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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.983
Threshold uncertainty score0.523

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
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.036
GPT teacher head0.301
Teacher spread0.265 · 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 teacher head, 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
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicModel Reduction and Neural NetworksFrench-language works237,207