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”

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

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68145535%3A_____%2F22%3A00556736" target="_blank" >RIV/68145535:_____/22:00556736 - isvavai.cz</a>

  • Alternative codes found

    RIV/61989100:27740/22:10249788 RIV/61989100:27240/22:10249788

  • Result on the web

    <a href="https://link.springer.com/content/pdf/10.1007/s11075-022-01281-3.pdf" target="_blank" >https://link.springer.com/content/pdf/10.1007/s11075-022-01281-3.pdf</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/s11075-022-01281-3" target="_blank" >10.1007/s11075-022-01281-3</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    The 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.

  • 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

    2022

  • 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

    Numerical Algorithms

  • ISSN

    1017-1398

  • e-ISSN

    1572-9265

  • Volume of the periodical

    91

  • Issue of the periodical within the volume

    2

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    29

  • Pages from-to

    773-801

  • UT code for WoS article

    000784390700002

  • EID of the result in the Scopus database

    2-s2.0-85128280893