Rank structured approximation method for quasi-periodic elliptic problems

DOI10.1515/CMAM-2017-0014MaRDI QIDQ1692721zbMATH OpenOpenAlexWikidataFDO

Authors Boris N. Khoromskij, Sergey Repin

Publication date 10 January 2018

Published in Computational Methods in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1701.00039, http://urn.fi/URN:NBN:fi:jyu-201707183314

zbMATH Keywords

guaranteed error boundselliptic problems with periodic and quasi-periodic coefficientsprecondition methodstensor type methods

Mathematics Subject Classification ID

Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10) Boundary value problems for second-order elliptic equations (35J25)

Abstract: We consider an iteration method for solving an elliptic type boundary value problem $mathcalAu=f$, where a positive definite operator $mathcalA$ is generated by a quasi--periodic structure with rapidly changing coefficients (typical period is characterized by a small parameter $epsilon$) . The method is based on using a simpler operator $mathcal{A}_0$ (inversion of $mathcal{A}_0$ is much simpler than inversion of $mathcalA$), which can be viewed as a preconditioner for $mathcalA$. We prove contraction of the iteration method and establish explicit estimates of the contraction factor $q$. Certainly the value of $q$ depends on the difference between $mathcalA$ and $mathcal{A}_0$. For typical quasi--periodic structures, we establish simple relations that suggest an optimal $mathcal{A}_0$ (in a selected set of "simple" structures) and compute the corresponding contraction factor. Further, this allows us to deduce fully computable two--sided a posteriori estimates able to control numerical solutions on any iteration. The method is especially efficient if the coefficients of $mathcalA$ admit low rank representations and algebraic operations are performed in tensor structured formats. Under moderate assumptions the storage and solution complexity of our approach depends only weakly (merely linear-logarithmically) on the frequency parameter $1/epsilon$, providing the FEM approximation of the order of $O(epsilo{n}^{1+p})$, $p>0$.

Recommendations

• Low-rank approximation to heterogeneous elliptic problems
• A fast iteration method for solving elliptic problems with quasiperiodic coefficients
• Quasi-optimal rank-structured approximation to multidimensional parabolic problems by Cayley transform and Chebyshev interpolation
• Quasi-Trefftz spectral method for separable linear elliptic equations
• Finite element approximation for some quasilinear elliptic problems
• scientific article; zbMATH DE number 1277975
• Quadrature finite element method for elliptic eigenvalue problems
• A quadratically convergent algorithm for structured low-rank approximation
• Low-rank approximation of elliptic boundary value problems with high-contrast coefficients
• An approximation theory of matrix rank minimization and its application to quadratic equations

Cites work

• scientific article; zbMATH DE number 2129319 (Why is no real title available?)
• scientific article; zbMATH DE number 3136957 (Why is no real title available?)
• scientific article; zbMATH DE number 3933857 (Why is no real title available?)
• scientific article; zbMATH DE number 46646 (Why is no real title available?)
• scientific article; zbMATH DE number 3558884 (Why is no real title available?)
• scientific article; zbMATH DE number 3638921 (Why is no real title available?)
• scientific article; zbMATH DE number 195005 (Why is no real title available?)
• scientific article; zbMATH DE number 3376630 (Why is no real title available?)
• A Posteriori Estimation of Dimension Reduction Errors for Elliptic Problems on Thin Domains
• A fast iteration method for solving elliptic problems with quasiperiodic coefficients
• A posteriori error estimation for variational problems with uniformly convex functionals
• A posteriori estimates for partial differential equations
• Accuracy verification methods. Theory and algorithms
• Combined a posteriori modeling-discretization error estimate for elliptic problems with complicated interfaces
• Direct tensor-product solution of one-dimensional elliptic equations with parameter-dependent coefficients
• Fast quadrature techniques for retarded potentials based on TT/QTT tensor approximation
• Grid-based lattice summation of electrostatic potentials by assembled rank-structured tensor approximation
• Hierarchical tensor-product approximation to the inverse and related operators for high-dimensional elliptic problems
• Low-rank tensor structure of linear diffusion operators in the TT and QTT formats
• Møller-Plesset (MP2) energy correction using tensor factorization of the grid-based two-electron integrals
• Numerical solution of elliptic differential equations by reduction to the interface.
• Quantitative estimates on the periodic approximation of the corrector in stochastic homogenization
• Range-separated tensor format for many-particle modeling
• Solution of Linear Systems and Matrix Inversion in the TT-Format
• Tensor-structured preconditioners and approximate inverse of elliptic operators in \(\mathbb R^{d}\)
• Variational inequalities
• \(O(d \log N)\)-quantics approximation of \(N\)-\(d\) tensors in high-dimensional numerical modeling

Cited in

(6)

• On the Compressibility of Tensors
• FFT-based homogenisation accelerated by low-rank tensor approximations
• Solving phase-field models in the tensor train format to generate microstructures of bicontinuous composites
• Quantized tensor FEM for multiscale problems: diffusion problems in two and three dimensions
• Block circulant and Toeplitz structures in the linearized Hartree-Fock equation on finite lattices: tensor approach
• One hundred years of the Galerkin method

This page was built for publication: Rank structured approximation method for quasi-periodic elliptic problems

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