- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes a framework for learning mesh-free differential operators on unstructured point clouds. The key idea is to use a neural network to predict discretization weights from local stencil geometries while enforcing polynomial consistency through a moment-projection layer. This projection ensures the prescribed formal order of accuracy, while a Fourier-based training objective optimizes dispersion and dissipation properties over selected wavenumber ranges without requiring PDE solution data.
The authors evaluate SpeND on differential approximation tests, viscous Burgers' equation, Poisson's equation with an embedded obstacle, and weakly compressible Navier–Stokes equations. The results demonstrate improved accuracy and computational efficiency compared with classical RBF-FD and LABFM discretizations, with reported wall-clock speedups of approximately 3–20 times at matched accuracy in the tested regimes.
Critical strengths
- combination of exact polynomial consistency and learned spectral optimization.
- demonstrate numerical accuracy and efficiency improvements against established mesh-free methods.
Critical weaknesses
- The necessity and advantage of neural learning over direct constrained spectral optimization are not sufficiently established.
- Stability and robustness on general irregular point clouds remain insufficiently established.
Questions for authors
- compare SpeND against a directly spectrally optimized mesh-free discretization, obtained by minimizing the same Fourier-response objective subject to identical moment constraints.
- Do the reported advantages persist under strongly anisotropic node distributions or more complex boundaries? Can the authors demonstrate whether the learned operators remain stable under long time integration without additional stabilization beyond that used in the classical baselines?
2 comments
[W2/Q2] Anisotropic nodes. We have added a Poisson case with a square obstacle (App. F.2.3, pp. 26-29 highlighted in blue), with isotropic nodes and with boundary refinement where the wall spacing is 2× and 4× smaller than the far-field spacing. This tests two configurations absent from training, which contains only stencils truncated by a single straight wall on isotropic nodes:
-
stencils at the corners, truncated by two walls at a right angle;
-
anisotropic stencils near the refined wall, where node spacing varies across the stencil.
All methods retain second-order convergence. With refinement, each method’s error is similar to its isotropic-node error at the same far-field spacing, and SpeND’s speedups over the baselines remain similar to those for the circular obstacle.
Regarding node disorder. The operators are evaluated on particle-shifted clouds and on lattices perturbed with \epsilon = 0.8 (Burgers), well beyond the disorder typical of mesh-free simulations [1]. Ablations extend this to \epsilon = 1, where neighbouring nodes can coincide, and SpeND retains its convergence rate (App. I, Fig. 24, p. 37). The distributions which we have tested, such as disturbed cartesian nodes and particle shifting are standard bench marks for mesh-free discretisation frameworks [1], [2].
For more complex geometries, the limiting factor is the reference solution rather than the method. Our evaluation relies on analytical or manufactured references, so that errors and convergence rates can be measured precisely. In complex geometries or flows no pointwise reference exists, different schemes can agree in their statistics while differing in the instantaneous flow, so neither the error nor the convergence rate can be quantified. The square obstacle extends the tested boundaries as far as a manufactured solution allows, with sharp corners and refinement. Moreover, the main difficulty for a mesh-free discretisation is the irregularity of the node set rather than the shape of the domain, and all our experiments already use fully unstructured nodes. Applications to more realistic geometries and flows are a natural next step, and beyond the scope of the work, and which we now note as future work in the Conclusion (p. 10, highlighted in blue). See also our response to Reviewer FcLX [W1].
Long rollout stability. The learned operators do not use any stabilisation beyond that used in the classical baselines. SpeND is learned discretisation, implemented in a classical framework. The long-time global stability is determined entirely by the eigenspectrum: see the global eigenspectrum analysis in Appendix D, which compares the methods on the same node sets. The stability of SpeND is comparable to RBF-FDs and LABFM. In the Burgers test case (Sec. 4.2, when p = 2), no method uses stabilisation, and the physical viscosity is sufficient for SpeND and LABFM. In the Navier–Stokes cases (p = 4) (Sec 4.4, App F.3, App F.4), all methods use the same hyperviscous filter, with the same damping, applied in the same way, and the same time integrator. With the addition of dealiasing via a hyperviscous filter (note, dealiasing is essential for any high-order collocated method solving the Navier-Stokes equations), all exhibit stable long-time behaviour. No additional damping is added. To test long-time behaviour in a demanding setting, we have added a three-dimensional Taylor–Green vortex at Re = 1600, run to t = 20 through transition to turbulence (Appendix F.4). SpeND remains stable throughout, with the same stabilisation as LABFM. We have included this discussion in Appendix D (highlighted in red).
References:
[1] Suchde, P., Jacquemin, T. and Davydov, O., 2023. Point Cloud Generation for Meshfree Methods: An Overview. Archives of Computational Methods in Engineering, 30(2), pp.889–915. Available at: https://doi.org/10.1007/s11831-022-09820-w.
[2] Quinlan, N. J., Basa, M. and Lastiwka, M. Truncation error in mesh-free particle methods. International Journal for Numerical Methods in Engineering, 66(13):2064–2085, 2006. doi: 10.1002/nme.1617
We thank the reviewer for recognising the merits of our paper and for the helpful suggestions. We address each point below; changes are in the revised manuscript.
[W1/Q1]
We thank the reviewer for this suggestion and have added this comparison (in App.G, pages 31-34, highlighted in blue; see also our response to Reviewer zV6j [Q2]). The direct baseline minimises the same Fourier-response objective under identical moment constraints, independently for each stencil. It establishes two advantages of learning:
Cost. In SpeND, the optimisation is performed once, offline, during training. The trained PointNet (one per order and operator, independent of the PDE) then applies without retraining to new node distributions of the type it was trained on, whereas direct optimisation must be repeated for every stencil of every new node distribution. We therefore compare SpeND’s inference time against the full direct optimisation; training cost is reported in Appendix J. Matching SpeND’s loss takes direct optimisation 10–18× longer in float64, 17–20× longer in float32 on CPU, and up to 144× longer in float32 on GPU. Running the optimiser to convergence: it attains a median of 67–100× lower per-stencil loss, at 43–48× the construction time on CPU and 25–28× on GPU, in float64.
Global behaviour. Stencils optimised in isolation assemble into operators with markedly worse spectra (largest real part for derivative approximately 7 vs 0.9; largest imaginary part for Laplacian 3 vs 0.10). In practice, Burgers diverges at every resolution with the direct weights, also with \Delta t reduced, and BiCGSTAB fails to converge for Poisson at the finest resolution. We believe this demonstrates the advantages of SpeND against direct optimisation.