Computational polyconvexification of isotropic functions
From MaRDI portal
Publication:6644356
DOI10.1137/23m1589773MaRDI QIDQ6644356
Daniel Peterseim, Malte A. Peter, David Wiedemann, Timo Neumeier
Publication date: 27 November 2024
Published in: Multiscale Modeling \& Simulation (Search for Journal in Brave)
Numerical optimization and variational techniques (65K10) Computational methods for problems pertaining to convex and discrete geometry (52-08)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The exponentiated Hencky-logarithmic strain energy. II: Coercivity, planar polyconvexity and existence of minimizers
- Quasiconvexity and relaxation of nonconvex problems in the calculus of variations
- Convexity conditions and existence theorems in nonlinear elasticity
- Characterization of convex isotropic functions
- An optimal convex hull algorithm in any fixed dimension
- Faster than the fast Legendre transform, the linear-time Legendre transform
- Estimates for numerical approximations of rank one convex envelopes
- A fast computational algorithm for the Legendre-Fenchel transform
- A method for pointwise evaluation of polyconvex envelopes
- Adaptive convexification of microsphere-based incremental damage for stress and strain softening at finite strains
- An adaptive relaxation algorithm for multiscale problems and application to nematic elastomers
- An algorithm for pointwise evaluation of polyconvex envelopes. II: generalization and numerical results
- Characterizations of symmetric polyconvexity
- A linear-time approximate convex envelope algorithm using the double Legendre-Fenchel transform with application to phase separation
- Effective relaxation for microstructure simulations: algorithms and applications
- Relaxed incremental variational formulation for damage at large strains with application to fiber-reinforced materials and materials with truss-like microstructures
- Some Open Problems in Elasticity
- The convex envelope is the solution of a nonlinear obstacle problem
- Non-polyconvexity of the stored energy function of a Saint Venant-Kirchhoff material
- Optimal design and relaxation of variational problems, I
- Optimal design and relaxation of variational problems, II
- Numerical Computation of Rank-One Convex Envelopes
- The quickhull algorithm for convex hulls
- The quasiconvex envelope of the Saint Venant–Kirchhoff stored energy function
- Reliable and Efficient Approximation of Polyconvex Envelopes
- Introduction
- Semicontinuity problems in the calculus of variations
- Direct methods in the calculus of variations
- Multidimensional rank-one convexification of incremental damage models at finite strains
Related Items (1)
This page was built for publication: Computational polyconvexification of isotropic functions