Jacobi-accelerated FFT-based solver for smooth high-contrast data
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910024177025024 |
|---|---|
| author | Ladecký, Martin Pultarová, Ivana Bignonnet, François Jödicke, Indre Zeman, Jan Pastewka, Lars |
| author_facet | Ladecký, Martin Pultarová, Ivana Bignonnet, François Jödicke, Indre Zeman, Jan Pastewka, Lars |
| contents | The computational efficiency and rapid convergence of fast Fourier transform (FFT)-based solvers render them a powerful numerical tool for periodic cell problems in multiscale modeling. On regular grids, they tend to outperform traditional numerical methods. However, we show that their convergence slows down significantly when applied to microstructures with smooth, highly-contrasted coefficients. To address this loss of performance, we introduce a Green-Jacobi preconditioner, an enhanced successor to the standard discrete Green preconditioner that preserves the quasilinear complexity, $\mathcal{O}(N \log N)$, of conventional FFT-based solvers. Through numerical experiments, we demonstrate the effectiveness of the Jacobi-accelerated FFT (J-FFT) solver within a linear elastic framework. For problems characterized by smooth data and high material contrast, J-FFT significantly reduces the iteration count of the conjugate gradient method compared to the standard Green preconditioner. These findings are particularly relevant for phase-field fracture simulations, density-based topology optimization, and solvers that use adaption of the grid, which all introduce smooth variations in the material properties that challenge conventional FFT-based solvers. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_02613 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Jacobi-accelerated FFT-based solver for smooth high-contrast data Ladecký, Martin Pultarová, Ivana Bignonnet, François Jödicke, Indre Zeman, Jan Pastewka, Lars Numerical Analysis The computational efficiency and rapid convergence of fast Fourier transform (FFT)-based solvers render them a powerful numerical tool for periodic cell problems in multiscale modeling. On regular grids, they tend to outperform traditional numerical methods. However, we show that their convergence slows down significantly when applied to microstructures with smooth, highly-contrasted coefficients. To address this loss of performance, we introduce a Green-Jacobi preconditioner, an enhanced successor to the standard discrete Green preconditioner that preserves the quasilinear complexity, $\mathcal{O}(N \log N)$, of conventional FFT-based solvers. Through numerical experiments, we demonstrate the effectiveness of the Jacobi-accelerated FFT (J-FFT) solver within a linear elastic framework. For problems characterized by smooth data and high material contrast, J-FFT significantly reduces the iteration count of the conjugate gradient method compared to the standard Green preconditioner. These findings are particularly relevant for phase-field fracture simulations, density-based topology optimization, and solvers that use adaption of the grid, which all introduce smooth variations in the material properties that challenge conventional FFT-based solvers. |
| title | Jacobi-accelerated FFT-based solver for smooth high-contrast data |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2508.02613 |