Abstract
Moulinec and Suquet introduced FFT-based homogenization in 1994, and twenty years later, their approach is still effective for evaluating the homogenized properties arising from the periodic cell problem. This paper builds on the author's (2013) variational reformulation approximated by trigonometric polynomials establishing two numerical schemes: Galerkin approximation (Ga) and a version with numerical integration (GaNi). The latter approach, fully equivalent to the original Moulinec-Suquet algorithm, was used to evaluate guaranteed upper-lower bounds on homogenized coefficients incorporating a closed-form double grid quadrature. Here, these concepts are employed for the Ga scheme. Despite Ga's higher computational requirements, it outperforms GaNi with improved guaranteed bounds together with more predictable and monotone behaviors for an increase in the number of grid points. Numerical integration heading to block-sparse linear systems is extended here to materials defined via high-resolution images in a way which allows for effective treatment using the FFT algorithm. Shifts in FFT result in a reduction to the original grid. Minimization of the bounds during iterations of conjugate gradients is effective, particularly when incorporating a solution from a coarser grid. The methodology presented here for the scalar linear elliptic problem could be extended to more complex frameworks.

This publication has 46 references indexed in Scilit: