{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T21:49:56Z","timestamp":1714686596873},"reference-count":31,"publisher":"Walter de Gruyter GmbH","issue":"1","funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["BE2626\/4-1"],"award-info":[{"award-number":["BE2626\/4-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,1,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>In this article, we extend the adaptive cross approximation (ACA) method known for the efficient approximation of discretisations of integral operators to a block-adaptive version.\nWhile ACA is usually employed to assemble hierarchical matrix approximations having the same prescribed accuracy on all blocks of the partition, for the solution of linear systems, it may be more efficient to adapt the accuracy of each block to the actual error of the solution as some blocks may be more important for the solution error than others.\nTo this end, error estimation techniques known from adaptive mesh refinement are applied to automatically improve the blockwise matrix approximation.\nThis allows to interlace the assembling of the coefficient matrix with the iterative solution.<\/jats:p>","DOI":"10.1515\/cmam-2019-0085","type":"journal-article","created":{"date-parts":[[2020,2,7]],"date-time":"2020-02-07T09:02:55Z","timestamp":1581066175000},"page":"13-29","source":"Crossref","is-referenced-by-count":1,"title":["Block-Adaptive Cross Approximation of Discrete Integral Operators"],"prefix":"10.1515","volume":"21","author":[{"given":"Maximilian","family":"Bauer","sequence":"first","affiliation":[{"name":"Faculty of Mathematics, Physics and Computer Science , University of Bayreuth , 95447 Bayreuth , Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Bebendorf","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics, Physics and Computer Science , University of Bayreuth , 95447 Bayreuth , Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2020,2,5]]},"reference":[{"key":"2023033111222163735_j_cmam-2019-0085_ref_001","doi-asserted-by":"crossref","unstructured":"M.  Ainsworth and C.  Glusa,\nAspects of an adaptive finite element method for the fractional Laplacian: A priori and a posteriori error estimates, efficient implementation and multigrid solver,\nComput. Methods Appl. Mech. Engrg. 327 (2017), 4\u201335.","DOI":"10.1016\/j.cma.2017.08.019"},{"key":"2023033111222163735_j_cmam-2019-0085_ref_002","doi-asserted-by":"crossref","unstructured":"M.  Aurada, M.  Feischl, T.  F\u00fchrer, M.  Karkulik and D.  Praetorius,\nEfficiency and optimality of some weighted-residual error estimator for adaptive 2D boundary element methods,\nComput. Methods Appl. Math. 13 (2013), no. 3, 305\u2013332.","DOI":"10.1515\/cmam-2013-0010"},{"key":"2023033111222163735_j_cmam-2019-0085_ref_003","doi-asserted-by":"crossref","unstructured":"M.  Aurada, S.  Ferraz-Leite and D.  Praetorius,\nEstimator reduction and convergence of adaptive BEM,\nAppl. Numer. Math. 62 (2012), no. 6, 787\u2013801.","DOI":"10.1016\/j.apnum.2011.06.014"},{"key":"2023033111222163735_j_cmam-2019-0085_ref_004","doi-asserted-by":"crossref","unstructured":"M.  Bebendorf,\nApproximation of boundary element matrices,\nNumer. Math. 86 (2000), no. 4, 565\u2013589.","DOI":"10.1007\/PL00005410"},{"key":"2023033111222163735_j_cmam-2019-0085_ref_005","doi-asserted-by":"crossref","unstructured":"M.  Bebendorf,\nEfficient inversion of the Galerkin matrix of general second-order elliptic operators with nonsmooth coefficients,\nMath. Comp. 74 (2005), no. 251, 1179\u20131199.","DOI":"10.1090\/S0025-5718-04-01716-8"},{"key":"2023033111222163735_j_cmam-2019-0085_ref_006","doi-asserted-by":"crossref","unstructured":"M.  Bebendorf,\nApproximate inverse preconditioning of finite element discretizations of elliptic operators with nonsmooth coefficients,\nSIAM J. Matrix Anal. Appl. 27 (2006), no. 4, 909\u2013929.","DOI":"10.1137\/S0895479803437621"},{"key":"2023033111222163735_j_cmam-2019-0085_ref_007","unstructured":"M.  Bebendorf,\nHierarchical Matrices,\nLect. Notes Comput. Sci. Eng. 63,\nSpringer, Berlin, 2008."},{"key":"2023033111222163735_j_cmam-2019-0085_ref_008","doi-asserted-by":"crossref","unstructured":"M.  Bebendorf, M.  Bollh\u00f6fer and M.  Bratsch,\nOn the spectral equivalence of hierarchical matrix preconditioners for elliptic problems,\nMath. Comp. 85 (2016), no. 302, 2839\u20132861.","DOI":"10.1090\/mcom\/3086"},{"key":"2023033111222163735_j_cmam-2019-0085_ref_009","doi-asserted-by":"crossref","unstructured":"M.  Bebendorf and R.  Grzhibovskis,\nAccelerating Galerkin BEM for linear elasticity using adaptive cross approximation,\nMath. Methods Appl. Sci. 29 (2006), no. 14, 1721\u20131747.","DOI":"10.1002\/mma.759"},{"key":"2023033111222163735_j_cmam-2019-0085_ref_010","doi-asserted-by":"crossref","unstructured":"M.  Bebendorf and W.  Hackbusch,\nStabilized rounded addition of hierarchical matrices,\nNumer. Linear Algebra Appl. 14 (2007), no. 5, 407\u2013423.","DOI":"10.1002\/nla.525"},{"key":"2023033111222163735_j_cmam-2019-0085_ref_011","doi-asserted-by":"crossref","unstructured":"M.  Bebendorf and R.  Kriemann,\nFast parallel solution of boundary integral equations and related problems,\nComput. Vis. Sci. 8 (2005), no. 3\u20134, 121\u2013135.","DOI":"10.1007\/s00791-005-0001-x"},{"key":"2023033111222163735_j_cmam-2019-0085_ref_012","doi-asserted-by":"crossref","unstructured":"M.  Bebendorf and S.  Rjasanow,\nAdaptive low-rank approximation of collocation matrices,\nComputing 70 (2003), no. 1, 1\u201324.","DOI":"10.1007\/s00607-002-1469-6"},{"key":"2023033111222163735_j_cmam-2019-0085_ref_013","unstructured":"Y.  Chen,\nA fast, direct algorithm for the Lippmann\u2013Schwinger integral equation in two dimensions,\nAdv. Comput. Math. 16 (2002), no. 2\u20133, 175\u2013190."},{"key":"2023033111222163735_j_cmam-2019-0085_ref_014","doi-asserted-by":"crossref","unstructured":"M.  D\u2019Elia and M.  Gunzburger,\nThe fractional Laplacian operator on bounded domains as a special case of the nonlocal diffusion operator,\nComput. Math. Appl. 66 (2013), no. 7, 1245\u20131260.","DOI":"10.1016\/j.camwa.2013.07.022"},{"key":"2023033111222163735_j_cmam-2019-0085_ref_015","doi-asserted-by":"crossref","unstructured":"E.  Di Nezza, G.  Palatucci and E.  Valdinoci,\nHitchhiker\u2019s guide to the fractional Sobolev spaces,\nBull. Sci. Math. 136 (2012), no. 5, 521\u2013573.","DOI":"10.1016\/j.bulsci.2011.12.004"},{"key":"2023033111222163735_j_cmam-2019-0085_ref_016","doi-asserted-by":"crossref","unstructured":"W.  D\u00f6rfler,\nA convergent adaptive algorithm for Poisson\u2019s equation,\nSIAM J. Numer. Anal. 33 (1996), no. 3, 1106\u20131124.","DOI":"10.1137\/0733054"},{"key":"2023033111222163735_j_cmam-2019-0085_ref_017","doi-asserted-by":"crossref","unstructured":"S.  Ferraz-Leite and D.  Praetorius,\nSimple a posteriori error estimators for the h-version of the boundary element method,\nComputing 83 (2008), no. 4, 135\u2013162.","DOI":"10.1007\/s00607-008-0017-4"},{"key":"2023033111222163735_j_cmam-2019-0085_ref_018","doi-asserted-by":"crossref","unstructured":"T.  Gantumur,\nAdaptive boundary element methods with convergence rates,\nNumer. Math. 124 (2013), no. 3, 471\u2013516.","DOI":"10.1007\/s00211-013-0524-x"},{"key":"2023033111222163735_j_cmam-2019-0085_ref_019","doi-asserted-by":"crossref","unstructured":"S. A.  Goreinov, E. E.  Tyrtyshnikov and N. L.  Zamarashkin,\nA theory of pseudoskeleton approximations,\nLinear Algebra Appl. 261 (1997), 1\u201321.","DOI":"10.1016\/S0024-3795(96)00301-1"},{"key":"2023033111222163735_j_cmam-2019-0085_ref_020","doi-asserted-by":"crossref","unstructured":"L.  Greengard and V.  Rokhlin,\nA fast algorithm for particle simulations,\nJ. Comput. Phys. 73 (1987), no. 2, 325\u2013348.","DOI":"10.1016\/0021-9991(87)90140-9"},{"key":"2023033111222163735_j_cmam-2019-0085_ref_021","doi-asserted-by":"crossref","unstructured":"L.  Greengard and J.  Strain,\nThe fast Gauss transform,\nSIAM J. Sci. Statist. Comput. 12 (1991), no. 1, 79\u201394.","DOI":"10.1137\/0912004"},{"key":"2023033111222163735_j_cmam-2019-0085_ref_022","doi-asserted-by":"crossref","unstructured":"W.  Hackbusch,\nA sparse matrix arithmetic based on \n                  \n                     \n                        \u210b\n                     \n                     \n                     \\mathscr{H}\n                  \n               -matrices. I. Introduction to \n                  \n                     \n                        \u210b\n                     \n                     \n                     \\mathscr{H}\n                  \n               -matrices,\nComputing 62 (1999), no. 2, 89\u2013108.","DOI":"10.1007\/s006070050015"},{"key":"2023033111222163735_j_cmam-2019-0085_ref_023","doi-asserted-by":"crossref","unstructured":"W.  Hackbusch,\nHierarchical Matrices: Algorithms and Analysis,\nSpringer Ser. Comput. Math. 49,\nSpringer, Heidelberg, 2015.","DOI":"10.1007\/978-3-662-47324-5"},{"key":"2023033111222163735_j_cmam-2019-0085_ref_024","doi-asserted-by":"crossref","unstructured":"W.  Hackbusch and B. N.  Khoromskij,\nA sparse \n                  \n                     \n                        \u210b\n                     \n                     \n                     \\mathscr{H}\n                  \n               -matrix arithmetic. II. Application to multi-dimensional problems,\nComputing 64 (2000), no. 1, 21\u201347.","DOI":"10.1007\/PL00021408"},{"key":"2023033111222163735_j_cmam-2019-0085_ref_025","doi-asserted-by":"crossref","unstructured":"M.  Karkulik, G.  Of and D.  Praetorius,\nConvergence of adaptive 3D BEM for weakly singular integral equations based on isotropic mesh-refinement,\nNumer. Methods Partial Differential Equations 29 (2013), no. 6, 2081\u20132106.","DOI":"10.1002\/num.21792"},{"key":"2023033111222163735_j_cmam-2019-0085_ref_026","doi-asserted-by":"crossref","unstructured":"F.  Lanzara, V.  Maz\u2019ya and G.  Schmidt,\nNumerical solution of the Lippmann\u2013Schwinger equation by approximate approximations,\nJ. Fourier Anal. Appl. 10 (2004), no. 6, 645\u2013660.","DOI":"10.1007\/s00041-004-3080-z"},{"key":"2023033111222163735_j_cmam-2019-0085_ref_027","doi-asserted-by":"crossref","unstructured":"E.  Liberty, F.  Woolfe, P.-G.  Martinsson, V.  Rokhlin and M.  Tygert,\nRandomized algorithms for the low-rank approximation of matrices,\nProc. Natl. Acad. Sci. USA 104 (2007), no. 51, 20167\u201320172.","DOI":"10.1073\/pnas.0709640104"},{"key":"2023033111222163735_j_cmam-2019-0085_ref_028","unstructured":"Y.  Saad,\nIterative Methods for Sparse Linear Systems,\nPWS Publishing, Boston, 1996."},{"key":"2023033111222163735_j_cmam-2019-0085_ref_029","doi-asserted-by":"crossref","unstructured":"S. A.  Sauter and C.  Schwab,\nBoundary Element Methods,\nSpringer Ser. Comput. Math. 39,\nSpringer, Berlin, 2011.","DOI":"10.1007\/978-3-540-68093-2"},{"key":"2023033111222163735_j_cmam-2019-0085_ref_030","doi-asserted-by":"crossref","unstructured":"O.  Steinbach,\nNumerical Approximation Methods for Elliptic Boundary Value Problems,\nSpringer, New York, 2008.","DOI":"10.1007\/978-0-387-68805-3"},{"key":"2023033111222163735_j_cmam-2019-0085_ref_031","doi-asserted-by":"crossref","unstructured":"E.  Tyrtyshnikov,\nMosaic-skeleton approximations. Toeplitz matrices: Structures, algorithms and applications,\nCalcolo 33 (1996), no. 1\u20132, 47\u201357.","DOI":"10.1007\/BF02575706"}],"container-title":["Computational Methods in Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/cmam\/21\/1\/article-p13.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/cmam-2019-0085\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/cmam-2019-0085\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,31]],"date-time":"2023-03-31T14:36:39Z","timestamp":1680273399000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/cmam-2019-0085\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,5]]},"references-count":31,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2020,2,7]]},"published-print":{"date-parts":[[2021,1,1]]}},"alternative-id":["10.1515\/cmam-2019-0085"],"URL":"https:\/\/doi.org\/10.1515\/cmam-2019-0085","relation":{},"ISSN":["1609-4840","1609-9389"],"issn-type":[{"value":"1609-4840","type":"print"},{"value":"1609-9389","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,5]]}}}