{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T16:48:02Z","timestamp":1773938882860,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100006764","name":"Technische Universit\u00e4t Berlin","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100006764","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer. Math."],"published-print":{"date-parts":[[2024,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper deals with the equation <jats:inline-formula><jats:alternatives><jats:tex-math>$$-\\varDelta u+\\mu u=f$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>-<\/mml:mo>\n                    <mml:mi>\u0394<\/mml:mi>\n                    <mml:mi>u<\/mml:mi>\n                    <mml:mo>+<\/mml:mo>\n                    <mml:mi>\u03bc<\/mml:mi>\n                    <mml:mi>u<\/mml:mi>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:mi>f<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> on high-dimensional spaces <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathbb {R}}^m$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mrow>\n                      <mml:mi>R<\/mml:mi>\n                    <\/mml:mrow>\n                    <mml:mi>m<\/mml:mi>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, where the right-hand side <jats:inline-formula><jats:alternatives><jats:tex-math>$$f(x)=F(Tx)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>f<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mi>x<\/mml:mi>\n                    <mml:mo>)<\/mml:mo>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:mi>F<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mi>T<\/mml:mi>\n                    <mml:mi>x<\/mml:mi>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> is composed of a separable function <jats:italic>F<\/jats:italic> with an integrable Fourier transform on a space of a dimension <jats:inline-formula><jats:alternatives><jats:tex-math>$$n&gt;m$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>n<\/mml:mi>\n                    <mml:mo>&gt;<\/mml:mo>\n                    <mml:mi>m<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and a linear mapping given by a matrix <jats:italic>T<\/jats:italic> of full rank and <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mu \\ge 0$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>\u03bc<\/mml:mi>\n                    <mml:mo>\u2265<\/mml:mo>\n                    <mml:mn>0<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> is a constant. For example, the right-hand side can explicitly depend on differences <jats:inline-formula><jats:alternatives><jats:tex-math>$$x_i-x_j$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msub>\n                      <mml:mi>x<\/mml:mi>\n                      <mml:mi>i<\/mml:mi>\n                    <\/mml:msub>\n                    <mml:mo>-<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>x<\/mml:mi>\n                      <mml:mi>j<\/mml:mi>\n                    <\/mml:msub>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> of components of <jats:italic>x<\/jats:italic>. Following our publication (Yserentant in Numer Math 146:219\u2013238, 2020), we show that the solution of this equation can be expanded into sums of functions of the same structure and develop in this framework an equally simple and fast iterative method for its computation. The method is based on the observation that in almost all cases and for large problem classes the expression <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\Vert T^ty\\Vert ^2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mrow>\n                      <mml:mo>\u2016<\/mml:mo>\n                    <\/mml:mrow>\n                    <mml:msup>\n                      <mml:mi>T<\/mml:mi>\n                      <mml:mi>t<\/mml:mi>\n                    <\/mml:msup>\n                    <mml:msup>\n                      <mml:mrow>\n                        <mml:mi>y<\/mml:mi>\n                        <mml:mo>\u2016<\/mml:mo>\n                      <\/mml:mrow>\n                      <mml:mn>2<\/mml:mn>\n                    <\/mml:msup>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> deviates on the unit sphere <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\Vert y\\Vert =1$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>\u2016<\/mml:mo>\n                    <mml:mi>y<\/mml:mi>\n                    <mml:mo>\u2016<\/mml:mo>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:mn>1<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> the less from its mean value the higher the dimension <jats:italic>m<\/jats:italic> is, a concentration of measure effect. The higher the dimension <jats:italic>m<\/jats:italic>, the faster the iteration converges.<\/jats:p>","DOI":"10.1007\/s00211-024-01401-2","type":"journal-article","created":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T09:12:10Z","timestamp":1711962730000},"page":"777-811","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An iterative method for the solution of Laplace-like equations in high and very high space dimensions"],"prefix":"10.1007","volume":"156","author":[{"given":"Harry","family":"Yserentant","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,1]]},"reference":[{"key":"1401_CR1","unstructured":"Abramowitz, M., Stegun, I.A.: Handbook of mathematical functions, Dover Publications, New York, 10th printing in (1972)"},{"key":"1401_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0962492922000125","volume":"32","author":"M Bachmayr","year":"2023","unstructured":"Bachmayr, M.: Low-rank tensor methods for partial differential equations. Acta Numer. 32, 1\u2013121 (2023)","journal-title":"Acta Numer."},{"key":"1401_CR3","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1007\/s10208-013-9187-3","volume":"15","author":"M Bachmayr","year":"2015","unstructured":"Bachmayr, M., Dahmen, W.: Adaptive near-optimal rank tensor approximation for high-dimensional operator equations. Found. Comput. Math. 15, 839\u2013898 (2015)","journal-title":"Found. Comput. Math."},{"key":"1401_CR4","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.acha.2009.08.011","volume":"28","author":"G Beylkin","year":"2010","unstructured":"Beylkin, G., Monz\u00f3n, L.: Approximation by exponential sums revisited. Appl. Comput. Harmon. Anal. 28, 131\u2013149 (2010)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"1401_CR5","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1093\/imanum\/dri015","volume":"25","author":"D Braess","year":"2005","unstructured":"Braess, D., Hackbusch, W.: Approximation of $$1\/x$$ by exponential sums in $$[1,\\infty )$$. IMA J. Numer. Anal. 25, 685\u2013697 (2005)","journal-title":"IMA J. Numer. Anal."},{"key":"1401_CR6","volume-title":"Multiscale, Nonlinear and Adaptive Approximation","author":"D Braess","year":"2009","unstructured":"Braess, D., Hackbusch, W.: On the efficient computation of high-dimensional integrals and the approximation by exponential sums. In: DeVore, R., Kunoth, A. (eds.) Multiscale, Nonlinear and Adaptive Approximation. Springer, Berlin Heidelberg (2009)"},{"key":"1401_CR7","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1007\/s10208-015-9265-9","volume":"16","author":"W Dahmen","year":"2016","unstructured":"Dahmen, W., DeVore, R., Grasedyck, L., S\u00fcli, E.: Tensor-sparsity of solutions to high-dimensional elliptic partial differential equations. Found. Comput. Math. 16, 813\u2013874 (2016)","journal-title":"Found. Comput. Math."},{"key":"1401_CR8","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1002\/rsa.10073","volume":"22","author":"S Dasgupta","year":"2003","unstructured":"Dasgupta, S., Gupta, A.: An elementary proof of a theorem of Johnson and Lindenstrauss. Random Struct. Algorithms 22, 60\u201365 (2003)","journal-title":"Random Struct. Algorithms"},{"key":"1401_CR9","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF00049302","volume":"42","author":"P Frankl","year":"1990","unstructured":"Frankl, P., Maehara, H.: Some geometric applications of the beta distribution. Ann. Inst. Stat. Math. 42, 463\u2013474 (1990)","journal-title":"Ann. Inst. Stat. Math."},{"key":"1401_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00791-018-00308-4","volume":"20","author":"W Hackbusch","year":"2019","unstructured":"Hackbusch, W.: Computation of best $$L^\\infty $$ exponential sums for $$1\/x$$ by Remez\u2019 algorithm. Comput. Vis. Sci. 20, 1\u201311 (2019)","journal-title":"Comput. Vis. Sci."},{"key":"1401_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-35554-8","volume-title":"Tensor Spaces and Numerical Tensor Calculus","author":"W Hackbusch","year":"2019","unstructured":"Hackbusch, W.: Tensor Spaces and Numerical Tensor Calculus. Springer, Cham (2019)"},{"key":"1401_CR12","series-title":"Radon Series on Computational and Applied Mathematics","doi-asserted-by":"publisher","DOI":"10.1515\/9783110365917","volume-title":"Tensor Numerical Methods in Scientific Computing","author":"BN Khoromskij","year":"2018","unstructured":"Khoromskij, B.N.: Tensor Numerical Methods in Scientific Computing. Radon Series on Computational and Applied Mathematics, vol. 19. De Gruyter, Berlin M\u00fcnchen Boston (2018)"},{"key":"1401_CR13","volume-title":"NIST Handbook of Mathematical Functions","year":"2010","unstructured":"Olver, F.W.J., Lozier, D.W., Boisvert, R.F., Clark, C.W. (eds.): NIST Handbook of Mathematical Functions. Cambridge University Press, Cambridge (2010)"},{"key":"1401_CR14","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1007\/s00211-016-0856-4","volume":"136","author":"S Scholz","year":"2017","unstructured":"Scholz, S., Yserentant, H.: On the approximation of electronic wavefunctions by anisotropic Gauss and Gauss-Hermite functions. Numer. Math. 136, 841\u2013874 (2017)","journal-title":"Numer. Math."},{"key":"1401_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-022-09595-3","author":"JW Siegel","year":"2022","unstructured":"Siegel, J.W., Xu, J.: Sharp bounds on the approximation rates, metric entropy, and n-widths of shallow neural networks. Found. Comput. Math. (2022). https:\/\/doi.org\/10.1007\/s10208-022-09595-3","journal-title":"Found. Comput. Math."},{"key":"1401_CR16","volume-title":"Algorithms in Invariant Theory","author":"B Sturmfels","year":"2008","unstructured":"Sturmfels, B.: Algorithms in Invariant Theory. Springer, Wien (2008)"},{"key":"1401_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-96044-4","volume-title":"Algebra I","author":"BL van der Warden","year":"1971","unstructured":"van der Warden, B.L.: Algebra I. Springer, Berlin Heidelberg New York (1971)"},{"key":"1401_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/9781108231596","volume-title":"High-Dimensional Probability","author":"R Vershynin","year":"2018","unstructured":"Vershynin, R.: High-Dimensional Probability. Cambridge University Press, Cambridge (2018)"},{"key":"1401_CR19","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00211-020-01138-8","volume":"146","author":"H Yserentant","year":"2020","unstructured":"Yserentant, H.: On the expansion of solutions of Laplace-like equations into traces of separable higher-dimensional functions. Numer. Math. 146, 219\u2013238 (2020)","journal-title":"Numer. Math."},{"key":"1401_CR20","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1137\/20M1376029","volume":"43","author":"H Yserentant","year":"2022","unstructured":"Yserentant, H.: A measure concentration effect for matrices of high, higher, and even higher dimension. SIAM J. Matrix Anal. Appl. 43, 464\u2013478 (2022)","journal-title":"SIAM J. Matrix Anal. Appl."}],"container-title":["Numerische Mathematik"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-024-01401-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00211-024-01401-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-024-01401-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,21]],"date-time":"2024-04-21T02:40:37Z","timestamp":1713667237000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00211-024-01401-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["1401"],"URL":"https:\/\/doi.org\/10.1007\/s00211-024-01401-2","relation":{},"ISSN":["0029-599X","0945-3245"],"issn-type":[{"value":"0029-599X","type":"print"},{"value":"0945-3245","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4]]},"assertion":[{"value":"20 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 April 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}