{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T22:11:27Z","timestamp":1685743887568},"reference-count":27,"publisher":"Walter de Gruyter GmbH","issue":"1","funder":[{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["16-31-60095"],"award-info":[{"award-number":["16-31-60095"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,1,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>In this paper we propose an efficient algorithm to\ncompute low-rank approximation to the solution of so-called \u201cLaplace-like\u201d linear systems. The idea is to transform the problem into the frequency domain, and then use cross approximation. In this case, we do not need to form explicit approximation to the inverse operator, and can approximate the solution directly, which leads to reduced complexity. We demonstrate that our method is fast and robust by using it as a solver inside Uzawa iterative method for solving the Stokes problem.<\/jats:p>","DOI":"10.1515\/cmam-2018-0026","type":"journal-article","created":{"date-parts":[[2018,7,21]],"date-time":"2018-07-21T22:15:48Z","timestamp":1532211348000},"page":"137-145","source":"Crossref","is-referenced-by-count":2,"title":["Approximate Solution of Linear Systems with Laplace-like Operators via Cross Approximation in the Frequency Domain"],"prefix":"10.1515","volume":"19","author":[{"given":"Ekaterina A.","family":"Muravleva","sequence":"first","affiliation":[{"name":"Skolkovo Institute of Science and Technology , Skolkovo Innovation Center Moscow, 143025, Nobel St. 3 , Moscow , Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan V.","family":"Oseledets","sequence":"additional","affiliation":[{"name":"Skolkovo Institute of Science and Technology , Skolkovo Innovation Center Moscow, 143025, Nobel St. 3 , Moscow , Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2018,7,21]]},"reference":[{"key":"2023033110133745357_j_cmam-2018-0026_ref_001_w2aab3b7e1665b1b6b1ab2ab1Aa","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":"2023033110133745357_j_cmam-2018-0026_ref_002_w2aab3b7e1665b1b6b1ab2ab2Aa","doi-asserted-by":"crossref","unstructured":"M.  Benzi, G. H.  Golub and J.  Liesen,\nNumerical solution of saddle point problems,\nActa Numer. 14 (2005), no. 1, 1\u2013137.","DOI":"10.1017\/S0962492904000212"},{"key":"2023033110133745357_j_cmam-2018-0026_ref_003_w2aab3b7e1665b1b6b1ab2ab3Aa","doi-asserted-by":"crossref","unstructured":"L.  de Lathauwer, B.  de Moor and J.  Vandewalle,\nA multilinear singular value decomposition,\nSIAM J. Matrix Anal. Appl. 21 (2000), 1253\u20131278.","DOI":"10.1137\/S0895479896305696"},{"key":"2023033110133745357_j_cmam-2018-0026_ref_004_w2aab3b7e1665b1b6b1ab2ab4Aa","doi-asserted-by":"crossref","unstructured":"S. V.  Dolgov,\nTT-GMRES: Solution to a linear system in the structured tensor format,\nRussian J. Numer. Anal. Math. Modelling 28 (2013), no. 2, 149\u2013172.","DOI":"10.1515\/rnam-2013-0009"},{"key":"2023033110133745357_j_cmam-2018-0026_ref_005_w2aab3b7e1665b1b6b1ab2ab5Aa","doi-asserted-by":"crossref","unstructured":"S. V.  Dolgov and D. V.  Savostyanov,\nAlternating minimal energy methods for linear systems in higher dimensions,\nSIAM J. Sci. Comput. 36 (2014), no. 5, A2248\u2013A2271.","DOI":"10.1137\/140953289"},{"key":"2023033110133745357_j_cmam-2018-0026_ref_006_w2aab3b7e1665b1b6b1ab2ab6Aa","doi-asserted-by":"crossref","unstructured":"I. P.  Gavrilyuk, W.  Hackbusch and B. N.  Khoromskij,\nTensor-product approximation to the inverse and related operators in high-dimensional elliptic problems,\nComputing 74 (2005), no. 2, 131\u2013157.","DOI":"10.1007\/s00607-004-0086-y"},{"key":"2023033110133745357_j_cmam-2018-0026_ref_007_w2aab3b7e1665b1b6b1ab2ab7Aa","doi-asserted-by":"crossref","unstructured":"S. A.  Goreinov, I. V.  Oseledets, D. V.  Savostyanov, E. E.  Tyrtyshnikov and N. L.  Zamarashkin,\nHow to find a good submatrix,\nMatrix Methods: Theory, Algorithms, Applications,\nWorld Scientific, Hackensack (2010), 247\u2013256.","DOI":"10.1142\/9789812836021_0015"},{"key":"2023033110133745357_j_cmam-2018-0026_ref_008_w2aab3b7e1665b1b6b1ab2ab8Aa","doi-asserted-by":"crossref","unstructured":"S. A.  Goreinov and E. E.  Tyrtyshnikov,\nThe maximal-volume concept in approximation by low-rank matrices,\nStructured Matrices in Mathematics, Computer Science, and Engineering,\nContemp. Math. 208,\nAmerican Mathematical Society, Providence (2001), 47\u201351.","DOI":"10.1090\/conm\/280\/4620"},{"key":"2023033110133745357_j_cmam-2018-0026_ref_009_w2aab3b7e1665b1b6b1ab2ab9Aa","doi-asserted-by":"crossref","unstructured":"L.  Grasedyck,\nExistence and computation of low Kronecker-rank approximations for large systems in tensor product structure,\nComputing 72 (2004), 247\u2013265.","DOI":"10.1007\/s00607-003-0037-z"},{"key":"2023033110133745357_j_cmam-2018-0026_ref_010_w2aab3b7e1665b1b6b1ab2ac10Aa","doi-asserted-by":"crossref","unstructured":"L.  Grasedyck,\nHierarchical singular value decomposition of tensors,\nSIAM J. Matrix Anal. Appl. 31 (2010), no. 4, 2029\u20132054.","DOI":"10.1137\/090764189"},{"key":"2023033110133745357_j_cmam-2018-0026_ref_011_w2aab3b7e1665b1b6b1ab2ac11Aa","doi-asserted-by":"crossref","unstructured":"W.  Hackbusch and D.  Braess,\nApproximation of 1x\\frac{1}{x} by exponential sums in [1,\u221e][1,\\infty],\nIMA J. Numer. Anal. 25 (2005), no. 4, 685\u2013697.","DOI":"10.1093\/imanum\/dri015"},{"key":"2023033110133745357_j_cmam-2018-0026_ref_012_w2aab3b7e1665b1b6b1ab2ac12Aa","doi-asserted-by":"crossref","unstructured":"W.  Hackbusch and S.  K\u00fchn,\nA new scheme for the tensor representation,\nJ. Fourier Anal. Appl. 15 (2009), no. 5, 706\u2013722.","DOI":"10.1007\/s00041-009-9094-9"},{"key":"2023033110133745357_j_cmam-2018-0026_ref_013_w2aab3b7e1665b1b6b1ab2ac13Aa","doi-asserted-by":"crossref","unstructured":"B. N.  Khoromskij,\nStructured rank-(r1,\u2026,rd)(r_{1},\\dots,r_{d}) decomposition of function-related operators in \u211dd\\mathbb{R}^{d},\nComput. Methods Appl. Math. 6 (2006), no. 2, 194\u2013220.","DOI":"10.2478\/cmam-2006-0010"},{"key":"2023033110133745357_j_cmam-2018-0026_ref_014_w2aab3b7e1665b1b6b1ab2ac14Aa","doi-asserted-by":"crossref","unstructured":"B. N.  Khoromskij,\n\ud835\udcaa\u2062(d\u2062log\u2061n)\\mathcal{O}(d\\log n)-quantics approximation of N-dN-d tensors in high-dimensional numerical modeling,\nConstr. Approx. 34 (2011), no. 2, 257\u2013280.","DOI":"10.1007\/s00365-011-9131-1"},{"key":"2023033110133745357_j_cmam-2018-0026_ref_015_w2aab3b7e1665b1b6b1ab2ac15Aa","doi-asserted-by":"crossref","unstructured":"B. N.  Khoromskij and V.  Khoromskaia,\nMultigrid accelerated tensor approximation of function related multidimensional arrays,\nSIAM J. Sci. Comput. 31 (2009), no. 4, 3002\u20133026.","DOI":"10.1137\/080730408"},{"key":"2023033110133745357_j_cmam-2018-0026_ref_016_w2aab3b7e1665b1b6b1ab2ac16Aa","doi-asserted-by":"crossref","unstructured":"B. N.  Khoromskij and I. V.  Oseledets,\nQuantics-TT collocation approximation of parameter-dependent and stochastic elliptic PDEs,\nComput. Methods Appl. Math. 10 (2010), no. 4, 376\u2013394.","DOI":"10.2478\/cmam-2010-0023"},{"key":"2023033110133745357_j_cmam-2018-0026_ref_017_w2aab3b7e1665b1b6b1ab2ac17Aa","unstructured":"E. A.  Muravleva,\nOn the kernel of discrete gradient operator,\nNumer. Methods Prog. 9 (2008), 93\u2013100."},{"key":"2023033110133745357_j_cmam-2018-0026_ref_018_w2aab3b7e1665b1b6b1ab2ac18Aa","unstructured":"E. A.  Muravleva,\nNumerical methods based on variational inequalities for viscoplastic Bingham media,\nPh.D. thesis, INM RAS, Moscow, 2010."},{"key":"2023033110133745357_j_cmam-2018-0026_ref_019_w2aab3b7e1665b1b6b1ab2ac19Aa","doi-asserted-by":"crossref","unstructured":"I. V.  Oseledets,\nApproximation of 2d\u00d72d2^{d}\\times 2^{d} matrices using tensor decomposition,\nSIAM J. Matrix Anal. Appl. 31 (2010), no. 4, 2130\u20132145.","DOI":"10.1137\/090757861"},{"key":"2023033110133745357_j_cmam-2018-0026_ref_020_w2aab3b7e1665b1b6b1ab2ac20Aa","doi-asserted-by":"crossref","unstructured":"I. V.  Oseledets,\nDMRG approach to fast linear algebra in the TT\u2013format,\nComput. Methods Appl. Math. 11 (2011), no. 3, 382\u2013393.","DOI":"10.2478\/cmam-2011-0021"},{"key":"2023033110133745357_j_cmam-2018-0026_ref_021_w2aab3b7e1665b1b6b1ab2ac21Aa","doi-asserted-by":"crossref","unstructured":"I. V.  Oseledets,\nTensor-train decomposition,\nSIAM J. Sci. Comput. 33 (2011), no. 5, 2295\u20132317.","DOI":"10.1137\/090752286"},{"key":"2023033110133745357_j_cmam-2018-0026_ref_022_w2aab3b7e1665b1b6b1ab2ac22Aa","doi-asserted-by":"crossref","unstructured":"I. V.  Oseledets and S. V.  Dolgov,\nSolution of linear systems and matrix inversion in the TT-format,\nSIAM J. Sci. Comput. 34 (2012), no. 5, A2718\u2013A2739.","DOI":"10.1137\/110833142"},{"key":"2023033110133745357_j_cmam-2018-0026_ref_023_w2aab3b7e1665b1b6b1ab2ac23Aa","doi-asserted-by":"crossref","unstructured":"I. V.  Oseledets and E. A.  Muravleva,\nFast orthogonalization to the kernel of discrete gradient operator with application to the Stokes problem,\nLinear Algebra Appl. 432 (2010), no. 6, 1492\u20131500.","DOI":"10.1016\/j.laa.2009.11.010"},{"key":"2023033110133745357_j_cmam-2018-0026_ref_024_w2aab3b7e1665b1b6b1ab2ac24Aa","doi-asserted-by":"crossref","unstructured":"I. V.  Oseledets, D. V.  Savostianov and E. E.  Tyrtyshnikov,\nTucker dimensionality reduction of three-dimensional arrays in linear time,\nSIAM J. Matrix Anal. Appl. 30 (2008), no. 3, 939\u2013956.","DOI":"10.1137\/060655894"},{"key":"2023033110133745357_j_cmam-2018-0026_ref_025_w2aab3b7e1665b1b6b1ab2ac25Aa","doi-asserted-by":"crossref","unstructured":"I. V.  Oseledets, D. V.  Savostyanov and E. E.  Tyrtyshnikov,\nLinear algebra for tensor problems,\nComputing 85 (2009), no. 3, 169\u2013188.","DOI":"10.1007\/s00607-009-0047-6"},{"key":"2023033110133745357_j_cmam-2018-0026_ref_026_w2aab3b7e1665b1b6b1ab2ac26Aa","doi-asserted-by":"crossref","unstructured":"I. V.  Oseledets and E. E.  Tyrtyshnikov,\nTT-cross approximation for multidimensional arrays,\nLinear Algebra Appl. 432 (2010), no. 1, 70\u201388.","DOI":"10.1016\/j.laa.2009.07.024"},{"key":"2023033110133745357_j_cmam-2018-0026_ref_027_w2aab3b7e1665b1b6b1ab2ac27Aa","doi-asserted-by":"crossref","unstructured":"E. E.  Tyrtyshnikov,\nIncomplete cross approximation in the mosaic\u2013skeleton method,\nComputing 64 (2000), no. 4, 367\u2013380.","DOI":"10.1007\/s006070070031"}],"container-title":["Computational Methods in Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/cmam\/19\/1\/article-p137.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/cmam-2018-0026\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/cmam-2018-0026\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,31]],"date-time":"2023-03-31T11:30:51Z","timestamp":1680262251000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/cmam-2018-0026\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,21]]},"references-count":27,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2018,7,7]]},"published-print":{"date-parts":[[2019,1,1]]}},"alternative-id":["10.1515\/cmam-2018-0026"],"URL":"https:\/\/doi.org\/10.1515\/cmam-2018-0026","relation":{},"ISSN":["1609-9389","1609-4840"],"issn-type":[{"value":"1609-9389","type":"electronic"},{"value":"1609-4840","type":"print"}],"subject":[],"published":{"date-parts":[[2018,7,21]]}}}