{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,29]],"date-time":"2024-07-29T06:02:24Z","timestamp":1722232944239},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,7,19]],"date-time":"2020-07-19T00:00:00Z","timestamp":1595116800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,7,19]],"date-time":"2020-07-19T00:00:00Z","timestamp":1595116800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["380648269","380648269"],"award-info":[{"award-number":["380648269","380648269"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Comput Math"],"published-print":{"date-parts":[[2020,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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.<\/jats:p>","DOI":"10.1007\/s10444-020-09807-w","type":"journal-article","created":{"date-parts":[[2020,7,19]],"date-time":"2020-07-19T18:02:35Z","timestamp":1595181755000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A sparse FFT approach for ODE with random coefficients"],"prefix":"10.1007","volume":"46","author":[{"given":"Maximilian","family":"Bochmann","sequence":"first","affiliation":[]},{"given":"Lutz","family":"K\u00e4mmerer","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Potts","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,19]]},"reference":[{"key":"9807_CR1","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1051\/m2an\/2016051","volume":"51","author":"M Bachmayr","year":"2017","unstructured":"Bachmayr, M., Cohen, A., DeVore, R., Migliorati, G.: Sparse polynomial approximation of parametric elliptic PDEs. part II: lognormal coefficients. ESAIM: M2AN 51, 341\u2013363 (2017)","journal-title":"ESAIM: M2AN"},{"key":"9807_CR2","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1051\/m2an\/2016045","volume":"51","author":"M Bachmayr","year":"2017","unstructured":"Bachmayr, M., Cohen, A., Migliorati, G.: Sparse polynomial approximation of parametric elliptic PDEs. part I: affine coefficients. ESAIM: M2AN 51, 321\u2013339 (2017)","journal-title":"ESAIM: M2AN"},{"key":"9807_CR3","unstructured":"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)"},{"key":"9807_CR4","doi-asserted-by":"publisher","unstructured":"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)","DOI":"10.1007\/s10208-020-09462-z"},{"key":"9807_CR5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1142\/S0219530511001728","volume":"9","author":"A Cohen","year":"2010","unstructured":"Cohen, A., DeVore, R., Schwab, C.: Analytic regularity and polynomial approximation of parametric and stochastic elliptic PDEs. Anal. Appl. (Singap.) 9, 11\u201347 (2010)","journal-title":"Anal. Appl. (Singap.)"},{"key":"9807_CR6","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.jco.2016.05.004","volume":"36","author":"R Cools","year":"2016","unstructured":"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\u2013181 (2016)","journal-title":"J. Complex."},{"key":"9807_CR7","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1007\/s00211-016-0850-x","volume":"136","author":"M Eigel","year":"2017","unstructured":"Eigel, M., Pfeffer, M., Schneider, R.: Adaptive stochastic Galerkin FEM with hierarchical tensor representations. Numer. Math. 136, 765\u2013803 (2017)","journal-title":"Numer. Math."},{"key":"9807_CR8","doi-asserted-by":"crossref","first-page":"3668","DOI":"10.1016\/j.jcp.2011.01.023","volume":"230","author":"I Graham","year":"2011","unstructured":"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\u20133694 (2011)","journal-title":"J. Comp. Phys."},{"key":"9807_CR9","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.cma.2016.03.029","volume":"306","author":"A-L Haji-Ali","year":"2016","unstructured":"Haji-Ali, A.-L., Nobile, F., Tamellini, L., Tempone, R.: Multi-index stochastic collocation for random PDEs. Comput. Methods Appl. Mech Engrg. 306, 95\u2013122 (2016)","journal-title":"Comput. Methods Appl. Mech Engrg."},{"issue":"8-9","key":"9807_CR10","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1002\/mana.201100131","volume":"286","author":"M Hansen","year":"2013","unstructured":"Hansen, M., Schwab, C.: Analytic regularity and nonlinear approximation of a class of parametric semilinear elliptic PDEs. Math. Nachr. 286(8-9), 832\u2013860 (2013)","journal-title":"Math. Nachr."},{"key":"9807_CR11","unstructured":"K\u00e4mmerer, L.: High Dimensional Fast Fourier Transform Based on Rank-1 Lattice Sampling. Dissertation Universit\u00e4tsverlag Chemnitz (2014)"},{"key":"9807_CR12","doi-asserted-by":"crossref","unstructured":"K\u00e4mmerer, 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\u2013271. Springer International Publishing (2014)","DOI":"10.1007\/978-3-319-06404-8_14"},{"key":"9807_CR13","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s00041-016-9520-8","volume":"24","author":"L Ka\u0307mmerer","year":"2018","unstructured":"Ka\u0307mmerer, L.: Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials. J. Fourier Anal. Appl. 24, 17\u201344 (2018)","journal-title":"J. Fourier Anal. Appl."},{"key":"9807_CR14","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1016\/j.acha.2017.11.008","volume":"47","author":"L K\u00e4mmerer","year":"2019","unstructured":"K\u00e4mmerer, L.: Constructing spatial discretizations for sparse multivariate trigonometric polynomials: That allow for a fast discrete Fourier transform. Appl. Comput. Harmon. Anal. 47, 702\u2013729 (2019)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"9807_CR15","unstructured":"K\u00e4mmerer, L., Potts, D., Volkmer, T.: High-dimensional sparse FFT based on sampling along multiple rank-1 lattices. arXiv:1711.05152 (2017)"},{"key":"9807_CR16","doi-asserted-by":"crossref","unstructured":"Le Ma\u00eetre, O.P., Knio, O.M.: Spectral methods for uncertainty quantification scientific computation. Springer, Netherlands (2010)","DOI":"10.1007\/978-90-481-3520-2"},{"key":"9807_CR17","first-page":"204","volume":"40","author":"D Potts","year":"2013","unstructured":"Potts, D., Tasche, M.: Parameter estimation for multivariate exponential sums. Electron. Trans. Numer Anal. 40, 204\u2013224 (2013)","journal-title":"Electron. Trans. Numer Anal."},{"key":"9807_CR18","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1016\/j.acha.2015.05.002","volume":"41","author":"D Potts","year":"2016","unstructured":"Potts, D., Volkmer, T.: Sparse high-dimensional FFT based on rank-1 lattice sampling. Appl. Comput Harmon. Anal. 41, 713\u2013748 (2016)","journal-title":"Appl. Comput Harmon. Anal."},{"key":"9807_CR19","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1090\/mcom\/3113","volume":"86","author":"H Rauhut","year":"2017","unstructured":"Rauhut, H., Schwab, C.: Compressive sensing Petrov\u2013Galerkin approximation of high-dimensional parametric operator equations. Math. Comp. 86, 661\u2013700 (2017)","journal-title":"Math. Comp."},{"key":"9807_CR20","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s00041-015-9412-3","volume":"22","author":"G Suryanarayana","year":"2016","unstructured":"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\u2013214 (2016)","journal-title":"J. Fourier Anal. Appl."},{"key":"9807_CR21","doi-asserted-by":"crossref","first-page":"1046","DOI":"10.1137\/140969002","volume":"3","author":"A Teckentrup","year":"2015","unstructured":"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\u20131074 (2015)","journal-title":"SIAM\/ASA J Uncertain. Quantif."},{"key":"9807_CR22","unstructured":"Volkmer, T.: SparseFFTr1l, Matlab\u24c7 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)"}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-020-09807-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10444-020-09807-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-020-09807-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T23:36:13Z","timestamp":1626651373000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10444-020-09807-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,19]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["9807"],"URL":"https:\/\/doi.org\/10.1007\/s10444-020-09807-w","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"value":"1019-7168","type":"print"},{"value":"1572-9044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,19]]},"assertion":[{"value":"16 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"65"}}