TL;DR
This paper simplifies the implementation of FFT-based non-linear solvers for finite strain problems in computational micromechanics, demonstrating robustness, quadratic convergence, and accessibility with a concise Python code.
Contribution
It extends a stable variational FFT-based solver to finite strains with arbitrary models, making the method easier to implement and understand.
Findings
Robust quadratic convergence demonstrated.
Extension to finite strains with arbitrary models achieved.
A simple 59-line Python implementation provided.
Abstract
Computational micromechanics and homogenization require the solution of the mechanical equilibrium of a periodic cell that comprises a (generally complex) microstructure. Techniques that apply the Fast Fourier Transform have attracted much attention as they outperform other methods in terms of speed and memory footprint. Moreover, the Fast Fourier Transform is a natural companion of pixel-based digital images which often serve as input. In its original form, one of the biggest challenges for the method is the treatment of (geometrically) non-linear problems, partially due to the need for a uniform linear reference problem. In a geometrically linear setting, the problem has recently been treated in a variational form resulting in an unconditionally stable scheme that combines Newton iterations with an iterative linear solver, and therefore exhibits robust and quadratic convergence…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
