乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:45:38Z","timestamp":1740123938333,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["1912706"],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["1912706"],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["380648269"],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"name":"S\u00e4chsische Aufbaubank - F\u00f6rderbank","award":["100378180"]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Comput Math"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s10444-021-09916-0","type":"journal-article","created":{"date-parts":[[2021,12,7]],"date-time":"2021-12-07T08:02:51Z","timestamp":1638864171000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size"],"prefix":"10.1007","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1696-6964","authenticated-orcid":false,"given":"Craig","family":"Gross","sequence":"first","affiliation":[]},{"given":"Mark A.","family":"Iwen","sequence":"additional","affiliation":[]},{"given":"Lutz","family":"K\u00e4mmerer","sequence":"additional","affiliation":[]},{"given":"Toni","family":"Volkmer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,7]]},"reference":[{"issue":"2","key":"9916_CR1","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s10444-018-9626-4","volume":"45","author":"S Bittens","year":"2019","unstructured":"Bittens, S., Zhang, R., Iwen, M.A.: A deterministic sparse FFT for functions with structured Fourier sparsity. Adv. Comput. Math. 45(2), 519\u2013561 (2019). https:\/\/doi.org\/10.1007\/s10444-018-9626-4","journal-title":"Adv. Comput. Math."},{"issue":"4","key":"9916_CR2","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1007\/s00211-016-0861-7","volume":"136","author":"G Byrenheid","year":"2017","unstructured":"Byrenheid, G., K\u00e4mmerer, L., Ullrich, T., Volkmer, T.: Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness. Numer. Math. 136(4), 993\u20131034 (2017). https:\/\/doi.org\/10.1007\/s00211-016-0861-7","journal-title":"Numer. Math."},{"issue":"1","key":"9916_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1090\/S0894-0347-08-00610-3","volume":"22","author":"A Cohen","year":"2009","unstructured":"Cohen, A., Dahmen, W., DeVore, R.: Compressed sensing and best k-term approximation. J. Am. Math. Soc. 22(1), 211\u2013231 (2009). https:\/\/doi.org\/10.1090\/S0894-0347-08-00610-3","journal-title":"J. Am. Math. Soc."},{"key":"9916_CR4","doi-asserted-by":"publisher","unstructured":"Foucart, S., Rauhut, H.: A mathematical introduction to compressive sensing. Springer Berlin. https:\/\/doi.org\/10.1007\/978-0-8176-4948-7 (2013)","DOI":"10.1007\/978-0-8176-4948-7"},{"issue":"5","key":"9916_CR5","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1109\/MSP.2014.2329131","volume":"31","author":"AC Gilbert","year":"2014","unstructured":"Gilbert, A.C., Indyk, P., Iwen, M., Schmidt, L.: Recent developments in the sparse Fourier transform: A compressed Fourier transform for big data. IEEE Signal Process. Mag. 31(5), 91\u2013100 (2014). https:\/\/doi.org\/10.1109\/MSP.2014.2329131","journal-title":"IEEE Signal Process. Mag."},{"issue":"3","key":"9916_CR6","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10208-009-9057-1","volume":"10","author":"MA Iwen","year":"2010","unstructured":"Iwen, M.A.: Combinatorial sublinear-time Fourier algorithms. Found. Comput. Math. 10(3), 303\u2013338 (2010). https:\/\/doi.org\/10.1007\/s10208-009-9057-1","journal-title":"Found. Comput. Math."},{"issue":"1","key":"9916_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.acha.2012.03.007","volume":"34","author":"MA Iwen","year":"2013","unstructured":"Iwen, M.A.: Improved approximation guarantees for sublinear-time Fourier algorithms. Appl. Comput. Harmon. Anal. 34(1), 57\u201382 (2013). https:\/\/doi.org\/10.1016\/j.acha.2012.03.007","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"9916_CR8","unstructured":"K\u00e4mmerer, L.: High Dimensional Fast Fourier Transform Based on Rank-1 Lattice Sampling. Dissertation. Universit\u00e4tsverlag Chemnitz. http:\/\/nbn-resolving.de\/urn:nbn:de:bsz:ch1-qucosa-157673 (2014)"},{"key":"9916_CR9","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, Springer Proceedings in Mathematics & Statistics, pp. 255\u2013271. Springer International Publishing (2014)","DOI":"10.1007\/978-3-319-06404-8_14"},{"issue":"17","key":"9916_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s00041-016-9520-8","volume":"24","author":"L K\u00e4mmerer","year":"2018","unstructured":"K\u00e4mmerer, L.: Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials. J. Fourier Anal. Appl. 24(17), 17\u201344 (2018). https:\/\/doi.org\/10.1007\/s00041-016-9520-8","journal-title":"J. Fourier Anal. Appl."},{"issue":"3","key":"9916_CR11","doi-asserted-by":"publisher","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(3), 702\u2013729 (2019). https:\/\/doi.org\/10.1016\/j.acha.2017.11.008","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"9916_CR12","unstructured":"K\u00e4mmerer, L.: Multiple lattice rules for multivariate $L_{\\infty }$ approximation in the worst-case setting. arXiv:1909.02290 (2019)"},{"issue":"4","key":"9916_CR13","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/j.jco.2015.02.004","volume":"31","author":"L K\u00e4mmerer","year":"2015","unstructured":"K\u00e4mmerer, L., Potts, D., Volkmer, T.: Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling. J. Complex. 31(4), 543\u2013576 (2015). https:\/\/doi.org\/10.1016\/j.jco.2015.02.004","journal-title":"J. Complex."},{"key":"9916_CR14","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":"9916_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jat.2019.05.001","volume":"246","author":"L K\u00e4mmerer","year":"2019","unstructured":"K\u00e4mmerer, L., Volkmer, T.: Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices. J. Approx. Theory 246, 1\u201327 (2019). https:\/\/doi.org\/10.1016\/j.jat.2019.05.001","journal-title":"J. Approx. Theory"},{"key":"9916_CR16","unstructured":"K\u00e4mmerer, L.: A fast probabilistic component-by-component construction of exactly integrating rank-1 lattices and applications. arXiv:2012.14263 (2020)"},{"key":"9916_CR17","doi-asserted-by":"crossref","unstructured":"Kuo, F.Y., Migliorati, G., Nobile, F., Nuyens, D.: Function integration, reconstruction and approximation using rank-1 lattices. arXiv:1908.01178 (2020)","DOI":"10.1090\/mcom\/3595"},{"issue":"3","key":"9916_CR18","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1007\/s00041-018-9616-4","volume":"25","author":"S Merhi","year":"2019","unstructured":"Merhi, S., Zhang, R., Iwen, M.A., Christlieb, A.: A new class of fully discrete sparse Fourier transforms: Faster stable implementations with guarantees. J. Fourier Anal. Appl. 25(3), 751\u2013784 (2019). https:\/\/doi.org\/10.1007\/s00041-018-9616-4","journal-title":"J. Fourier Anal. Appl."},{"issue":"2","key":"9916_CR19","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1016\/j.acha.2016.06.001","volume":"43","author":"L Morotti","year":"2017","unstructured":"Morotti, L.: Explicit universal sampling sets in finite vector spaces. Appl. Comput. Harmon. Anal. 43(2), 354\u2013369 (2017). https:\/\/doi.org\/10.1016\/j.acha.2016.06.001","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"9916_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-04306-3","volume-title":"Numerical Fourier Analysis","author":"G Plonka","year":"2018","unstructured":"Plonka, G., Potts, D., Steidl, G., Tasche, M.: Numerical Fourier Analysis. Springer, Berlin (2018). https:\/\/doi.org\/10.1007\/978-3-030-04306-3"},{"issue":"1","key":"9916_CR21","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1215\/ijm\/1255631807","volume":"6","author":"JB Rosser","year":"1962","unstructured":"Rosser, J.B., Schoenfeld, L.: Approximate formulas for some functions of prime numbers. Ill. J. Math. 6(1), 64\u201394 (1962). https:\/\/doi.org\/10.1215\/ijm\/1255631807","journal-title":"Ill. J. Math."},{"issue":"2","key":"9916_CR22","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s11075-012-9621-7","volume":"63","author":"B Segal","year":"2013","unstructured":"Segal, B., Iwen, M.: Improved sparse Fourier approximation results: faster implementations and stronger guarantees. Numer. Algorithms 63(2), 239\u2013263 (2013). https:\/\/doi.org\/10.1007\/s11075-012-9621-7","journal-title":"Numer. Algorithms"},{"issue":"4","key":"9916_CR23","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF01909367","volume":"12","author":"V Temlyakov","year":"1986","unstructured":"Temlyakov, V.: Reconstruction of periodic functions of several variables from the values at the nodes of number-theoretic nets. Anal. Math. 12(4), 287\u2013305 (1986). https:\/\/doi.org\/10.1007\/BF01909367","journal-title":"Anal. Math."},{"key":"9916_CR24","unstructured":"Volkmer, T.: Multivariate Approximation and High-Dimensional Sparse FFT Based on Rank-1 Lattice Sampling. Dissertation. Universit\u00e4tsverlag Chemnitz. http:\/\/nbn-resolving.de\/urn:nbn:de:bsz:ch1-qucosa-222820 (2017)"}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-021-09916-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10444-021-09916-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-021-09916-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T09:26:25Z","timestamp":1640165185000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10444-021-09916-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["9916"],"URL":"https:\/\/doi.org\/10.1007\/s10444-021-09916-0","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"type":"print","value":"1019-7168"},{"type":"electronic","value":"1572-9044"}],"subject":[],"published":{"date-parts":[[2021,12]]},"assertion":[{"value":"7 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"86"}}