arXiv Machine Learning

HI-MeshGraphNets: Efficient and Accurate Mesh-based Physics Learning with Hierarchical Multi-scale Graph Neural Networks

arXiv:2608. 13827v1 Announce Type: new Abstract: Machine-learned physical surrogate models have become promising alternatives to mesh-based numerical solvers.

arXiv Machine Learning
5d ago

MeshGraphNet-Transformer: Scalable Mesh-based Learned Simulation for Solid Mechanics

MeshGraphNet-Transformer (MGN‑T) is a new architecture that fuses Transformers’ global modeling with MeshGraphNets’ geometric inductive bias, keeping a mesh‑based graph representation. It replaces iterative message passing with a physics‑attention Transformer that updates all nodal states simultaneously, enabling efficient learning on high‑resolution meshes with diverse geometries, topologies, and boundary conditions. MGN‑T accurately models impact dynamics, self‑contact, plasticity, and multivariate outputs, outperforming state‑of‑the‑art methods on classical benchmarks while using far fewer parameters.

By Mikel M. Iparraguirre, Iciar Alfaro, David Gonzalez, Elias Cueto
Hugging Face Trending Papers
Jul 13

A multi-scale feature enhanced graph neural network for fluid dynamics prediction in complex geometries

Industrial design in fields such as vehicle and aerospace engineering often relies on large-scale numerical simulations to evaluate fluid dynamics performance, which can incur substantial computational costs. Deep neural networks have shown promise in improving simulation efficiency, especially graph neural networks (GNNs), which demonstrate great potential due to their flexibility with unstructured data.

arXiv Machine Learning
Jul 10

PGD-NO: A Neural Operator with Precomputed Geometry Decomposition for 3D Million-scale Physics Simulations

arXiv:2607. 08025v1 Announce Type: new Abstract: While neural PDE solvers have demonstrated significant potential for accelerating engineering simulations, existing architectures remain constrained by high memory consumption and the single node bottleneck, where the maximum processable mesh resolution is strictly limited by the VRAM of a single compute unit.

By Weiheng Zhong, Jing Bi, Victor Oancea, Hadi Meidani
Hugging Face Trending Papers
Jul 9

PGD-NO: A Neural Operator with Precomputed Geometry Decomposition for 3D Million-scale Physics Simulations

While neural PDE solvers have demonstrated significant potential for accelerating engineering simulations, existing architectures remain constrained by high memory consumption and the single node bottleneck, where the maximum processable mesh resolution is strictly limited by the VRAM of a single compute unit. To address these challenges, we propose PGD-NO, a neural operator with Precomputed Geometry Decomposition, that relocates the computational overhead of geometric encoding to a deterministic pre-computation phase.

arXiv Machine Learning
Jun 10

Non-linear mechanical field reconstruction coupling recurrent neural networks with physics-informed graph neural networks

arXiv:2606. 10909v1 Announce Type: cross Abstract: Reconstructing local stress fields in heterogeneous microstructures under non-linear, history-dependent loading remains a major computational bottleneck in multi-scale simulations.

By Manuel Ricardo Guevara Garban, Yves Chemisky, \'Etienne Pruli\`ere, Micha\"el Cl\'ement, Martin Abendroth, Bj\"orn Kiefer
arXiv Machine Learning
Sep 4

Mesh-Native Physics-Informed Graph Surrogates for TCAD-in-the-Loop Design Space Exploration

The paper introduces a physics‑informed graph attention network that directly operates on the tetrahedral mesh used in TCAD simulations of FinFET devices. By predicting electrostatic potential and quasi‑Fermi levels at every mesh node and training with both data loss and finite‑volume current‑continuity residuals, the surrogate retains the underlying carrier‑transport physics while achieving size generalization. Benchmarks against Sentaurus Device show sub‑volt RMSE for the drift‑diffusion fields and a per‑design throughput that is orders of magnitude faster, enabling rapid Pareto‑front exploration of large multi‑fin arrays that would otherwise be prohibitively slow to simulate.

By Leonid Popryho, Ayoub Sadeghi, Inna Partin-Vaisband