LOW-RANK APPROXIMATION TO HETEROGENEOUS ELLIPTIC PROBLEMS

被引:3
|
作者
Li, Guanglian [1 ,2 ]
机构
[1] Univ Bonn, Inst Numer Simulat, D-53115 Bonn, Germany
[2] Imperial Coll London, London, England
来源
MULTISCALE MODELING & SIMULATION | 2018年 / 16卷 / 01期
关键词
low-rank approximation; heterogeneous elliptic problems; eigenvalue decays; asymptotic expansion; layer potential technique; DOMAIN DECOMPOSITION PRECONDITIONERS; FINITE-ELEMENT METHODS; HIGH-CONTRAST MEDIA; MULTISCALE FLOWS; COEFFICIENTS; OPERATOR; EQUATION;
D O I
10.1137/17M1120737
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In this work, we investigate the low-rank approximation of elliptic problems in heterogeneous media by means of Kolmogrov n-width and asymptotic expansion. This class of problems arises in many practical applications involving high-contrast media, and their efficient numerical approximation often relies crucially on certain low-rank structure of the solutions. We provide conditions on the permeability coefficient kappa that ensure a favorable low-rank approximation. These conditions are expressed in terms of the distribution of the inclusions in the coefficient kappa, e.g., the values, locations, and sizes of the heterogeneous regions. Further, we provide a new asymptotic analysis for high-contrast elliptic problems based on the perfect conductivity problem and layer potential techniques, which allows deriving new estimates on the spectral gap for such high-contrast problems. These results provide theoretical underpinnings for several multiscale model reduction algorithms.
引用
收藏
页码:477 / 502
页数:26
相关论文
共 50 条
  • [41] Low-Rank Approximation of Integral Operators by Interpolation
    Steffen Börm
    Lars Grasedyck
    Computing, 2004, 72 : 325 - 332
  • [42] Parameterized low-rank binary matrix approximation
    Fomin, Fedor, V
    Golovach, Petr A.
    Panolan, Fahad
    DATA MINING AND KNOWLEDGE DISCOVERY, 2020, 34 (02) : 478 - 532
  • [43] Lower bounds for the low-rank matrix approximation
    Jicheng Li
    Zisheng Liu
    Guo Li
    Journal of Inequalities and Applications, 2017
  • [44] Adaptive Low-Rank Approximation of Collocation Matrices
    M. Bebendorf
    S. Rjasanow
    Computing, 2003, 70 : 1 - 24
  • [45] Low-Rank Approximation of Weighted Tree Automata
    Rabusseau, Guillaume
    Balle, Borja
    Cohen, Shay B.
    ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 51, 2016, 51 : 839 - 847
  • [46] Low-rank matrix approximation in the infinity norm
    Gillis, Nicolas
    Shitov, Yaroslav
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2019, 581 (367-382) : 367 - 382
  • [47] On best uniform approximation by low-rank matrices
    Georgieva, I.
    Hofreither, C.
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2017, 518 : 159 - 176
  • [48] LOW-RANK APPROXIMATION AND COMPLETION OF POSITIVE TENSORS
    Aswani, Anil
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2016, 37 (03) : 1337 - 1364
  • [49] LLORMA : Local Low-Rank Matrix Approximation
    Lee, Joonseok
    Kim, Seungyeon
    Lebanon, Guy
    Singer, Yoram
    Bengio, Samy
    JOURNAL OF MACHINE LEARNING RESEARCH, 2016, 17
  • [50] ON A PROBLEM OF WEIGHTED LOW-RANK APPROXIMATION OF MATRICES
    Dutta, Aritra
    Li, Xin
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2017, 38 (02) : 530 - 553