Number of the records: 1  

Highly scalable hybrid domain decomposition method for the solution of huge scalar variational inequalities

  1. 1.
    SYSNO ASEP0556736
    Document TypeJ - Journal Article
    R&D Document TypeJournal Article
    Subsidiary JČlánek ve WOS
    TitleHighly scalable hybrid domain decomposition method for the solution of huge scalar variational inequalities
    Author(s) Dostál, Z. (CZ)
    Horák, David (UGN-S) SAI, ORCID
    Kružík, Jakub (UGN-S)
    Brzobohatý, T. (CZ)
    Vlach, O. (CZ)
    Number of authors5
    Source TitleNumerical Algorithms. - : Springer - ISSN 1017-1398
    Roč. 91, č. 2 (2022), s. 773-801
    Number of pages29 s.
    Publication formOnline - E
    Languageeng - English
    CountryNL - Netherlands
    Keywordsdomain decomposition ; variational inequality ; scalability ; massively parallel algorithms ; hybrid TFETI-DP
    Subject RIVBA - General Mathematics
    OECD categoryApplied mathematics
    R&D ProjectsLQ1602 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
    GA19-11441S GA ČR - Czech Science Foundation (CSF)
    Method of publishingLimited access
    Institutional supportUGN-S - RVO:68145535
    UT WOS000784390700002
    EID SCOPUS85128280893
    DOI10.1007/s11075-022-01281-3
    AnnotationThe unpreconditioned hybrid domain decomposition method was recently shown to be a competitive solver for linear elliptic PDE problems discretized by structured grids. Here, we plug H-TFETI-DP (hybrid total finite element tearing and interconnecting dual primal) method into the solution of huge boundary elliptic variational inequalities. We decompose the domain into subdomains that are discretized and then interconnected partly by Lagrange multipliers and partly by edge averages. After eliminating the primal variables, we get a quadratic programming problem with a well-conditioned Hessian and bound and equality constraints that is effectively solvable by specialized algorithms. We prove that the procedure enjoys optimal, i.e., asymptotically linear complexity. The analysis uses recently established bounds on the spectrum of the Schur complements of the clusters interconnected by edge/face averages. The results extend the scope of scalability of massively parallel algorithms for the solution of variational inequalities and show the outstanding efficiency of the H-TFETI-DP coarse grid split between the primal and dual variables.
    WorkplaceInstitute of Geonics
    ContactLucie Gurková, lucie.gurkova@ugn.cas.cz, Tel.: 596 979 354
    Year of Publishing2023
    Electronic addresshttps://link.springer.com/content/pdf/10.1007/s11075-022-01281-3.pdf
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.