Skip to content

Learning Spectral-Like Mesh-Free Discretisations

Sep 2026 · 0 citations · 11 references
Physics Computer Science

Abstract

Meshfree methods such as smoothed particle hydrodynamics (SPH) with kernel corrections, radial basis function-generated finite differences (RBF-FD), and the local anisotropic basis function method (LABFM) construct discrete differential operators by imposing polynomial consistency on a local stencil. For stencils containing more nodes than there are consistency constraints, the resulting linear system is underdetermined, and the remaining degrees of freedom are fixed implicitly by the choice of kernel, basis preconditioning, or a minimum-norm condition. Polynomial consistency constrains the operator only in the low-wavenumber limit, and no part of the construction selects for accuracy at the wavenumbers where fine-scale content resides. We introduce Spectral-like Neural Discretisation (SpeND), in which the choice of those degrees of freedom is cast as a learning problem: stencil weights are parametrised by a neural network conditioned on the local node geometry, trained to approximate the modal response of a spectral operator over the resolvable band. A hard-constrained projection layer maps the network output onto the affine subspace of consistent weights, so that polynomial consistency holds exactly by construction rather than as a penalty. Training is self-supervised and physics-agnostic, requiring no reference solutions; the objective minimises dispersion and dissipation error over a prescribed band-limited function space. Modal analysis on disordered two-dimensional node distributions shows that the learned fourth-order operator follows the exact response over a substantially wider band than either explicit LABFM at equal stencil size or fourth-order finite differences on a structured grid, whilst recovering the expected fourth-order convergence rate under refinement.

View source

Similar papers

Preprint Sep 2026

Optimal Recovery for Solving Variational Problems

In science and engineering, many physical laws and scientific principles naturally arise as variational problems of minimizing an energy functional over an appropriate functional space. In many cases, it is more advantageous to directly discover the minimizer of the energy functional than to solve the associated Euler-...

Ting Wang, Gideon Simpson, Jaroslaw Knap · 0 citations
Preprint Sep 2026

Adaptive Sparse-grid Discontinuous Galerkin Approximations the Bhatnagar--Gross--Krook Model

This work studies adaptive sparse-grid discontinuous Galerkin (DG) discretizations for the Bhatnagar--Gross--Krook (BGK) model, a kinetic equation posed in four- and six-dimensional phase-space. Standard DG methods are rendered impractical for the BGK model by the curse of dimensionality, motivating compressed represen...

Stefan R. Schnake, M. Stoyanov, E. Endeve et al. · 0 citations
Open access Sep 2026

Residual-Balanced Exponentially Fitted Finite Volumes on Adaptive Equidistributed Meshes for Singularly Perturbed Convection–Diffusion Problems

An exponentially fitted finite-volume discretization is coupled to a residual-curvature equidistribution law for one-dimensional convection–diffusion–reaction problems with unresolved outflow layers. The cell flux is obtained by exact local integration and expressed through the Bernoulli function, while the mesh monito...

Shashikumar H. C. · 0 citations
Preprint Sep 2026

Latent Inversion of Material Coefficients from Boundary Data via Finite Tests and Neural Surrogates

We reconstruct a spatially varying material coefficient in a scalar elliptic equation from finitely many boundary excitations, each producing a full Dirichlet trace. To mitigate the ill-posedness and the cost of repeated PDE solves, we restrict the coefficient to a low-dimensional family, specified analytically or lear...

Erik Burman, M. G. Larson, K. Larsson et al. · 0 citations
#machine learning Preprint Sep 2026

A Systematic Analysis of Automatic Differentiation versus Discretization-based Constraints for Physics-Informed PDE Solvers

As nonlinearity strengthens, the accuracy advantage of discretization-based constraints becomes increasingly pronounced, with smaller optimization errors compensating for the truncation errors, and the more complex the nonlinearity and boundary conditions, the greater the advantage of GNN over MLP.

Xing Guo, Hong-Wei Tang, Ze-Wei Meng et al. · 0 citations

Related blog posts

Microsoft Research Blog Oct 12, 2026

Simulating student learning for better AI tutoring

StudentSim is a research system for evaluating and improving AI tutoring tools before they are tested with learners. It models how individuals may engage with tutors, giving feedback to improve tutor performance across subjects like chess, writing, and mathematics. The post Simulating student learning for better AI tutoring appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.