2021/09/09 by Lutz Kämmerer, Daniel Potts, Kämmerer, Lutz +3
Computer Science · Decision Sciences · Engineering · #35C09 #35R60 #42B05 #42B37 #60-08 #65C20 #65C30 #65D15 #65T40 #65T50 #Advanced Numerical Methods in Computational Mathematics #FOS: Mathematics #Image and Signal Denoising Methods #Numerical Analysis (math.NA) #Probabilistic and Robust Engineering Design
paper · pdf · doi:10.48550/arxiv.2109.04131
openalex publication_date 2021/09/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We develop the uniform sparse Fast Fourier Transform (usFFT), an efficient, non-intrusive, adaptive algorithm for the solution of elliptic partial differential equations with random coefficients. The algorithm is an adaption of the sparse Fast Fourier Transform (sFFT), a dimension-incremental algorithm, which tries to detect the most important frequencies in a given search domain and therefore adaptively generates a suitable Fourier basis corresponding to the approximately largest Fourier coefficients of the function. The usFFT does this w.r.t. the stochastic domain of the PDE simultaneously for multiple fixed spatial nodes, e.g., nodes of a finite element mesh. The key idea of joining the detected frequency sets in each dimension increment results in a Fourier approximation space, which fits uniformly for all these spatial nodes. This strategy allows for a faster and more efficient computation due to a significantly smaller amount of samples needed, than just using other algorithms, e.g., the sFFT for each spatial node separately. We test the usFFT for different examples using periodic, affine and lognormal random coefficients in the PDE problems.