2006
DOI: 10.1137/04061057x
|View full text |Cite
|
Sign up to set email alerts
|

An Interface-Strip Domain Decomposition Preconditioner

Abstract: In this paper we consider domain decomposition preconditioners based on a vertexoriented (VO) decomposition of the computational domain. In element-oriented (EO) decompositions, each element of the grid belongs to a different domain, while in VO decompositions each vertex belongs to a different subdomain. Based on VO decompositions, we present some preconditioners for the solution of the original system, as well as for that of the Schur complement system. Theoretical properties are investigated for a finite el… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2007
2007
2016
2016

Publication Types

Select...
3

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 30 publications
0
4
0
Order By: Relevance
“…Mesh data structures are partitioned using the so-called vertex-oriented distribution [36], which is followed by most high-performance scientific packages like Trilinos [22], hypre [19] and PETSc [8]. As a result, ParFE can be easily interfaced with the aforementioned libraries.…”
Section: Software Issuesmentioning
confidence: 99%
“…Mesh data structures are partitioned using the so-called vertex-oriented distribution [36], which is followed by most high-performance scientific packages like Trilinos [22], hypre [19] and PETSc [8]. As a result, ParFE can be easily interfaced with the aforementioned libraries.…”
Section: Software Issuesmentioning
confidence: 99%
“…The origin of this loss is the bound of the coarse component u 0 associated with the subdomain edges; see (20) and (22). Our experiments indicate that the bound of Theorem 1 is not sharp while those in [1] are.…”
Section: Instead Of (1+log(h/ ))(1+log(h/ H))mentioning
confidence: 68%
“…This result is weaker than the main result in [1] in that we have a factor (1+log(H/ h)) 2 instead of (1+log(H/ ))(1+log(H/ h)). The origin of this loss is the bound of the coarse component u 0 associated with the subdomain edges; see (20) and (22). Our experiments indicate that the bound of Theorem 1 is not sharp while those in [1] are.…”
Section: Remarkmentioning
confidence: 81%
See 1 more Smart Citation