Abstract
The paper presents a general strategy to solve ordinary differential equations (ODE), where some coefficient depend on the spatial variable and on additional random variables. The approach is based on the application of a recently developed dimension-incremental sparse fast Fourier transform. Since such algorithms require periodic signals, we discuss periodization strategies and associated necessary deperiodization modifications within the occurring solution steps. The computed approximate solutions of the ODE depend on the spatial variable and on the random variables as well. Certainly, one of the crucial challenges of the high-dimensional approximation process is to rate the influence of each variable on the solution as well as the determination of the relations and couplings within the set of variables. The suggested approach meets these challenges in a full automatic manner with reasonable computational costs, i.e., in contrast to already existing approaches, one does not need to seriously restrict the used set of ansatz functions in advance.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Bachmayr, M., Cohen, A., DeVore, R., Migliorati, G.: Sparse polynomial approximation of parametric elliptic PDEs. part II: lognormal coefficients. ESAIM: M2AN 51, 341–363 (2017)
Bachmayr, M., Cohen, A., Migliorati, G.: Sparse polynomial approximation of parametric elliptic PDEs. part I: affine coefficients. ESAIM: M2AN 51, 321–339 (2017)
Bouchot, J.-L., Rauhut, H., Schwab, C.: Multi-level Compressed Sensing Petrov-Galerkin discretization of high-dimensional parametric PDEs. arXiv:1701.01671 [math.NA] (2017)
Choi, B., Iwen, M., Krahmer, F.: Sparse harmonic transforms: A new class of sublinear-time algorithms for learning functions of many variables. Found. Comput. Math. https://doi.org/10.1007/s10208-020-09462-z (2020)
Cohen, A., DeVore, R., Schwab, C.: Analytic regularity and polynomial approximation of parametric and stochastic elliptic PDEs. Anal. Appl. (Singap.) 9, 11–47 (2010)
Cools, R., Kuo, F.Y., Nuyens, D., Suryanarayana, G.: Tent-transformed lattice rules for integration and approximation of multivariate non-periodic functions. J. Complex. 36, 166–181 (2016)
Eigel, M., Pfeffer, M., Schneider, R.: Adaptive stochastic Galerkin FEM with hierarchical tensor representations. Numer. Math. 136, 765–803 (2017)
Graham, I., Kuo, F., Nuyens, D., Scheichl, R., Sloan, I.: Quasi-Monte Carlo methods for elliptic PDEs with random coefficients and applications. J. Comp. Phys. 230, 3668–3694 (2011)
Haji-Ali, A.-L., Nobile, F., Tamellini, L., Tempone, R.: Multi-index stochastic collocation for random PDEs. Comput. Methods Appl. Mech Engrg. 306, 95–122 (2016)
Hansen, M., Schwab, C.: Analytic regularity and nonlinear approximation of a class of parametric semilinear elliptic PDEs. Math. Nachr. 286(8-9), 832–860 (2013)
Kämmerer, L.: High Dimensional Fast Fourier Transform Based on Rank-1 Lattice Sampling. Dissertation Universitätsverlag Chemnitz (2014)
Kämmerer, L.: Reconstructing multivariate trigonometric polynomials from samples along rank-1 lattices. In: Fasshauer, G. E., Schumaker, L. L. (eds.) Approximation Theory XIV: San Antonio 2013, pp 255–271. Springer International Publishing (2014)
Kȧmmerer, L.: Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials. J. Fourier Anal. Appl. 24, 17–44 (2018)
Kämmerer, L.: Constructing spatial discretizations for sparse multivariate trigonometric polynomials: That allow for a fast discrete Fourier transform. Appl. Comput. Harmon. Anal. 47, 702–729 (2019)
Kämmerer, L., Potts, D., Volkmer, T.: High-dimensional sparse FFT based on sampling along multiple rank-1 lattices. arXiv:1711.05152 (2017)
Le Maître, O.P., Knio, O.M.: Spectral methods for uncertainty quantification scientific computation. Springer, Netherlands (2010)
Potts, D., Tasche, M.: Parameter estimation for multivariate exponential sums. Electron. Trans. Numer Anal. 40, 204–224 (2013)
Potts, D., Volkmer, T.: Sparse high-dimensional FFT based on rank-1 lattice sampling. Appl. Comput Harmon. Anal. 41, 713–748 (2016)
Rauhut, H., Schwab, C.: Compressive sensing Petrov–Galerkin approximation of high-dimensional parametric operator equations. Math. Comp. 86, 661–700 (2017)
Suryanarayana, G., Nuyens, D., Cools, R.: Reconstruction and collocation of a class of non-periodic functions by sampling along tent-transformed rank-1 lattices. J. Fourier Anal. Appl. 22, 187–214 (2016)
Teckentrup, A., Jantsch, P., Webster, C., Gunzburger, M.: A multilevel stochastic collocation method for partial differential equations with random input data. SIAM/ASA J Uncertain. Quantif. 3, 1046–1074 (2015)
Volkmer, T.: SparseFFTr1l, MatlabⓇ toolbox for computing the sparse fast Fourier transform based on reconstructing rank-1 lattices in a dimension incremental way http://www.tu-chemnitz.de/~tovo/software (2015)
Funding
Open Access funding provided by Projekt DEAL. LK and DP received funding from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation, Projektnummer – 380648269).
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by: Ivan Oseledets
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Bochmann, M., Kämmerer, L. & Potts, D. A sparse FFT approach for ODE with random coefficients. Adv Comput Math 46, 65 (2020). https://doi.org/10.1007/s10444-020-09807-w
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s10444-020-09807-w
Keywords
- Ordinary differential equation with random coefficient
- Sparse fast Fourier transform
- Sparse FFT
- Lattice FFT
- Lattice rule
- Periodization
- Uncertainty quantification
- Approximation of moments
- High-dimensional approximation