arXiv Machine Learning

Nonlinear elliptic homogenization with the parametric Deep Ritz method

arXiv Machine Learning
Sep 15

Physics-Constrained Neural Surrogate for Domain Growth Prediction in Systems with Conserved Kinetics

The paper introduces a physics-constrained neural network surrogate that learns the microstructural evolution of binary mixtures governed by the Cahn‑Hilliard equation. By imposing conservation of the order parameter as a hard constraint on the network output, the model accurately predicts long‑time phase‑separation dynamics for both critical and off‑critical mixtures, maintaining mixture composition and matching the Lifshitz‑Slyozov domain‑growth law. A variant that enforces conservation only through a penalty term drifts from the initial composition and loses predictive accuracy over long rollouts, underscoring the necessity of the hard constraint for stability.

By Vijay Yadav, Pallvi Pandey, Madhu Priya, Manish Dev Shrimali, Prabhat K. Jaiswal
arXiv Machine Learning
Jul 23

PG-KINN: A Physics-Informed Petrov-Galerkin Kolmogorov-Arnold Network for Solving Forward and Inverse PDEs

arXiv:2607. 20378v1 Announce Type: new Abstract: Physics-informed learning of partial differential equations (PDEs) has been dominated by multilayer perceptrons (MLPs), whose spectral bias and dense parameterization limit both accuracy and interpretability.

By Amirhossein Sadr, Nima Soltani, Vahideh Moghtadaiee, Aida Pakniyat, Dara Rahmati, Saeid Gorgin
arXiv Machine Learning
Sep 18

Beyond PINNs: A Unified Gauss--Newton and Petrov--Galerkin Framework for Neural and Hybrid PDE Solvers

The paper proposes a unified framework that combines physics‑informed neural networks (PINNs) and finite element methods (FEM) by discretizing functional Gauss–Newton problems using finite families of linear measurements. By interpreting these measurements as test functions, the resulting Gauss–Newton system becomes a Petrov–Galerkin discretization of the linearized functional problem, thereby encompassing pointwise collocation and natural‑gradient approaches as special cases. The framework is specialized to elliptic partial differential equations, yielding weak residual formulations and a hybrid finite‑element–neural architecture that operates on complementary approximation spaces, with numerical experiments confirming its effectiveness.

By Nilo Schwencke, Roland Maier
arXiv Machine Learning
Sep 10

Hyperelastic constitutive model discovery with differentiable finite elements and structure-preserving neural networks

The paper introduces a differentiable finite element framework that discovers hyperelastic constitutive laws from limited experimental data, such as boundary-only displacement measurements and global reaction forces. By embedding the nonlinear finite element equilibrium problem into the learning loop, the method evaluates candidate strain‑energy densities through the deformation fields they produce, enforcing mechanical equilibrium as a constraint. The constitutive response is modeled with Hyperelastic Neural Networks, a structure‑preserving class that guarantees physical admissibility, including residual energy and stress‑free conditions, frame indifference, isotropic symmetry, polyconvexity, coercivity, and controlled volumetric growth. Numerical experiments in two and three dimensions show accurate recovery of hyperelastic isotropic responses, robustness to noise, and generalization across geometries, loading, and boundary conditions.

By Francesco Regazzoni
arXiv AI
Jun 6

Finite Element-Based Material Learning via Automatic Differentiation: Learning constitutive neural network models from full-field deformation data

arXiv:2606. 05199v1 Announce Type: cross Abstract: The identification of constitutive neural network models from heterogeneous full-field deformation data provides a robust alternative to traditional calibration methods based on homogeneous stress-strain experiments, particularly given the high dimensionality of trainable parameters.

By Matthias Knipper, Chenyi Ji, Malte Brand, Kevin Linka
arXiv Machine Learning
Sep 10

Local gradient neural operator

The paper introduces the Local Gradient Neural Operator (LGNO), a lightweight and interpretable neural operator designed for field temporal evolution prediction and source identification in mechanical problems. LGNO leverages nonlinear gradient discretization priors and multilayer perceptron convolutional layers to learn translation‑invariant local kernels resembling discrete stencils, with a zero‑consistent stencil factorization that separates coefficient learning from field reconstruction. Experiments on a range of PDE benchmarks—including linear, nonlinear, static, dynamic, low‑ and high‑dimensional cases—demonstrate that LGNO achieves comparable accuracy to global neural operators while using fewer parameters and maintaining rollout stability across diffusion, flow, and quantum phenomena.

By Baiming Zhang, Jinsong Tang, Ying Xu, Lihua Chen, Shiying Xiong