SearcharxivSearch

arXiv subjects

Thibaut Hirschler

Publications and source records attributed to Thibaut Hirschler.

5 recordsLinked to original sources

Efficient Fine-Scale Simulation of Nonlinear Hyperelastic Lattice Structures

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, EIM-like approach, 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 inexact FETI-DP based 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.

math.NA

On design, analysis, and hybrid manufacturing of microstructured blade-like geometries

With the evolution of new manufacturing technologies such as multi-material 3D printing, one can think of new type of objects that consist of considerably less, yet heterogeneous, material, consequently being porous, lighter and cheaper, while having the very same functionality as the original object when manufactured from one single solid material. We aim at questioning five decades of traditional paradigms in geometric CAD and focus at new generation of CAD objects that are not solid, but contain heterogeneous free-form internal microstructures. We propose a unified manufacturing pipeline that involves all stages, namely design, optimization, manufacturing, and inspection of microstructured free-form geometries. We demonstrate our pipeline on an industrial test case of a blisk blade that sustains the desired pressure limits, yet requires significantly less material when compared to the solid counterpart.

cs.GR

Reduced Order Modeling based Inexact FETI-DP solver for lattice structures

This paper addresses the overwhelming computational resources needed with standard numerical approaches to simulate architected materials. Those multiscale heterogeneous lattice structures gain intensive interest in conjunction with the improvement of additive manufacturing as they offer, among many others, excellent stiffness-to-weight ratios. We develop here a dedicated HPC solver that benefits from the specific nature of the underlying problem in order to drastically reduce the computational costs (memory and time) for the full fine-scale analysis of lattice structures. Our purpose is to take advantage of the natural domain decomposition into cells and, even more importantly, of the geometrical and mechanical similarities among cells. Our solver consists in a so-called inexact FETI-DP method where the local, cell-wise operators and solutions are approximated with reduced order modeling techniques. Instead of considering independently every cell, we end up with only few principal local problems to solve and make use of the corresponding principal cell-wise operators to approximate all the others. It results in a scalable algorithm that saves numerous local factorizations. Our solver is applied for the isogeometric analysis of lattices built by spline composition, which offers the opportunity to compute the reduced basis with macro-scale data, thereby making our method also multiscale and matrix-free. The solver is tested against various 2D and 3D analyses. It shows major gains with respect to black-box solvers; in particular, problems of several millions of degrees of freedom can be solved with a simple computer within few minutes.

math.NA

Fast and Multiscale Formation of Isogeometric matrices of Microstructured Geometric Models

The matrix formation associated to high-order discretizations is known to be numerically demanding. Based on the existing procedure of interpolation and lookup, we design a multiscale assembly procedure to reduce the exorbitant assembly time in the context of isogeometric linear elasticity of complex microstructured geometries modeled via spline compositions. The developed isogeometric approach involves a polynomial approximation occurring at the macro-scale and the use of lookup tables with pre-computed integrals incorporating the micro-scale information. We provide theoretical insights and numerical examples to investigate the performance of the procedure. The strategy turns out to be of great interest not only to form finite element operators but also to compute other quantities in a fast manner as for instance sensitivity analyses commonly used in design optimization.

math.NA

Quadrature-free Immersed Isogeometric Analysis

This paper presents a novel method for solving partial differential equations on three-dimensional CAD geometries by means of immersed isogeometric discretizations that do not require quadrature schemes. It relies on a new developed technique for the evaluation of polynomial integrals over spline boundary representations that is exclusively based on analytical computations. First, through a consistent polynomial approximation step, the finite element operators of the Galerkin method are transformed into integrals involving only polynomial integrands. Then, by successive applications of the divergence theorem, those integrals over B-Reps are transformed into first surface and then line integrals with polynomials integrands. Eventually these line integrals are evaluated analytically with machine precision accuracy. The performance of the proposed method is demonstrated by means of numerical experiments in the context of 2D and 3D elliptic problems, retrieving optimal error convergence order in all cases. Finally, the methodology is illustrated for 3D CAD models with an industrial level of complexity.

math.NA