Pith. sign in

REVIEW 1 cited by

A Simple and Efficient Lagrange Multiplier Based Mixed Finite Element for Gradient Damage

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2211.07964 v1 pith:ZDER35CB submitted 2022-11-15 cs.CE cs.NAmath.NA

A Simple and Efficient Lagrange Multiplier Based Mixed Finite Element for Gradient Damage

classification cs.CE cs.NAmath.NA
keywords damageelementfiniteformulationlagrangemultiplierapproachesefficient
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

A novel finite element formulation for gradient-regularized damage models is presented which allows for the robust, efficient, and mesh-independent simulation of damage phenomena in engineering and biological materials. The paper presents a Lagrange multiplier based mixed finite element formulation for finite strains. Thereby, no numerical stabilization or penalty parameters are required. On the other hand, no additional degrees of freedom appear for the Lagrange multiplier which is achieved through a suitable FE-interpolation scheme allowing for static condensation. In contrast to competitive approaches from the literature with similar efficiency, the proposed formulation does not require cross-element information and thus, a straightforward implementation using standard element routine interfaces is enabled. Numerical tests show mesh-independent solutions, robustness of the solution procedure for states of severe damage and under cyclic loading conditions. It is demonstrated that the computing time of the gradient damage calculations exceeds the one of purely elastic computations only by an insignificant amount. Furthermore, an improved convergence behavior compared to alternative approaches is shown.

discussion (0)

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

Forward citations

Cited by 1 Pith paper

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

  1. 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...