2008
DOI: 10.1007/s00211-008-0186-2
|View full text |Cite
|
Sign up to set email alerts
|

Analysis of FETI methods for multiscale PDEs

Abstract: In this paper, we study a variant of the finite element tearing and interconnecting (FETI) method which is suitable for elliptic PDEs with highly heterogeneous (multiscale) coefficients α(x); in particular, coefficients with strong variation within subdomains and/or jumps that are not aligned with the subdomain interfaces. Using energy minimisation and cut-off arguments we can show rigorously that for an arbitrary (positive) coefficient function α ∈ L ∞ (Ω) the condition number of the preconditioned FETI syste… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
65
0

Year Published

2009
2009
2020
2020

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 63 publications
(65 citation statements)
references
References 36 publications
0
65
0
Order By: Relevance
“…This may be found as equation (3.15) in [41] and can then be combined with the estimate (proved in [36,Lemma 4.3]) that there exists a choice of γ which ensures that u − γ…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…This may be found as equation (3.15) in [41] and can then be combined with the estimate (proved in [36,Lemma 4.3]) that there exists a choice of γ which ensures that u − γ…”
Section: Methodsmentioning
confidence: 99%
“…It turns out that the new interior boundary conditions obtained in the present work are a genuine generalisation of the "oscillatory" boundary conditions of [19], in the sense that the two coincide if and only if the interfaces intersect the element edges orthogonally. Some of the arguments used in this paper have already been developed in the context of domain decomposition methods in [15,16,36].…”
Section: Introductionmentioning
confidence: 99%
“…al. 2008, Pechstein andScheichl 2008). Besides the interesting theoretical aspects, the BDDC algorithm has also proven to be very efficient on distributed memory architectures with tens or even hundreds of thousands of cores, as shown in different studies (Klawonn and Rheinbach 2008, Badia et.…”
Section: Introductionmentioning
confidence: 97%
“…The case of coefficients with highly discontinuous coefficients inside Ω i and across ∂Ω i has been discussed only in a few papers. For the first discretization, the standard Schwarz method with overlap and the FETI method were considered in [8] and [9], respectively. In [6], the FETI-DP was discussed, where the estimate of the condition number of the preconditioned system is better than in [9].…”
Section: Introductionmentioning
confidence: 99%
“…For the first discretization, the standard Schwarz method with overlap and the FETI method were considered in [8] and [9], respectively. In [6], the FETI-DP was discussed, where the estimate of the condition number of the preconditioned system is better than in [9]. In the present paper, we consider simpler coarse spaces and smaller local problems than in the papers mentioned above and with better condition number estimates.…”
Section: Introductionmentioning
confidence: 99%