2008
DOI: 10.1002/nme.2375
|View full text |Cite
|
Sign up to set email alerts
|

An accelerated FFT algorithm for thermoelastic and non‐linear composites

Abstract: SUMMARYA fast numerical algorithm to compute the local and overall responses of non-linear composite materials is developed. This alternative formulation allows us to improve the convergence of the existing method of Moulinec and Suquet (e.g. Comput. Meth. Appl. Mech. Eng. 1998; 157(1-2):69-94). In the present method, a non-linear elastic (or conducting) material is replaced by infinitely many locally linear thermoelastic materials with moduli that depend on the values of the local fields. This makes it possib… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
87
0

Year Published

2010
2010
2020
2020

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 75 publications
(87 citation statements)
references
References 11 publications
0
87
0
Order By: Relevance
“…We now come to the definition of the space of trial and test functions, V h , which is to remain unchanged throughout this section. The origin of the success of numerical schemes based on the discretization of the Lippmann-Schwinger equation [9,10,13,15,16,25,26] lies in the fact that the matrix of the underlying linear system is the sum of two matrices with noteworthy properties. The first matrix is block-diagonal, and its product with a vector is performed efficiently in the real space.…”
Section: General Settingmentioning
confidence: 99%
See 1 more Smart Citation
“…We now come to the definition of the space of trial and test functions, V h , which is to remain unchanged throughout this section. The origin of the success of numerical schemes based on the discretization of the Lippmann-Schwinger equation [9,10,13,15,16,25,26] lies in the fact that the matrix of the underlying linear system is the sum of two matrices with noteworthy properties. The first matrix is block-diagonal, and its product with a vector is performed efficiently in the real space.…”
Section: General Settingmentioning
confidence: 99%
“…Proof of the second statement is not needed, as the first statement is necessary and sufficient when the bilinear form a is symmetric. (25), as well as function F, defined by (26).…”
Section: Appendix A2 Proof Of Theoremmentioning
confidence: 99%
“…(31) with i = 0, see [8]. However, as follows from our developments in Section 2 and also from the discussion in [16,Section 3], this choice rather depends on the iterative algorithm used to solve the following linearized system for δε * (i+1) ,…”
Section: Collocation Fft Schemesmentioning
confidence: 99%
“…Since then, several authors proposed variants or improvements of the initial method (among others: Müller [3], Lebensohn [4], Vinogradov & Milton [5], Zeman et al [6], Brisard & Dormieux [7], ...). In particular, Eyre & Milton [8,9], Michel et al [10] and Monchiet & Bonnet [11] proposed accelerated algorithms to overcome the low convergence rate of the basic scheme for highly-contrasted materials.…”
Section: Introductionmentioning
confidence: 99%