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 条
  • [1] LOW-RANK APPROXIMATION OF ELLIPTIC BOUNDARY VALUE PROBLEMS WITH HIGH-CONTRAST COEFFICIENTS
    Bebendorf, Mario
    SIAM JOURNAL ON MATHEMATICAL ANALYSIS, 2016, 48 (02) : 932 - 949
  • [2] Approximation Schemes for Low-rank Binary Matrix Approximation Problems
    Fomin, Fedor, V
    Golovach, Petr A.
    Lokshtanov, Daniel
    Panolan, Fahad
    Saurabh, Saket
    ACM TRANSACTIONS ON ALGORITHMS, 2020, 16 (01)
  • [3] A continuous weighted low-rank approximation for collaborative filtering problems
    Del Buono, N
    Politi, T
    PATTERN RECOGNITION AND DATA MINING, PT 1, PROCEEDINGS, 2005, 3686 : 45 - 53
  • [4] Dynamical low-rank approximation
    Koch, Othmar
    Lubich, Christian
    SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2007, 29 (02) : 434 - 454
  • [5] From low-rank retractions to dynamical low-rank approximation and back
    Seguin, Axel
    Ceruti, Gianluca
    Kressner, Daniel
    BIT NUMERICAL MATHEMATICS, 2024, 64 (03)
  • [6] Low-Rank Approximations for Parametric Non-Symmetric Elliptic Problems
    Chacon Rebollo, Tomas
    Marmol, Macarena Gomez
    Munoz, Isabel Sanchez
    FRONTIERS IN PHYSICS, 2022, 10
  • [7] LOW-RANK TENSOR STRUCTURE OF SOLUTIONS TO ELLIPTIC PROBLEMS WITH JUMPING COEFFICIENTS
    Dolgov, Sergey
    Khoromskij, Boris N.
    Oseledets, Ivan
    Tyrtyshnikov, Eugene E.
    JOURNAL OF COMPUTATIONAL MATHEMATICS, 2012, 30 (01) : 14 - 23
  • [8] Low-Rank Approximation: Algorithms, Implementation, Approximation
    Khoromskij, Boris N.
    SIAM REVIEW, 2021, 63 (04) : 870 - 871
  • [9] LOW-RANK PHYSICAL MODEL RECOVERY FROM LOW-RANK SIGNAL APPROXIMATION
    Hayes, Charles Ethan
    McClellan, James H.
    Scott, Waymond R., Jr.
    2017 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2017, : 3131 - 3135
  • [10] Stochastic algorithms for solving structured low-rank matrix approximation problems
    Gillard, J. W.
    Zhigljavsky, A. A.
    COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION, 2015, 21 (1-3) : 70 - 88