Neural Networks and Existence Theory for the Navier-Stokes Equations
Notice bibliographique
Résumé
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).
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,000 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».