All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Hybrid TBETI domain decomposition for huge 2D scalar variational inequalities

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F24%3A10256067" target="_blank" >RIV/61989100:27240/24:10256067 - isvavai.cz</a>

  • Alternative codes found

    RIV/68145535:_____/24:00601836 RIV/61989100:27740/24:10256067

  • Result on the web

    <a href="https://onlinelibrary.wiley.com/doi/10.1002/nme.7597" target="_blank" >https://onlinelibrary.wiley.com/doi/10.1002/nme.7597</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1002/nme.7597" target="_blank" >10.1002/nme.7597</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Hybrid TBETI domain decomposition for huge 2D scalar variational inequalities

  • Original language description

    The unpreconditioned H-TFETI-DP (hybrid total finite element tearing and interconnecting dual-primal) domain decomposition method introduced by Klawonn and Rheinbach turned out to be an effective solver for variational inequalities discretized by huge structured grids. The basic idea is to decompose the domain into non-overlapping subdomains, interconnect some adjacent subdomains into clusters on a primal level, and enforce the continuity of the solution across both the subdomain and cluster interfaces by Lagrange multipliers. After eliminating the primal variables, we get a reasonably conditioned quadratic programming (QP) problem with bound and equality constraints. Here, we first reduce the continuous problem to the subdomains&apos; boundaries, then discretize it using the boundary element method, and finally interconnect the subdomains by the averages of adjacent edges. The resulting QP problem in multipliers with a small coarse grid is solved by specialized QP algorithms with optimal complexity. The method can be considered as a three-level multigrid with the coarse grids split between primal and dual variables. Numerical experiments illustrate the efficiency of the presented H-TBETI-DP (hybrid total boundary element tearing and interconnecting dual-primal) method and nice spectral properties of the discretized Steklov-Poincar &amp; eacute; operators as compared with their finite element counterparts.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10102 - Applied mathematics

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2024

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    International Journal for Numerical Methods in Engineering

  • ISSN

    0029-5981

  • e-ISSN

    1097-0207

  • Volume of the periodical

    125

  • Issue of the periodical within the volume

    24

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    23

  • Pages from-to

    nestránkováno

  • UT code for WoS article

    001324133600001

  • EID of the result in the Scopus database

    2-s2.0-85205534496