SFFT-Based Homogenization: Using Tensor Trains to Enhance FFT-Based Homogenization

TL;DR

This paper introduces a quantum-inspired tensor train method to significantly accelerate FFT-based homogenization, reducing computational time and memory use for complex microstructures without requiring quantum hardware.

Contribution

It presents a novel SFFT-based homogenization algorithm that leverages tensor trains and quantum-inspired techniques to improve efficiency over traditional FFT methods.

Findings

Achieves exponential improvements in time complexity and memory efficiency.

Demonstrates effectiveness across complex microstructures.

Remains executable on classical hardware.

Abstract

Homogenization is a fundamental technique for estimating the macroscopic properties of materials with microscale heterogeneity. Among Homogenization methods, the FFT-based Homogenization algorithm has become widely used due to its computational efficiency and ability to handle complex microstructures. Nevertheless, even with GPU acceleration, FFT-based Homogenization for industrial applications remains excessively time-consuming, particularly when generating elastic training data for AI models. This is due to the curse of dimensionality, which arises from the algorithms reliance on the Fast Fourier Transform, creating a fundamental bottleneck. In this paper, we propose a quantum-inspired SFFT-based Homogenization algorithm that leverages the improved time complexity of a Tensor Train variant of the Quantum Fourier Transform. By additionally exploiting structural properties of the underlying microstructure, our method achieves exponential improvements in time complexity and memory efficiency compared to the traditional FFT-based technique - all while remaining executable on classical hardware. We evaluate the performance of our algorithm across increasingly complex microstructures, demonstrating its potential advantages and limitations.