Guardado en:
Detalles Bibliográficos
Autores principales: Köhler, Maximilian, Neumeier, Timo, Peter, Malte. A., Peterseim, Daniel, Balzani, Daniel
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:https://arxiv.org/abs/2405.16866
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866909211216052224
author Köhler, Maximilian
Neumeier, Timo
Peter, Malte. A.
Peterseim, Daniel
Balzani, Daniel
author_facet Köhler, Maximilian
Neumeier, Timo
Peter, Malte. A.
Peterseim, Daniel
Balzani, Daniel
contents This paper presents an efficient algorithm for the approximation of the rank-one convex hull in the context of nonlinear solid mechanics. It is based on hierarchical rank-one sequences and simultaneously provides first and second derivative information essential for the calculation of mechanical stresses and the computational minimization of discretized energies. For materials, whose microstructure can be well approximated in terms of laminates and where each laminate stage achieves energetic optimality with respect to the current stage, the approximate envelope coincides with the rank-one convex envelope. Although the proposed method provides only an upper bound for the rank-one convex hull, a careful examination of the resulting constraints shows a decent applicability in mechanical problems. Various aspects of the algorithm are discussed, including the restoration of rotational invariance, microstructure reconstruction, comparisons with other semi-convexification algorithms, and mesh independency. Overall, this paper demonstrates the efficiency of the algorithm for both, well-established mathematical benchmark problems as well as nonconvex isotropic finite-strain continuum damage models in two and three dimensions. Thereby, for the first time, a feasible concurrent numerical relaxation is established for an incremental, dissipative large-strain model with relevant applications in engineering problems.
format Preprint
id arxiv_https___arxiv_org_abs_2405_16866
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Hierarchical Rank-One Sequence Convexification for the Relaxation of Variational Problems with Microstructures
Köhler, Maximilian
Neumeier, Timo
Peter, Malte. A.
Peterseim, Daniel
Balzani, Daniel
Computational Engineering, Finance, and Science
This paper presents an efficient algorithm for the approximation of the rank-one convex hull in the context of nonlinear solid mechanics. It is based on hierarchical rank-one sequences and simultaneously provides first and second derivative information essential for the calculation of mechanical stresses and the computational minimization of discretized energies. For materials, whose microstructure can be well approximated in terms of laminates and where each laminate stage achieves energetic optimality with respect to the current stage, the approximate envelope coincides with the rank-one convex envelope. Although the proposed method provides only an upper bound for the rank-one convex hull, a careful examination of the resulting constraints shows a decent applicability in mechanical problems. Various aspects of the algorithm are discussed, including the restoration of rotational invariance, microstructure reconstruction, comparisons with other semi-convexification algorithms, and mesh independency. Overall, this paper demonstrates the efficiency of the algorithm for both, well-established mathematical benchmark problems as well as nonconvex isotropic finite-strain continuum damage models in two and three dimensions. Thereby, for the first time, a feasible concurrent numerical relaxation is established for an incremental, dissipative large-strain model with relevant applications in engineering problems.
title Hierarchical Rank-One Sequence Convexification for the Relaxation of Variational Problems with Microstructures
topic Computational Engineering, Finance, and Science
url https://arxiv.org/abs/2405.16866