Physics-informed neural networks for solving moving interface flow problems using the level set approach
Bibliographic record
Abstract
This paper advances the use of physics-informed neural networks (PINNs) architectures to address moving interface problems via the level set method. Originally developed for other partial differential equations-based problems, we particularly leverage physics-informed deep learning with residual adaptive networks' (PirateNet) features—including causal training, sequence-to-sequence learning, random weight factorization, and Fourier feature embeddings—and tailor them to handle problems with complex interface dynamics. Numerical experiments validate this framework on benchmark problems such as Zalesak's disk rotation and time-reversed vortex flow. We demonstrate that PINNs can efficiently solve level set problems exhibiting significant interface deformation without the need for upwind numerical stabilization, as generally required by classic discretization methods, or additional mass conservation schemes. However, incorporating an Eikonal regularization term in the loss function with an appropriate weight can further enhance results in specific scenarios. Our results indicate that PINNs with the PirateNet architecture surpass conventional PINNs in accuracy, achieving state-of-the-art error rates of L2=0.14% for Zalesak's disk and L2=0.85% for the time-reversed vortex flow problem, as compared to reference solutions. Additionally, for a complex two-phase flow dam break problem coupling the level set with the Navier–Stokes equations, we propose a geometric reinitialization method embedded within the sequence-to-sequence training scheme to ensure long-term stability and accurate inference of the level set field. The proposed framework has the potential to be broadly applicable to industrial problems that involve moving interfaces, such as free-surface flows in hydraulics and maritime engineering.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.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.
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".