Hierarchical rank-one sequence convexification for the relaxation of variational problems with microstructures

  • 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 minimisation of discretised 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, andThis 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 minimisation of discretised 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.show moreshow less

Download full text files

Export metadata

Statistics

Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Maximilian Köhler, Timo NeumeierGND, Malte A. PeterORCiDGND, Daniel PeterseimORCiDGND, Daniel Balzani
URN:urn:nbn:de:bvb:384-opus4-1132929
Frontdoor URLhttps://opus.bibliothek.uni-augsburg.de/opus4/113292
ISSN:1879-2138OPAC
ISSN:0045-7825OPAC
Parent Title (English):Computer Methods in Applied Mechanics and Engineering
Publisher:Elsevier
Place of publication:Amsterdam
Type:Article
Language:English
Year of first Publication:2024
Publishing Institution:Universität Augsburg
Release Date:2024/06/04
Volume:432
Issue:part A
First Page:117321
DOI:https://doi.org/10.1016/j.cma.2024.117321
Institutes:Mathematisch-Naturwissenschaftlich-Technische Fakultät
Fakultätsübergreifende Institute und Einrichtungen
Mathematisch-Naturwissenschaftlich-Technische Fakultät / Institut für Mathematik
Mathematisch-Naturwissenschaftlich-Technische Fakultät / Institut für Mathematik / Lehr- und Forschungseinheit Angewandte Analysis
Mathematisch-Naturwissenschaftlich-Technische Fakultät / Institut für Mathematik / Lehrstuhl für Numerische Mathematik
Fakultätsübergreifende Institute und Einrichtungen / Zentrum für Advanced Analytics and Predictive Sciences (CAAPS)
Dewey Decimal Classification:5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik
Licence (German):CC-BY 4.0: Creative Commons: Namensnennung (mit Print on Demand)