G-PARC: Graph-Physics Aware Recurrent Convolutional Neural Networks for Spatiotemporal Dynamics on Unstructured Meshes

arXiv cs.LG / 4/21/2026

📰 NewsIdeas & Deep AnalysisModels & Research

Key Points

  • The paper proposes G-PARC, a physics-aware recurrent convolutional neural network designed to predict nonlinear spatiotemporal dynamics on unstructured meshes where traditional grid-based CNNs struggle.
  • G-PARC combines graph neural network flexibility with physics-informed learning by using moving least squares (MLS) kernels to approximate spatial derivatives and embedding PDE derivative terms directly into the network’s computational graph.
  • The method improves accuracy while using 2–3x fewer parameters than prior graph-based approaches (e.g., MeshGraphNet, MeshGraphKAN, and GraphSAGE) by replacing the usual encoder–processor–decoder design with analytically computed differential operators.
  • Experiments show strong generalization across nonuniform discretizations, the ability to handle moving meshes for structural deformation, and improved performance on challenging nonlinear benchmarks such as fluvial hydrology, shock waves, and elastoplastic dynamics.

Abstract

Physics-aware recurrent convolutional networks (PARC) have demonstrated strong performance in predicting nonlinear spatiotemporal dynamics by embedding differential operators directly into the computational graph of a neural network. However, pixel-based convolutions are restricted to static, uniform Cartesian grids, making them ill-suited to following evolving localized structures in an efficient manner. Graph neural networks (GNNs) naturally handle irregular spatial discretizations, but existing graph-based physics-aware deep learning (PADL) methods have difficulty handling extreme nonlinear regimes. To address these limitations, we propose Graph PARC (G-PARC), which uses moving least squares (MLS) kernels to approximate spatial derivatives on unstructured graphs, and embeds the derivatives of governing partial differential equations into the network's computational graph. G-PARC achieves better accuracy with 2-3x fewer parameters than MeshGraphNet, MeshGraphKAN, and GraphSAGE, replacing the traditional encoder-processor-decoder framework with analytically computed differential operators. We demonstrate that G-PARC (1) generalizes across nonuniform spatial and temporal discretizations; (2) handles moving meshes required for structural deformation; and (3) outperforms existing graph-based PADL methods on nonlinear benchmarks including fluvial hydrology, planar shock waves, and elastoplastic dynamics. By embedding explicit physical operators within the flexibility of GNNs, G-PARC enables accurate modeling of extreme nonlinear phenomena on complex computational domains, moving PADLbeyond idealized Cartesian grids.