{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:16:10Z","timestamp":1786979770670,"version":"build-2736575974"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T00:00:00Z","timestamp":1639094400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T00:00:00Z","timestamp":1639094400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Universit\u00e4t Bayreuth"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer. Math."],"published-print":{"date-parts":[[2022,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    A method for the kernel-independent construction of\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\mathcal {H}^2$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msup>\n                            <mml:mrow>\n                              <mml:mi>H<\/mml:mi>\n                            <\/mml:mrow>\n                            <mml:mn>2<\/mml:mn>\n                          <\/mml:msup>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    -matrix approximations to non-local operators is proposed. Special attention is paid to the adaptive construction of nested bases. As a side result, new error estimates for adaptive cross approximation\u00a0(ACA) are presented which have implications on the pivoting strategy of ACA.\n                  <\/jats:p>","DOI":"10.1007\/s00211-021-01255-y","type":"journal-article","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T08:03:38Z","timestamp":1639123418000},"page":"1-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Kernel-independent adaptive construction of $$\\mathcal {H}^2$$-matrix approximations"],"prefix":"10.1007","volume":"150","author":[{"given":"M.","family":"Bauer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.","family":"Bebendorf","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"B.","family":"Feist","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,12,10]]},"reference":[{"issue":"2","key":"1255_CR1","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1137\/15M1033952","volume":"55","author":"G Acosta","year":"2017","unstructured":"Acosta, G., Borthagaray, J.P.: A fractional Laplace equation: regularity of solutions and finite element approximations. SIAM J. Numer. Anal. 55(2), 472\u2013495 (2017)","journal-title":"SIAM J. Numer. Anal."},{"key":"1255_CR2","doi-asserted-by":"crossref","unstructured":"Ainsworth, M., Clusa, C.: Towards an efficient finite element method for the integral fractional laplacian on polygonal domains. In: Contemporary Computational Mathematics\u2014A Celebration of the 80th Birthday of Ian Sloan, pp. 17\u201358. Springer, Cham (2018)","DOI":"10.1007\/978-3-319-72456-0_2"},{"key":"1255_CR3","unstructured":"Arya, S., Mount, D.M.: Approximate nearest neighbor searching. In: Proceedings of 4th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 271\u2013280. ACM Press, New York (1993)"},{"key":"1255_CR4","doi-asserted-by":"crossref","unstructured":"Arya, S., Mount, D.M.: Approximate range searching. In: Proceedings of 11th Annual ACM Symposium on Computational Geometry, pp. 172\u2013181. ACM Press, New York (1995)","DOI":"10.1145\/220279.220298"},{"key":"1255_CR5","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S Arya","year":"1998","unstructured":"Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching. J. ACM 45, 891\u2013923 (1998)","journal-title":"J. ACM"},{"key":"1255_CR6","volume-title":"Tables of Integral Transforms, Volume 2. Bateman Manuscript Project","author":"H Bateman","year":"1954","unstructured":"Bateman, H., Erd\u00e9lyi, A.: Tables of Integral Transforms, Volume 2. Bateman Manuscript Project. McGraw-Hill, New York (1954)"},{"key":"1255_CR7","doi-asserted-by":"crossref","unstructured":"B\u00e4ck, J., Nobile, F., Tamellini, L., Tempone, R.: Stochastic spectral Galerkin and collocation methods for PDEs with random coefficients: a numerical comparison. In: Spectral and High Order Methods for Partial Differential Equations, LNCSE 76, pp. 43\u201362. Springer (2011)","DOI":"10.1007\/978-3-642-15337-2_3"},{"issue":"4","key":"1255_CR8","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/PL00005410","volume":"86","author":"M Bebendorf","year":"2000","unstructured":"Bebendorf, M.: Approximation of boundary element matrices. Numer. Math. 86(4), 565\u2013589 (2000)","journal-title":"Numer. Math."},{"key":"1255_CR9","volume-title":"Hierarchical Matrices: A Means to Efficiently Solve Elliptic Boundary Value Problems, Volume\u00a063 of Lecture Notes in Computational Science and Engineering","author":"M Bebendorf","year":"2008","unstructured":"Bebendorf, M.: Hierarchical Matrices: A Means to Efficiently Solve Elliptic Boundary Value Problems, Volume\u00a063 of Lecture Notes in Computational Science and Engineering. Springer, Berlin (2008)"},{"key":"1255_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00211-014-0656-7","volume":"130","author":"M Bebendorf","year":"2015","unstructured":"Bebendorf, M., Kuske, C., Venn, R.: Wideband nested cross approximation for Helmholtz problems. Numer. Math. 130, 1\u201334 (2015)","journal-title":"Numer. Math."},{"key":"1255_CR11","doi-asserted-by":"crossref","unstructured":"B\u00f6rm, S.: Efficient Numerical Methods for Non-local Operators. Tracts in Mathematics 14. EMS (2010)","DOI":"10.4171\/091"},{"key":"1255_CR12","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s00211-005-0618-1","volume":"205","author":"S B\u00f6rm","year":"2005","unstructured":"B\u00f6rm, S., Grasedyck, L.: Hybrid cross approximation of integral operators. Numer. Math. 205, 221\u2013249 (2005)","journal-title":"Numer. Math."},{"issue":"4","key":"1255_CR13","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/s00211-004-0564-3","volume":"99","author":"S B\u00f6rm","year":"2005","unstructured":"B\u00f6rm, S., L\u00f6hndorf, M., Melenk, J.M.: Approximation of integral operators by variable-order interpolation. Numer. Math. 99(4), 605\u2013643 (2005)","journal-title":"Numer. Math."},{"key":"1255_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-03413-8_3","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.A., Kunoth, A. (eds.) Multiscale, Nonlinear and Adaptive Approximation, pp. 39\u201374. Springer, Berlin (2009)"},{"key":"1255_CR15","series-title":"Cambridge Monographs on Applied and Computational Mathematics","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543241","volume-title":"Radial Basis Functions: Theory and Implementations","author":"M Buhmann","year":"2003","unstructured":"Buhmann, M.: Radial Basis Functions: Theory and Implementations. Cambridge Monographs on Applied and Computational Mathematics, Cambridge University Press, Cambridge (2003)"},{"issue":"2","key":"1255_CR16","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1006\/jcph.1999.6355","volume":"155","author":"H Cheng","year":"1999","unstructured":"Cheng, H., Greengard, L., Rokhlin, V.: A fast adaptive multipole algorithm in three dimensions. J. Comput. Phys. 155(2), 468\u2013498 (1999)","journal-title":"J. Comput. Phys."},{"issue":"4","key":"1255_CR17","first-page":"1","volume":"33","author":"BA Cipra","year":"2000","unstructured":"Cipra, B.A.: The best of the 20th century: editors name top 10 algorithms. SIAM News 33(4), 1\u20132 (2000)","journal-title":"SIAM News"},{"issue":"2","key":"1255_CR18","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0021-9991(87)90140-9","volume":"73","author":"LF Greengard","year":"1987","unstructured":"Greengard, L.F., Rokhlin, V.: A fast algorithm for particle simulations. J. Comput. Phys. 73(2), 325\u2013348 (1987)","journal-title":"J. Comput. Phys."},{"key":"1255_CR19","doi-asserted-by":"crossref","unstructured":"Greengard, L.F., Rokhlin, V.: A new version of the fast multipole method for the Laplace equation in three dimensions. In: Acta Numerica, 1997, Volume\u00a06 of Acta Numerica, pp. 229\u2013269. Cambridge University Press, Cambridge (1997)","DOI":"10.1017\/S0962492900002725"},{"issue":"2","key":"1255_CR20","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s006070050015","volume":"62","author":"W Hackbusch","year":"1999","unstructured":"Hackbusch, W.: A sparse matrix arithmetic based on $$\\cal{H}$$-matrices. Part I: introduction to $$\\cal{H}$$-matrices. Computing 62(2), 89\u2013108 (1999)","journal-title":"Computing"},{"issue":"1","key":"1255_CR21","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/PL00021408","volume":"64","author":"W Hackbusch","year":"2000","unstructured":"Hackbusch, W., Khoromskij, B.N.: A sparse $$\\cal{H}$$-matrix arithmetic. Part II: application to multi-dimensional problems. Computing 64(1), 21\u201347 (2000)","journal-title":"Computing"},{"key":"1255_CR22","series-title":"Springer Series in Computational Mathematics Springer Series in Computational Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47324-5","volume-title":"Hierarchical Matrices: Algorithms and Analysis","author":"W Hackbusch","year":"2015","unstructured":"Hackbusch, W.: Hierarchical Matrices: Algorithms and Analysis. Springer Series in Computational Mathematics Springer Series in Computational Mathematics, Springer, Berlin (2015)"},{"key":"1255_CR23","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-642-59709-1_2","volume-title":"Lectures on Applied Mathematics","author":"W Hackbusch","year":"2000","unstructured":"Hackbusch, W., Khoromskij, B.N., Sauter, S.A.: On $$\\cal{H}^2$$-matrices. In: Bungartz, H.-J., Hoppe, R.H.W., Zenger, Ch. (eds.) Lectures on Applied Mathematics, pp. 9\u201329. Springer, Berlin (2000)"},{"key":"1255_CR24","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.cma.2013.03.022","volume":"261","author":"H Harbrecht","year":"2013","unstructured":"Harbrecht, H., Peters, M.: Comparison of fast boundary element methods on parametric surfaces. Comput. Methods Appl. Mech. Eng. 261, 39\u201355 (2013)","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"1255_CR25","doi-asserted-by":"publisher","first-page":"8","DOI":"10.4064\/ap-4-1-8-13","volume":"4","author":"F Leja","year":"1957","unstructured":"Leja, F.: Sur certaines suites li\u00e9es aux ensembles plans et leur application \u00e0 la repr\u00e9sentation conforme. Ann. Polon. Math. 4, 8\u201313 (1957)","journal-title":"Ann. Polon. Math."},{"issue":"4","key":"1255_CR26","first-page":"77","volume":"4","author":"WR Madych","year":"1988","unstructured":"Madych, W.R., Nelson, S.A.: Multivariate interpolation and conditionally positive definite functions. Approx. Theory Appl. 4(4), 77\u201389 (1988)","journal-title":"Approx. Theory Appl."},{"key":"1255_CR27","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1090\/S0025-5718-1990-0993931-7","volume":"54","author":"WR Madych","year":"1990","unstructured":"Madych, W.R., Nelson, S.A.: Multivariate interpolation and conditionally positive definite functions II. Math. Comput. 54, 211\u2013230 (1990)","journal-title":"Math. Comput."},{"key":"1255_CR28","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/0021-9045(92)90058-V","volume":"70","author":"WR Madych","year":"1992","unstructured":"Madych, W.R., Nelson, S.A.: Bounds on multivariate polynomials and exponential error estimates for multiquadric interpolation. J. Approx. Theory 70, 94\u2013114 (1992)","journal-title":"J. Approx. Theory"},{"key":"1255_CR29","volume-title":"Strongly Elliptic Systems and Boundary Integral Equations","author":"W McLean","year":"2000","unstructured":"McLean, W.: Strongly Elliptic Systems and Boundary Integral Equations. Cambridge University Press, Cambridge (2000)"},{"issue":"2","key":"1255_CR30","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0021-9991(85)90002-6","volume":"60","author":"V Rokhlin","year":"1985","unstructured":"Rokhlin, V.: Rapid solution of integral equations of classical potential theory. J. Comput. Phys. 60(2), 187\u2013207 (1985)","journal-title":"J. Comput. Phys."},{"key":"1255_CR31","series-title":"Cambridge Monographs on Applied and Computational Mathematics","volume-title":"Scattered Dara Approximation","author":"H Wendland","year":"2005","unstructured":"Wendland, H.: Scattered Dara Approximation. Cambridge Monographs on Applied and Computational Mathematics, Cambridge University Press, Cambridge (2005)"},{"issue":"2","key":"1255_CR32","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/j.jcp.2003.11.021","volume":"196","author":"L Ying","year":"2004","unstructured":"Ying, L., Biros, G., Zorin, D.: A kernel-independent adaptive fast multipole algorithm in two and three dimensions. J. Comput. Phys. 196(2), 591\u2013626 (2004)","journal-title":"J. Comput. Phys."}],"container-title":["Numerische Mathematik"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-021-01255-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00211-021-01255-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00211-021-01255-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T17:12:02Z","timestamp":1673975522000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00211-021-01255-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,10]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["1255"],"URL":"https:\/\/doi.org\/10.1007\/s00211-021-01255-y","relation":{},"ISSN":["0029-599X","0945-3245"],"issn-type":[{"value":"0029-599X","type":"print"},{"value":"0945-3245","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12,10]]},"assertion":[{"value":"2 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}