Rank Structured Approximation Method for Quasi-Periodic Elliptic Problems
Khoromskij, B., & Repin, S. (2017). Rank Structured Approximation Method for Quasi-Periodic Elliptic Problems. Computational Methods in Applied Mathematics, 17(3), 457-477. https://doi.org/10.1515/cmam-2017-0014
Published in
Computational Methods in Applied MathematicsDate
2017Copyright
© 2017 Walter de Gruyter GmbH, Berlin/Boston. Published in this repository with the kind permission of the publisher.
We consider an iteration method for solving an elliptic type boundary value problem Au=f, where a positive definite operator A is generated by a quasi-periodic structure with rapidly changing coefficients (a typical period is characterized by a small parameter ϵ). The method is based on using a simpler operator A0 (inversion of A0 is much simpler than inversion of A), which can be viewed as a preconditioner for A. 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 A and A0. For typical quasi-periodic structures, we establish simple relations that suggest an optimal A0 (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 A admit low-rank representations and if 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/ϵ.
...
Publisher
de GruyterISSN Search the Publication Forum
1609-4840Keywords
Publication in research information system
https://converis.jyu.fi/converis/portal/detail/Publication/27081071
Metadata
Show full item recordCollections
Related items
Showing items with similar title or keywords.
-
Reliable Numerical Solution of a Class of Nonlinear Elliptic Problems Generated by the Poisson–Boltzmann Equation
Kraus, Johannes; Nakov, Svetoslav; Repin, Sergey (Walter de Gruyter GmbH, 2020)We consider a class of nonlinear elliptic problems associated with models in biophysics, which are described by the Poisson–Boltzmann equation (PBE). We prove mathematical correctness of the problem, study a suitable class ... -
Guaranteed lower bounds for cost functionals of time-periodic parabolic optimization problems
Wolfmayr, Monika (Elsevier, 2020)In this paper, a new technique is shown for deriving computable, guaranteed lower bounds of functional type (minorants) for two different cost functionals subject to a parabolic time-periodic boundary value problem. Together ... -
Guaranteed error bounds and local indicators for adaptive solvers using stabilised space-time IgA approximations to parabolic problems
Langer, Ulrich; Matculevich, Svetlana; Repin, Sergey (Elsevier, 2019)The paper is concerned with space–time IgA approximations to parabolic initial–boundary value problems. We deduce guaranteed and fully computable error bounds adapted to special features of such type of approximations and ... -
A Posteriori Modelling-Discretization Error Estimate for Elliptic Problems with L ∞-Coefficients
Weymuth, Monika; Sauter, Stefan; Repin, Sergey (Walter de Gruyter GmbH, 2017)We consider elliptic problems with complicated, discontinuous diffusion tensor A0. One of the standard approaches to numerically treat such problems is to simplify the coefficient by some approximation, say Aε, and to ... -
Partial data inverse problems and simultaneous recovery of boundary and coefficients for semilinear elliptic equations
Lassas, Matti; Liimatainen, Tony; Lin, Yi-Hsuan; Salo, Mikko (European Mathematical Society Publishing House, 2021)We study various partial data inverse boundary value problems for the semilinear elliptic equation Δu + a(x, u) = 0 in a domain in Rn by using the higher order linearization technique introduced by Lassas– Liimatainen–Lin–Salo ...