A fast iteration method for solving elliptic problems with quasiperiodic coefficients

From MaRDI portal
Publication:897218

DOI10.1515/RNAM-2015-0030zbMATH Open1328.65098arXiv1510.00284OpenAlexW2962940467WikidataQ110234283 ScholiaQ110234283MaRDI QIDQ897218FDOQ897218


Authors: Boris N. Khoromskij, Sergey Repin Edit this on Wikidata


Publication date: 17 December 2015

Published in: Russian Journal of Numerical Analysis and Mathematical Modelling (Search for Journal in Brave)

Abstract: The paper suggests a preconditioning type method for fast solving of elliptic equations with oscillating quasiperiodic coefficients Aepsilon 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 A0. 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. Therefore, explicit inversion of the original operator associated with oscillating coefficients is avoided. The only operation used instead is multiplication of the operator by a vector (vector function), which can be efficiently performed due to the low-rank QTT tensor operations with the rank parameter controlled by the given precision delta>0 independent on the parameter epsilon. We deduce two--sided a posteriori error estimates that do not use Ae1psilon and provide guaranteed two sided bounds of the distance to the exact solution of the original problem for any step of the iteration process. The second part is concerned with realisations of the iteration method. 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 O(vertlogepsilonvert) cost in terms of epsilon. Numerical tests in 1D confirm the logarithmic complexity scaling of our method applied to a class of complicated quasiperiodic coefficients.


Full work available at URL: https://arxiv.org/abs/1510.00284




Recommendations





Cited In (7)





This page was built for publication: A fast iteration method for solving elliptic problems with quasiperiodic coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897218)