- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper introduces NOVA, a neural basis solver designed for moving boundary PDEs, null space transport, rank transition, and state reprojection. By using null-space coordinate parametrization and boundary lifting, NOVA avoids manual tuning for boundary parameters and penalty terms. It demonstrates superior performance and accuracy on moving boundaries without sacrificing field accuracy across eight PDE benchmarks.
Critical strengths
- NOVA combines boundary-compatible coefficients with time marching, allowing the admissible solution space to change as the geometry evolves. This represents a useful extension of fixed-domain null-space methods.
- The benchmarking is thorough across different scenarios and criteria. The paper evaluates 8 different physics problems, comparing useful metrics such as residual sum of squares (RSS) and computation time.
- The authors extensively tune penalty, Baumgarte, and Nitsche treatments, reporting their best-performing configurations. Combined with boundary-count and refresh-interval studies, this helps isolate the effects of boundary enforcement and computational choices.
Critical weaknesses
-
Limited comparison with specialised moving-boundary solvers. Although the Frozen-PINN boundary-treatment comparisons and refresh-interval ablations are useful, the paper does not directly compare NOVA with specialised moving-boundary neural methods, such as Wang and Perdikaris (2021) and Ren et al.’s Stefan PIELM (2025). Including these baselines on a shared Stefan problem—with matched reporting of field error, interface-position error, and computational cost—would better establish NOVA's advantages over existing approaches beyond simply achieving smaller boundary-condition residuals.
-
Multiphysics framing. The main contribution is handling moving boundaries rather than multiphysics. The phrasing could be adjusted to help readers better understand the core framing. For example, line 25 mentions "Across eight multiphysics benchmarks." While I acknowledge that some benchmarks are strong multiphysics cases (e.g., Two-phase Stefan, Spherical Scriven), others are less so in a strict sense for a broader audience (e.g., the Burgers example solves a single PDE on a fixed domain, and the moving cylinder problem is generally not considered multiphysics). Consider refining this wording to be more rigorous.
Questions for authors
Could the authors provide a direct comparison between NOVA and specialized moving-boundary neural methods on a shared benchmark like the Stefan problem? Specifically, how do field errors, interface-position errors, and computational costs compare?
4 comments
Response to Reviewer hQ3p
W2 — Moving and free boundaries
Thank you for this suggestion. We will describe the scope as PDEs with moving and free boundaries and revise the following text.
- Abstract. The opening will read “Moving boundaries and free interfaces pose a major challenge to neural PDE solvers, because the evolving geometry induces time-dependent constraints on the solution representation.” The benchmark sentence will distinguish one fixed-domain problem with time-dependent boundary data, four prescribed moving-domain problems, and three coupled free-boundary problems.
- Terminology and contributions. We will describe the two Navier–Stokes benchmarks as single-phase flows past moving bodies, use “for PDEs on moving domains and with free boundaries” in the contribution statement, and title the evaluation contribution “Evaluation on moving and free boundaries.” Long-time claims will follow the measured accuracy and cost in the horizon study.
- Introduction and conclusion. Multiphysics coupling will remain a motivation and a description of the Scriven cases, where heat transfer, phase change, and modal flow couple through the interface. General descriptions of NOVA will use “moving-boundary” or “free-boundary.”
- Table 1 and experiment overview. We will state the three benchmark groups in the table caption and the opening paragraph of the experiments, making the coverage of prescribed geometry and coupled interface dynamics explicit.
Thank you for the detailed response and the additional Stefan comparisons, which clarify the accuracy and computational tradeoffs. I also appreciate the proposed revisions to the terminology and scope. These responses address my main concerns, and I will maintain my score of 3 (Weak acceptance).
Thank you very much for your time, thoughtful engagement, and positive assessment of our work. We truly appreciate your constructive suggestions.
Response to Reviewer hQ3p
We sincerely appreciate the reviewer's constructive comments and careful assessment.
W1 & Q1 — Stefan comparison and computational cost
We compare NOVA with PINN and PIELM on the same two-phase Stefan benchmark. Field and interface errors are relative L2 errors, and EB is the boundary error.
Ren et al. [2] use MATLAB, and our PIELM reimplementation uses Python.
At the Table 1 time step, NOVA reduces field and interface errors by factors of approximately 35 and 17 compared with the reproduced PINN. Refining NOVA's time step yields approximately second-order convergence in both metrics. At 640 steps, its field error is 5.15e-7, below the PIELM reimplementation's 1.41e-6, and its interface error is 3.40e-7, close to 2.55e-7. At 2560 steps, these errors reach 3.25e-8 and 2.17e-8, with boundary errors near machine precision.
The PIELM reimplementation has lower field and interface errors and a shorter solve time than NOVA at 80 and 320 steps. PIELM fits the solution jointly over the full space–time interval, using PDE constraints at all sampled times. NOVA advances sequentially using the current equations and previous states. This difference helps explain the short-horizon accuracy and cost tradeoff.
Long-horizon cost. We also compare the methods on a periodic Stefan problem with a manufactured solution. As the number of periods increases, the global PIELM configuration uses more features and collocation points. Added memory is the increase in peak process memory from the start of the solve.
NOVA maintains a field error near 7.6e-5–7.8e-5 with approximately linear runtime growth. At eight periods, it is approximately eight times faster and uses approximately one seventy-sixth of the additional memory used by this dense global PIELM configuration.
We will include these comparisons in the revision.
References
[1] Wang, S., & Perdikaris, P. (2021). Deep learning of free boundary and Stefan problems. Journal of Computational Physics, 428, 109914.
[2] Ren, F., Zhuang, P. Z., Chen, X., Yu, H. S., & Yang, H. (2025). Physics-informed extreme learning machine (PIELM) for Stefan problems. Computer Methods in Applied Mechanics and Engineering, 441, 118015.