Papers
Topics
Authors
Recent
2000 character limit reached

Numerical analysis of several FFT-based schemes for computational homogenization

Published 6 Jan 2022 in math.NA and cs.NA | (2201.01916v1)

Abstract: We study the convergences of several FFT-based schemes that are widely applied in computational homogenization for deriving effective coefficients, and the term "convergence" here means the limiting behaviors as spatial resolutions going to infinity. Those schemes include Moulinec-Suquent's scheme [Comput Method Appl M, 157 (1998), pp. 69-94], Willot's scheme [Comptes Rendus M\'{e}canique, 343 (2015), pp. 232-245], and the FEM scheme [Int J Numer Meth Eng, 109 (2017), pp. 1461-1489]. Under some reasonable assumptions, we prove that the effective coefficients obtained by those schemes are all convergent to the theoretical ones. Moreover, for the FEM scheme, we can present several convergence rate estimates under additional regularity assumptions.

Citations (10)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.