pith. sign in

arxiv: 2504.06425 · v2 · pith:TPSA32LFnew · submitted 2025-04-08 · 🧮 math.NA · cs.CE· cs.NA

Neural Network Enhanced Polyconvexification of Isotropic Energy Densities in Computational Mechanics

classification 🧮 math.NA cs.CEcs.NA
keywords networkneuralcomputationalmechanicspolyconvexificationapproachdensitiesenergy
0
0 comments X
read the original abstract

We present a neural network approach for fast evaluation of parameter-dependent polyconvex envelopes, which are crucial in computational mechanics. Our method uses a neural network architecture that inherently encodes polyconvexity in the main variable by combining a feature extraction layer that computes the minors function on the signed singular value characterisation of isotropic energy densities with a Partially Input Convex Neural Network (PICNN). The envelope inequality is weakly enforced by penalisation during training, as are the symmetries of the function. As a guiding example, we focus on a pseudo time incremental variational damage problem, which is parameter-dependent on previous time-step iterates, the deformation gradient and the internal variable. This problem is reformulated in terms of signed singular values and a splitting approach is applied to reduce the dimension of the parameter space, thereby making training more tractable. Numerical experiments show that the networks achieve favourable accuracy for engineering applications while providing high compression and significant speed-up over traditional polyconvexification schemes. Most importantly, the network adapts to varying physical or material parameters, enabling real-time polyconvexification in large-scale computational mechanics scenarios.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Modeling isotropic polyconvex hyperelasticity by neural networks -- sufficient and necessary criteria for compressible and incompressible materials

    cs.CE 2026-03 conditional novelty 7.0

    CSSV-NNs and inc-CSSV-NNs provide universal approximation of frame-indifferent isotropic polyconvex hyperelastic energies, showing Ball's criterion is sufficient but not necessary.

  2. Compression of Polyconvex Envelopes of Isotropic Functions via Monotonic Input Convex Neural Networks

    math.NA 2026-07 unverdicted novelty 6.0

    A monotonic ICNN architecture with domain reduction to the positive octant approximates polyconvex envelopes of isotropic functions more efficiently than existing necessary-and-sufficient methods, demonstrated on Sain...