José C. Garay, Hannah Mohr, Daniel Peterseim, Christoph Zimmer
{"title":"Hierarchical Superlocalized Orthogonal Decomposition Method","authors":"José C. Garay, Hannah Mohr, Daniel Peterseim, Christoph Zimmer","doi":"10.1137/24m1694458","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Numerical Analysis, Volume 64, Issue 4, Page 1275-1319, August 2026. <br/> Abstract. We present the construction of a sparse-compressed operator that approximates the solution operator of elliptic PDEs with rough coefficients. To derive the compressed operator, we construct a hierarchical basis of an approximate-solution space, with superlocalized basis functions that are quasi-orthogonal across hierarchy levels with respect to the inner product induced by the energy norm. The superlocalization is achieved through a novel variant of the superlocalized orthogonal decomposition method that is built on corrections of basis functions arising from the localized orthogonal decomposition method. The hierarchical basis not only induces a sparse compression of the solution space but also enables an orthogonal multiresolution decomposition of the approximate-solution operator, decoupling scales and solution contributions of each level of the hierarchy. With this decomposition, the solution of the PDE reduces to the solution of a set of independent linear systems with mesh-independent condition numbers (one system per level) that can be computed simultaneously. We present an accuracy study of the compressed solution operator as well as numerical results illustrating our theoretical findings and beyond, revealing that desired optimal error rates with well-behaved superlocalized basis functions can still be attained even in the challenging case of coefficients with high-contrast channels.","PeriodicalId":49527,"journal":{"name":"SIAM Journal on Numerical Analysis","volume":"14 1","pages":""},"PeriodicalIF":3.2000,"publicationDate":"2026-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Numerical Analysis","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/24m1694458","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
SIAM Journal on Numerical Analysis, Volume 64, Issue 4, Page 1275-1319, August 2026. Abstract. We present the construction of a sparse-compressed operator that approximates the solution operator of elliptic PDEs with rough coefficients. To derive the compressed operator, we construct a hierarchical basis of an approximate-solution space, with superlocalized basis functions that are quasi-orthogonal across hierarchy levels with respect to the inner product induced by the energy norm. The superlocalization is achieved through a novel variant of the superlocalized orthogonal decomposition method that is built on corrections of basis functions arising from the localized orthogonal decomposition method. The hierarchical basis not only induces a sparse compression of the solution space but also enables an orthogonal multiresolution decomposition of the approximate-solution operator, decoupling scales and solution contributions of each level of the hierarchy. With this decomposition, the solution of the PDE reduces to the solution of a set of independent linear systems with mesh-independent condition numbers (one system per level) that can be computed simultaneously. We present an accuracy study of the compressed solution operator as well as numerical results illustrating our theoretical findings and beyond, revealing that desired optimal error rates with well-behaved superlocalized basis functions can still be attained even in the challenging case of coefficients with high-contrast channels.
期刊介绍:
SIAM Journal on Numerical Analysis (SINUM) contains research articles on the development and analysis of numerical methods. Topics include the rigorous study of convergence of algorithms, their accuracy, their stability, and their computational complexity. Also included are results in mathematical analysis that contribute to algorithm analysis, and computational results that demonstrate algorithm behavior and applicability.