A fast iteration method for solving elliptic problems with quasiperiodic coefficients

DOI10.1515/RNAM-2015-0030MaRDI QIDQ897218zbMATH OpenOpenAlexWikidataFDO

Authors Boris N. Khoromskij, Sergey Repin

Publication date 17 December 2015

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

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

zbMATH Keywords

preconditioningquantized tensor approximationtensor numerical methods\textit{a posteriori} estimatesblock-structured matriceslattice-structured and quasi-periodic systems

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Spectral, collocation and related methods for boundary value problems involving PDEs (65N35)

Abstract: The paper suggests a preconditioning type method for fast solving of elliptic equations with oscillating quasiperiodic coefficients $A_{e}psilon$ 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 $A_0$. 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 $A_e^{-1}psilon$ 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.

Recommendations

• An iterative method for elliptic problems with rapidly oscillating coefficients
• scientific article; zbMATH DE number 3860333
• scientific article; zbMATH DE number 5639770
• A Fast Iterative Algorithm for Elliptic Interface Problems
• scientific article; zbMATH DE number 227718
• A finite element method for elliptic problems with rapidly oscillating coefficients
• Fast multigrid algorithm for quasisingular classes of elliptic problems
• scientific article; zbMATH DE number 3974223
• scientific article; zbMATH DE number 4047004
• Uniform estimate of an iterative method for elliptic problems with rapidly oscillating coefficients

Cited in

(9)

• Uniform estimate of an iterative method for elliptic problems with rapidly oscillating coefficients
• scientific article; zbMATH DE number 5670201 (Why is no real title available?)
• FFT-based homogenisation accelerated by low-rank tensor approximations
• scientific article; zbMATH DE number 3974223 (Why is no real title available?)
• Quantized tensor FEM for multiscale problems: diffusion problems in two and three dimensions
• An iterative method for elliptic problems with rapidly oscillating coefficients
• Block circulant and Toeplitz structures in the linearized Hartree-Fock equation on finite lattices: tensor approach
• Rank structured approximation method for quasi-periodic elliptic problems
• QTT-finite-element approximation for multiscale problems. I: Model problems in one dimension

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)