TY - JOUR

T1 - Fast Domain Decomposition Algorithms for Elliptic Problems with Piecewise Variable Orthotropism

AU - Korneev, V.G.

PY - 2013

Y1 - 2013

N2 - Second order elliptic equations are considered in the unit square, which is decomposed into subdomains by an arbitrary nonuniform orthogonal grid. For the elliptic operator we assume that the energy integral contains only squares of first order derivatives with coefficients, which are arbitrary positive finite numbers but different for each subdomain. The orthogonal finite element mesh has to satisfy only one condition: it is uniform on each subdomain. No other conditions on the coefficients of the elliptic equation and on the step sizes of the discretization and decomposition are imposed. For the resulting discrete finite element problem, we suggest domain decomposition algorithms of linear total arithmetical complexity, not depending on any of the three factors contributing to the orthotropism of the discretization on subdomains. The main problem of designing such an algorithm is the preconditioning of the inter-subdomain Schur complement, which is related in part to obtaining boundary norms for discrete ha

AB - Second order elliptic equations are considered in the unit square, which is decomposed into subdomains by an arbitrary nonuniform orthogonal grid. For the elliptic operator we assume that the energy integral contains only squares of first order derivatives with coefficients, which are arbitrary positive finite numbers but different for each subdomain. The orthogonal finite element mesh has to satisfy only one condition: it is uniform on each subdomain. No other conditions on the coefficients of the elliptic equation and on the step sizes of the discretization and decomposition are imposed. For the resulting discrete finite element problem, we suggest domain decomposition algorithms of linear total arithmetical complexity, not depending on any of the three factors contributing to the orthotropism of the discretization on subdomains. The main problem of designing such an algorithm is the preconditioning of the inter-subdomain Schur complement, which is related in part to obtaining boundary norms for discrete ha

KW - Computational Mechanics Finite Element Methods Finite Elements

U2 - 10.1007/978-3-642-30316-6-3

DO - 10.1007/978-3-642-30316-6-3

M3 - Article

VL - 66

SP - 57

EP - 89

JO - Lecture Notes in Applied and Computational Mechanics

JF - Lecture Notes in Applied and Computational Mechanics

SN - 1613-7736

ER -