Premium
Convergence of iterative methods based on Neumann series for composite materials: Theory and practice
Author(s) -
Moulinec Hervé,
Suquet Pierre,
Milton Graeme W.
Publication year - 2018
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.5777
Subject(s) - convergence (economics) , neumann series , series (stratigraphy) , mathematics , discretization , fourier transform , mathematical analysis , fourier series , iterative method , singularity , algorithm , paleontology , economics , biology , economic growth
Summary Iterative fast Fourier transform methods are useful for calculating the fields in composite materials and their macroscopic response. By iterating back and forth until convergence, the differential constraints are satisfied in Fourier space and the constitutive law in real space. The methods correspond to series expansions of appropriate operators and to series expansions for the effective tensor as a function of the component moduli. It is shown that the singularity structure of this function can shed much light on the convergence properties of the iterative fast Fourier transform methods. We look at a model example of a square array of conducting square inclusions for which there is an exact formula for the effective conductivity (Obnosov). Theoretically, some of the methods converge when the inclusions have zero or even negative conductivity. However, the numerics do not always confirm this extended range of convergence and show that accuracy is lost after relatively few iterations. There is little point in iterating beyond this. Accuracy improves when the grid size is reduced, showing that the discrepancy is linked to the discretization. Finally, it is shown that none of the 3 iterative schemes investigated overperforms the others for all possible microstructures and all contrasts.