• Aucun résultat trouvé

Asymptotic expansions and domain decomposition

N/A
N/A
Protected

Academic year: 2021

Partager "Asymptotic expansions and domain decomposition"

Copied!
9
0
0

Texte intégral

Loading

Figure

Fig. 1 a) Heterogeneous layer b) Homogeneous layer c) Limit domain
Fig. 2 a) Mesh used for the asymptotic computation b) Fine mesh for ε = 20 1
Table 1 L 2 -errors norms computed in Ω ε
Table 2 Mesh: N el = 11020, N el,shell = 580

Références

Documents relatifs

But the main advantage of the method is that the perturbed formulation brings extra robustness as it works even when the constraints fails to eliminate a small number of rigid

The main objective of this paper is to present an a posteriori global error estimator for a frictionless contact problem, solved by a NNDD algorithm and two error indicators which

We present a global error estimator that takes into account of the error introduced by finite element analysis as well as the error introduced by the iterative resolution of the

After having found an optimal algorithm which converges in two steps for the third order model problem, we focus on the Euler system by translating this algorithm into an algorithm

An important part of the ECtHR's case law endorses human rights 'weighing and balancing' or, at least, what seems to amount to it (e.g. under the paragraphs 2 of Articles 8-11

We first extend artificially the crack to split the domain into two subdomains with a nonpenetration condition (negative relative normal displacement) on the crack, a

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

first remark that global dual Schur complement S d is non-definite as soon as redundancies appear in the connectivity description of the interface, anyhow it is easy to prove [41]