On the approximation of a virtual coarse space for domain decomposition methods in two dimensions

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F18%3A00490551" target="_blank" >RIV/67985840:_____/18:00490551 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1142/S0218202518500343" target="_blank" >http://dx.doi.org/10.1142/S0218202518500343</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1142/S0218202518500343" target="_blank" >10.1142/S0218202518500343</a>

Jazyk výsledku

angličtina

Název v původním jazyce

On the approximation of a virtual coarse space for domain decomposition methods in two dimensions

Popis výsledku v původním jazyce

A new extension operator for a virtual coarse space is presented which can be used in domain decomposition methods for nodal elliptic problems in two dimensions. In particular, a two-level overlapping Schwarz algorithm is considered and a bound for the condition number of the preconditioned system is obtained. This bound is independent of discontinuities across the interface. The extension operator saves computational time compared to previous studies where discrete harmonic extensions are required and it is suitable for general polygonal meshes and irregular subdomains. Numerical experiments that verify the result are shown, including some with regular and irregular polygonal elements and with subdomains obtained by a mesh partitioner.

Název v anglickém jazyce

On the approximation of a virtual coarse space for domain decomposition methods in two dimensions

Popis výsledku anglicky

A new extension operator for a virtual coarse space is presented which can be used in domain decomposition methods for nodal elliptic problems in two dimensions. In particular, a two-level overlapping Schwarz algorithm is considered and a bound for the condition number of the preconditioned system is obtained. This bound is independent of discontinuities across the interface. The extension operator saves computational time compared to previous studies where discrete harmonic extensions are required and it is suitable for general polygonal meshes and irregular subdomains. Numerical experiments that verify the result are shown, including some with regular and irregular polygonal elements and with subdomains obtained by a mesh partitioner.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10101 - Pure mathematics

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2018

Kód důvěrnosti údajů

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

Název periodika

Mathematical Models and Methods in Applied Sciences

ISSN

0218-2025

e-ISSN

—

Svazek periodika

28

Číslo periodika v rámci svazku

7

Stát vydavatele periodika

SG - Singapurská republika

Počet stran výsledku

13

Strana od-do

1267-1289

Kód UT WoS článku

000435580800002

EID výsledku v databázi Scopus

2-s2.0-85045449042