Rational Approximations in Robust Preconditioning of Multiphysics Problems
Stanislav Harizanov,
Ivan Lirkov and
Svetozar Margenov
Additional contact information
Stanislav Harizanov: Institute of Information and Communication Technologies, Bulgarian Academy of Sciences, 1113 Sofia, Bulgaria
Ivan Lirkov: Institute of Information and Communication Technologies, Bulgarian Academy of Sciences, 1113 Sofia, Bulgaria
Svetozar Margenov: Institute of Information and Communication Technologies, Bulgarian Academy of Sciences, 1113 Sofia, Bulgaria
Mathematics, 2022, vol. 10, issue 5, 1-18
Abstract:
Multiphysics or multiscale problems naturally involve coupling at interfaces which are manifolds of lower dimensions. The block-diagonal preconditioning of the related saddle-point systems is among the most efficient approaches for numerically solving large-scale problems in this class. At the operator level, the interface blocks of the preconditioners are fractional Laplacians. At the discrete level, we propose to replace the inverse of the fractional Laplacian with its best uniform rational approximation (BURA). The goal of the paper is to develop a unified framework for analysis of the new class of preconditioned iterative methods. As a final result, we prove that the proposed preconditioners have optimal computational complexity O ( N ) , where N is the number of unknowns (degrees of freedom) of the coupled discrete problem. The main theoretical contribution is the condition number estimates of the BURA-based preconditioners. It is important to note that the obtained estimates are completely analogous for both positive and negative fractional powers. At the end, the analysis of the behavior of the relative condition numbers is aimed at characterizing the practical requirements for minimal BURA orders for the considered Darcy–Stokes and 3D–1D examples of coupled problems.
Keywords: coupled problems; fractional elliptic equations; preconditioning; BURA method; computational complexity (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
https://www.mdpi.com/2227-7390/10/5/780/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/5/780/ (text/html)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:5:p:780-:d:761231
Access Statistics for this article
Mathematics is currently edited by Ms. Emma He
More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().