A fast iteration method for solving elliptic problems with quasiperiodic coefficients

被引:9
作者
Khoromskij, Boris N. [1 ]
Repin, Sergey I. [2 ,3 ,4 ]
机构
[1] Max Planck Inst Math Sci, D-04103 Leipzig, Germany
[2] VA Steklov Math Inst, St Petersburg Dept, St Petersburg 191024, Russia
[3] St Petersburg State Polytech Univ, St Petersburg 195251, Russia
[4] Univ Jyvaskyla, FI-40014 Jyvaskyla, Finland
基金
俄罗斯基础研究基金会;
关键词
Lattice-structured and quasi-periodic systems; a posteriori estimates; tensor numerical methods; quantized tensor approximation; block-structured matrices; preconditioning; POSTERIORI; APPROXIMATION; ERRORS;
D O I
10.1515/rnam-2015-0030
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The paper suggests a preconditioning type method for fast solving of elliptic equations with oscillating quasiperiodic coefficients A(epsilon) specified by the small parameter epsilon > 0. We use an iteration method generated by an elliptic operator, associated with a certain simplified (e.g., homogenized) problem. On each step of this procedure it is required to solve an auxiliary elliptic boundary value problem with non-oscillating coefficients, where typically the coefficients are smooth or piecewise constant. All the information related to complicated coefficients of the original differential problem is encompasses in the linear functional, which forms the right hand side of the auxiliary problem. For this reason, inversion of the original operator associated with oscillating coefficients is avoided. The only operation required instead is multiplication of it on a vector (vector function), which can be efficiently performed due to the low QTT-rank tensor operations with the rank parameter controlled by the given precision delta > 0 independent on the parameter epsilon. We prove that solutions generated by the iteration method converge to the solution of the original problem provided that the parameter of the iteration algorithm has been properly selected. Moreover, we deduce two-sided a posteriori error estimates that do not use A(epsilon)(-1) and enable us to compute guaranteed bounds of the distance to the exact solution of the original problem for any step of the iteration process. For a wide class of oscillating coefficients, we obtain sharp QTT rank estimates for the stiffness matrix in tensor representation. In practice, this leads to the logarithmic complexity scaling of the approximation and solution process in both the FEM grid-size, and the frequency parameter 1/epsilon. Numerical tests in 1D confirm the logarithmic complexity O(vertical bar log epsilon vertical bar) of the proposed method applied to a class of complicated highly-oscillating coefficients.
引用
收藏
页码:329 / 344
页数:16
相关论文
共 50 条
  • [21] An iteration method to solve multiple constrained least squares problems
    Peng, Jingjing
    Liao, Anping
    Peng, Zhenyun
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2017, 322 : 129 - 138
  • [22] A fast genetic algorithm for solving architectural design optimization problems
    Su, Zhouzhou
    Yan, Wei
    AI EDAM-ARTIFICIAL INTELLIGENCE FOR ENGINEERING DESIGN ANALYSIS AND MANUFACTURING, 2015, 29 (04): : 457 - 469
  • [23] On semi-convergence and inexact iteration of the GSS iteration method for nonsymmetric singular saddle point problems
    Huang, Zhuo-Hong
    Huang, Ting-Zhu
    COMPUTATIONAL & APPLIED MATHEMATICS, 2018, 37 (01) : 805 - 818
  • [24] On semi-convergence and inexact iteration of the GSS iteration method for nonsymmetric singular saddle point problems
    Zhuo-Hong Huang
    Ting-Zhu Huang
    Computational and Applied Mathematics, 2018, 37 : 805 - 818
  • [25] Solving multiscale elliptic problems by sparse radial basis function neural networks
    Wang, Zhiwen
    Chen, Minxin
    Chen, Jingrun
    JOURNAL OF COMPUTATIONAL PHYSICS, 2023, 492
  • [26] The random feature method for solving interface problems
    Chi, Xurong
    Chen, Jingrun
    Yang, Zhouwang
    COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2024, 420
  • [27] DISCONTINUOUS GALERKIN METHOD FOR MONOTONE NONLINEAR ELLIPTIC PROBLEMS
    Bi, Chunjia
    Lin, Yanping
    INTERNATIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING, 2012, 9 (04) : 999 - 1024
  • [28] AN ADAPTIVE DISCONTINUOUS GALERKIN MULTISCALE METHOD FOR ELLIPTIC PROBLEMS
    Elfverson, Daniel
    Georgoulis, Emmanuil H.
    Malqvist, Axel
    MULTISCALE MODELING & SIMULATION, 2013, 11 (03) : 747 - 765
  • [29] An iterative deep Ritz method for monotone elliptic problems
    Hu, Tianhao
    Jin, Bangti
    Wang, Fengru
    JOURNAL OF COMPUTATIONAL PHYSICS, 2025, 527
  • [30] Proper orthogonal decomposition method for multiscale elliptic PDEs with random coefficients
    Ma, Dingjiong
    Ching, Wai-ki
    Zhang, Zhiwen
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2020, 370