Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
With the growing maturity of additive manufacturing, the fabrication of architected or lattice-based metamaterials has become a reality for industrial applications. These materials combine lightweight design with tailored mechanical properties, most of which exhibit pronounced nonlinear, especially large-deformation, behaviors. The main numerical challenge therefore lies in performing nonlinear simulations of such lattice structures, which may contain thousands of geometrically intricate unit cells, while lacking sufficient scale separation for multiscale homogenization schemes to be applicable straightforwardly. In this work, we propose a dedicated solver for the full volumetric fine-scale simulation of nonlinear hyperelastic lattice structures that drastically reduces both memory and computational costs. The key idea is to exploit the intrinsic self-similarity of the cells through a reduced-order modeling strategy applied within a domain-decomposition framework. At each Newton iteration, a limited set of principal cells is identified through a dedicated, weakly intrusive, discrete empirical interpolation method, allowing all local tangent operators to be expressed as linear combinations of a few principal ones. This enables fast and memory-efficient operator assembly, and then feeds an efficient dual–primal finite-element tearing and interconnecting preconditioner at the solution stage, resulting in a quasi matrix-free algorithm for the nonlinear analysis. Numerical experiments in two and three dimensions demonstrate significant computational gains, with runtime reductions from several hours to a few tens of minutes and memory savings by factors of about three, while maintaining full fine-scale accuracy. Notably, the proposed strategy enables the computation of problems involving thousands of cells (i.e., millions of degrees of freedom) within a few minutes on an off-the-shelf laptop.