Computational homogenization of elasticity on a staggered grid

Abstract

In this article, we propose to discretize the problem of linear elastic homogenization by finite differences on a staggered grid and introduce fast and robust solvers. Our method shares some properties with the FFT-based homogenization technique of Moulinec and Suquet, which has received widespread attention recently because of its robustness and computational speed. These similarities include the use of FFT and the resulting performing solvers. The staggered grid discretization, however, offers three crucial improvements. Firstly, solutions obtained by our method are completely devoid of the spurious oscillations characterizing solutions obtained by Moulinec-Suquet's discretization. Secondly, the iteration numbers of our solvers are bounded independently of the grid size and the contrast. In particular, our solvers converge for three-dimensional porous structures, which cannot be handled by Moulinec-Suquet's method. Thirdly, the finite difference discretization allows for algorithmic variants with lower memory consumption. More precisely, it is possible to reduce the memory consumption of the Moulinec-Suquet algorithms by 50%. We underline the effectiveness and the applicability of our methods by several numerical experiments of industrial scale

The heterogeneous multiscale finite element method for the homogenization of linear elastic solids and a comparison with the FE2 method

“…Methods based on Fast-Fourier Transforms (FFT) as introduced in [51] use a direct, point-wise discretization of the Lippmann-Schwinger equation, with improvements in [46] and [58]. In an effort to reduce the computation time by a modified modeling [60] introduce into FE 2 the rationale of a statistically similar representative volume element (SSRVE) in order to replace the true microstructure in its full geometrical complexity by a surrogate, which resembles the original one by geometrical features as analyzed by different geometrical similarity measures.…”

Double Grid Integration with Projection (DoGIP): Application to numerical homogenization by Fourier‐Galerkin method

“…defined on a trial space V = ∇H The Fourier-Galerkin method, described for homogenisation in [1][2][3][4][5], belongs to FFT-based methods introduced in [6] and investigated and developed to many different schemes such as [7][8][9]. is based on Galerkin approximation with trigonometric polynomials of uniform order N = (n, .…”

Deformation patterning in finite-strain crystal plasticity by spectral homogenization with application to magnesium

“…First-order finite difference-based approximations composed onto Fourier transforms have been shown to result in significantly mitigating oscillatory artifacts (Müller, 1996;Brown et al, 2002;Berbenni et al, 2014;Brisard and Dormieux, 2010;Lebensohn and Needleman, 2016;Schneider et al, 2016), while maintaining consistency with the original governing equations with h-refinement. Willot et al (2014) showed that rotated first-order schemes show a marked reduction in oscillatory artifacts.…”