1998
DOI: 10.1016/s0764-4442(97)89801-1
|View full text |Cite
|
Sign up to set email alerts
|

Convergence d'un schéma itératif explicite

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2000
2000
2005
2005

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…Note in particular that the sum which defines V H h is, a priori, not a direct sum. This property makes the above algorithm different from most known iterative schemes (see for example the scheme by Laydi [26]). The algorithm resembles the FAC method, see for example the works from McCormick et al [29][30][31], or possibly a hierarchical method (see for example the papers from Yserentant [44,45], Bank et al [10] and Bank and Smith [11]) with a mortar method (see [2]).…”
Section: Algorithm 1 1 Setmentioning
confidence: 96%
“…Note in particular that the sum which defines V H h is, a priori, not a direct sum. This property makes the above algorithm different from most known iterative schemes (see for example the scheme by Laydi [26]). The algorithm resembles the FAC method, see for example the works from McCormick et al [29][30][31], or possibly a hierarchical method (see for example the papers from Yserentant [44,45], Bank et al [10] and Bank and Smith [11]) with a mortar method (see [2]).…”
Section: Algorithm 1 1 Setmentioning
confidence: 96%