A comparative study on low-memory iterative solvers for FFT-based homogenization of periodic media

Abstract

In this paper, we assess the performance of four iterative algorithms for solving non-symmetric rank-deficient linear systems arising in the FFT-based homogenization of heterogeneous materials defined by digital images. Our framework is based on the Fourier-Galerkin method with exact and approximate integrations that has recently been shown to generalize the Lippmann-Schwinger setting of the original work by Moulinec and Suquet from 1994. It follows from this variational format that the ensuing system of linear equations can be solved by general-purpose iterative algorithms for symmetric positive-definite systems, such as the Richardson, the Conjugate gradient, and the Chebyshev algorithms, that are compared here to the Eyre-Milton scheme - the most efficient specialized method currently available. Our numerical experiments, carried out for two-dimensional elliptic problems, reveal that the Conjugate gradient algorithm is the most efficient option, while the Eyre-Milton method performs comparably to the Chebyshev semi-iteration. The Richardson algorithm, equivalent to the still widely used original Moulinec-Suquet solver, exhibits the slowest convergence. Besides this, we hope that our study highlights the potential of the well-established techniques of numerical linear algebra to further increase the efficiency of FFT-based homogenization methods.

23 pages, 11 figures, 1 table; minor revision after the first review

References in corpus (10)

• Fourier-based schemes for computing the mechanical response of composites with accurate local fields
• Accelerating a FFT-based solver for numerical homogenization of periodic media by conjugate gradients
• An FFT-based Galerkin Method for Homogenization of Periodic Media
• Fourier-based schemes with modified Green operator for computing the electrical response of heterogeneous media with accurate local fields
• Finite strain FFT-based non-linear solvers made simple
• A finite element perspective on non-linear FFT-based micromechanical simulations
• Filtering material properties to improve FFT-based methods for numerical homogenization
• Guaranteed upper-lower bounds on homogenized properties by FFT-based Galerkin method
• Improved guaranteed computable bounds on homogenized properties of periodic media by Fourier-Galerkin method with exact integration
• Periodic homogenization using the Lippmann--Schwinger formalism

Cited by in corpus (12)

• Finite strain FFT-based non-linear solvers made simple
• A finite element perspective on non-linear FFT-based micromechanical simulations
• Accelerated computational micromechanics
• Improved guaranteed computable bounds on homogenized properties of periodic media by Fourier-Galerkin method with exact integration
• FFT-based homogenisation accelerated by low-rank tensor approximations
• A reduced order model for geometrically parameterized two-scale simulations of elasto-plastic microstructures under large deformations
• Energy-based comparison between the Fourier--Galerkin method and the finite element method
• Learning constitutive models from microstructural simulations via a non-intrusive reduced basis method: Extension to geometrical parameterizations
• Development and comparison of spectral algorithms for numerical modeling of the quasi-static mechanical behavior of inhomogeneous materials
• A stable and accurate X-FFT solver for linear elastic homogenization problems in 3D
• FFT-based homogenization on periodic anisotropic translation invariant spaces
• Efficient topology optimization using compatibility projection in micromechanical homogenization