Showing math.NAShow all
2 papers · 1 filter
math.NA2025
Jacobi-accelerated FFT-based solver for smooth high-contrast data
Martin Ladecký, Ivana Pultarová, François Bignonnet +3
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 mode…
math.NA2019
FFT-based homogenisation accelerated by low-rank tensor approximations
Jaroslav Vondřejc, Dishi Liu, Martin Ladecký +1
Fast Fourier transform (FFT) based methods have turned out to be an effective computational approach for numerical homogenisation. In particular, Fourier-Galerkin methods are compu…