Javascript must be enabled to continue!
Dimensionless Energy Graph Network with Hard Boundary Embedding and Finite Element Interpolation: Unsupervised Variational Solution Framework for Linear Elastic and Hyperelastic Problems
View through CrossRef
To address the challenges in existing neural solvers for solid mechanics—such as the difficulty of balancing multiple loss terms, limited expressiveness on complex unstructured meshes, the optimization competition introduced by soft constraints for boundary conditions, and the sensitivity of energy-based training to physical scales—this work proposes a dimensionless energy graph network with hard boundary embedding and finite element interpolation (HiDEG‑Net). The method constructs a graph structure based on finite element discretization meshes, predicts nodal dimensionless displacement degrees of freedom using a graph message‑passing network, reconstructs strains, stresses and energy densities at the element level via finite element shape functions and their derivatives, and adopts the minimization of the dimensionless discrete total potential energy as the training objective. Unlike conventional coordinate‑based PINNs and deep energy methods, HiDEG‑Net explicitly leverages mesh adjacency relations, local geometric information, and boundary semantic information, thereby enhancing the representation capability of displacement fields under complex geometries and unstructured mesh conditions. For essential boundary conditions, a node‑masking and output‑replacement mechanism is employed to directly embed them into the network’s output space, avoiding additional boundary penalty terms; for natural boundary conditions, they are incorporated into the variational objective through the external potential energy term. Furthermore, a unified dimensionless treatment of coordinates, displacements, material parameters, loads, and energy improves training stability that would otherwise be compromised by significant differences in physical scales. Two‑dimensional and three‑dimensional linear elasticity examples, problems with holes, and two‑dimensional as well as three‑dimensional hyperelastic examples demonstrate that the proposed method can achieve displacement and stress fields in close agreement with finite element reference solutions under unsupervised training conditions. Ablation studies show that graph topology modeling, hard boundary embedding, and dimensionless treatment all play important roles in improving solution accuracy and training stability. This work provides a neural solution framework for complex boundary‑value problems in solid mechanics that combines the variational structure of finite element discretization with the representation power of graph neural networks.
Title: Dimensionless Energy Graph Network with Hard Boundary Embedding and Finite Element Interpolation: Unsupervised Variational Solution Framework for Linear Elastic and Hyperelastic Problems
Description:
To address the challenges in existing neural solvers for solid mechanics—such as the difficulty of balancing multiple loss terms, limited expressiveness on complex unstructured meshes, the optimization competition introduced by soft constraints for boundary conditions, and the sensitivity of energy-based training to physical scales—this work proposes a dimensionless energy graph network with hard boundary embedding and finite element interpolation (HiDEG‑Net).
The method constructs a graph structure based on finite element discretization meshes, predicts nodal dimensionless displacement degrees of freedom using a graph message‑passing network, reconstructs strains, stresses and energy densities at the element level via finite element shape functions and their derivatives, and adopts the minimization of the dimensionless discrete total potential energy as the training objective.
Unlike conventional coordinate‑based PINNs and deep energy methods, HiDEG‑Net explicitly leverages mesh adjacency relations, local geometric information, and boundary semantic information, thereby enhancing the representation capability of displacement fields under complex geometries and unstructured mesh conditions.
For essential boundary conditions, a node‑masking and output‑replacement mechanism is employed to directly embed them into the network’s output space, avoiding additional boundary penalty terms; for natural boundary conditions, they are incorporated into the variational objective through the external potential energy term.
Furthermore, a unified dimensionless treatment of coordinates, displacements, material parameters, loads, and energy improves training stability that would otherwise be compromised by significant differences in physical scales.
Two‑dimensional and three‑dimensional linear elasticity examples, problems with holes, and two‑dimensional as well as three‑dimensional hyperelastic examples demonstrate that the proposed method can achieve displacement and stress fields in close agreement with finite element reference solutions under unsupervised training conditions.
Ablation studies show that graph topology modeling, hard boundary embedding, and dimensionless treatment all play important roles in improving solution accuracy and training stability.
This work provides a neural solution framework for complex boundary‑value problems in solid mechanics that combines the variational structure of finite element discretization with the representation power of graph neural networks.
Related Results
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
Graph convolutional neural networks for 3D data analysis
Graph convolutional neural networks for 3D data analysis
(English) Deep Learning allows the extraction of complex features directly from raw input data, eliminating the need for hand-crafted features from the classical Machine Learning p...
EVALUATING HYPERELASTIC AND ALTERNATIVE DEFORMATION MODELS FOR ACCURATE CHARACTERIZATION OF THE MECHANICAL PROPERTIES OF BIOLOGICAL TISSUES
EVALUATING HYPERELASTIC AND ALTERNATIVE DEFORMATION MODELS FOR ACCURATE CHARACTERIZATION OF THE MECHANICAL PROPERTIES OF BIOLOGICAL TISSUES
Although hyperelastic models have been studied for almost 80 years, selecting one that accurately describes the mechanical response of materials remains a challenge. The most promi...
Mechanical Response of Ping-Pong Racket to Different Hyperelastic Surface Materials
Mechanical Response of Ping-Pong Racket to Different Hyperelastic Surface Materials
Synthetic rubber serving as the surface material of the ping-pong racket has good elasticity and anti-friction. Material parameters such as the hyperelastic constitutive model of t...
An Differential Quadrature Finite Element and the Differential Quadrature Hierarchical Finite Element Methods for the Dynamics Analysis of on Board Shaft
An Differential Quadrature Finite Element and the Differential Quadrature Hierarchical Finite Element Methods for the Dynamics Analysis of on Board Shaft
In this paper the dynamic analysis of a shaft rotor whose support is mobile is studied. For the calculation of kinetic energy and stiffness energy, the beam theory of Euler Bernoul...
ELASTIC AND HYPERELASTIC PROPERTIES OF THE HUMAN NAIL PLATE
ELASTIC AND HYPERELASTIC PROPERTIES OF THE HUMAN NAIL PLATE
Introduction. As is known, changes in the nail, as an appendage of the skin, can be genetically determined, caused by injuries, diseases, medications or exposure to harmful substan...
Numerical solution of Stefan problem with variable space grid method based on mixed finite element/finite difference approach
Numerical solution of Stefan problem with variable space grid method based on mixed finite element/finite difference approach
PurposeThe purpose of this paper is to improve the accuracy and stability of the existing solutions to 1D Stefan problem with time-dependent Dirichlet boundary conditions. The accu...
Bilangan Terhubung Titik Pelangi pada Graf Garis dan Graf Tengah dari Hasil Operasi Comb Graf Bintang C<sub>3</sub> dan Graf Bintang S<sub>n</sub>
Bilangan Terhubung Titik Pelangi pada Graf Garis dan Graf Tengah dari Hasil Operasi Comb Graf Bintang C<sub>3</sub> dan Graf Bintang S<sub>n</sub>
Penelitian ini bertujuan menentukan bilangan terhubung titik pelangi (rainbow vertex connection number) pada graf garis dan graf tengah yang diperoleh dari hasil operasi comb antar...

