Table of Contents
Fetching ...

Universal Fourier Neural Operators for periodic homogenization problems in linear elasticity

Binh Huy Nguyen, Matti Schneider

TL;DR

This paper shows that Fourier Neural Operators can serve as universal, training-free surrogates for solving cell problems in linear elasticity within FFT-based homogenization. By recasting the Moulinec–Suquet scheme as a neural fixed-point operator and constructing a ReLU-based double-contraction operator, the authors establish uniform fidelity across general microstructures bounded by a material contrast $\kappa$. The method achieves δ-accurate displacement fields and can match FFT solvers in memory and runtime while handling large voxel grids (over $10^8$ voxels); it also demonstrates strong generalization across multiple microstructures, including three distinct composite geometries. This work thus tightly couples FFT-based micromechanics with neural-operator theory, offering a scalable, universal tool for micromechanical analysis with potential extensions to nonlinear or inelastic regimes.

Abstract

Solving cell problems in homogenization is hard, and available deep-learning frameworks fail to match the speed and generality of traditional computational frameworks. More to the point, it is generally unclear what to expect of machine-learning approaches, let alone single out which approaches are promising. In the work at hand, we advocate Fourier Neural Operators (FNOs) for micromechanics, empowering them by insights from computational micromechanics methods based on the fast Fourier transform (FFT). We construct an FNO surrogate mimicking the basic scheme foundational for FFT-based methods and show that the resulting operator predicts solutions to cell problems with arbitrary stiffness distribution only subject to a material-contrast constraint up to a desired accuracy. In particular, there are no restrictions on the material symmetry like isotropy, on the number of phases and on the geometry of the interfaces between materials. Also, the provided fidelity is sharp and uniform, providing explicit guarantees leveraging our physical empowerment of FNOs. To show the desired universal approximation property, we construct an FNO explicitly that requires no training to begin with. Still, the obtained neural operator complies with the same memory requirements as the basic scheme and comes with runtimes proportional to classical FFT solvers. In particular, large-scale problems with more than 100 million voxels are readily handled. The goal of this work is to underline the potential of FNOs for solving micromechanical problems, linking FFT-based methods to FNOs. This connection is expected to provide a fruitful exchange between both worlds.

Universal Fourier Neural Operators for periodic homogenization problems in linear elasticity

TL;DR

This paper shows that Fourier Neural Operators can serve as universal, training-free surrogates for solving cell problems in linear elasticity within FFT-based homogenization. By recasting the Moulinec–Suquet scheme as a neural fixed-point operator and constructing a ReLU-based double-contraction operator, the authors establish uniform fidelity across general microstructures bounded by a material contrast . The method achieves δ-accurate displacement fields and can match FFT solvers in memory and runtime while handling large voxel grids (over voxels); it also demonstrates strong generalization across multiple microstructures, including three distinct composite geometries. This work thus tightly couples FFT-based micromechanics with neural-operator theory, offering a scalable, universal tool for micromechanical analysis with potential extensions to nonlinear or inelastic regimes.

Abstract

Solving cell problems in homogenization is hard, and available deep-learning frameworks fail to match the speed and generality of traditional computational frameworks. More to the point, it is generally unclear what to expect of machine-learning approaches, let alone single out which approaches are promising. In the work at hand, we advocate Fourier Neural Operators (FNOs) for micromechanics, empowering them by insights from computational micromechanics methods based on the fast Fourier transform (FFT). We construct an FNO surrogate mimicking the basic scheme foundational for FFT-based methods and show that the resulting operator predicts solutions to cell problems with arbitrary stiffness distribution only subject to a material-contrast constraint up to a desired accuracy. In particular, there are no restrictions on the material symmetry like isotropy, on the number of phases and on the geometry of the interfaces between materials. Also, the provided fidelity is sharp and uniform, providing explicit guarantees leveraging our physical empowerment of FNOs. To show the desired universal approximation property, we construct an FNO explicitly that requires no training to begin with. Still, the obtained neural operator complies with the same memory requirements as the basic scheme and comes with runtimes proportional to classical FFT solvers. In particular, large-scale problems with more than 100 million voxels are readily handled. The goal of this work is to underline the potential of FNOs for solving micromechanical problems, linking FFT-based methods to FNOs. This connection is expected to provide a fruitful exchange between both worlds.

Paper Structure

This paper contains 27 sections, 10 theorems, 116 equations, 17 figures, 8 tables.

Key Result

Theorem 1.1

For every periodic unit cell $Y$, every pair of lower and upper bounds $0<\alpha_- < \alpha_+$ on the material stiffness, every strain bound $\mathop{\mathrm{\varepsilon}}\nolimits_0 > 0$ and every error margin $\delta^{\texttt{target}}>0$, there is an FNO s.t. the estimate holds for all macroscopic strains $\bar{\bm{\varepsilon}} \in \textrm{Sym}(d)$ obeying the bound and all stiffness distrib

Figures (17)

  • Figure 1: Schematic representation of the FNO topology \ref{['eq:FNO_defn_FNO_topology']}.
  • Figure 2: Schematic of the LS-FNO construction \ref{['eq:FNO_result_FNO_construction_finalExpression']}.
  • Figure 3:
  • Figure 4:
  • Figure 5:
  • ...and 12 more figures

Theorems & Definitions (14)

  • Theorem 1.1
  • Theorem 2.1
  • Lemma 2.2
  • Proposition 3.1
  • Proposition 4.1
  • Lemma 4.2
  • Proposition 4.3
  • proof
  • Lemma A.1
  • proof
  • ...and 4 more