1986
DOI: 10.1137/0723075
|View full text |Cite
|
Sign up to set email alerts
|

Iterative Methods for the Solution of Elliptic Problems on Regions Partitioned into Substructures

Abstract: Finite element problems can often naturally be divided into subproblems which correspond to subregions into which the region has been partitioned or from which it was originally assembled. A class of iterative methods is discussed in which these subproblems are solved by direct methods, while the interaction across the curves or surfaces which divide the region is handled by a conjugate gradient method.A mathematical framework for this work is provided by regularity theory for elliptic finite element problems … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
232
0
1

Year Published

1998
1998
2012
2012

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 367 publications
(238 citation statements)
references
References 22 publications
(16 reference statements)
1
232
0
1
Order By: Relevance
“…This approach is closely related (but more general) than the substructuring methods developed in e.g., [8,7,1]. If the basis functions for M H,i are chosen to be the Lagrange basis, then this procedure is similar to the construction of the local contribution to the Schur complement [39,36].…”
Section: End For End Formentioning
confidence: 99%
“…This approach is closely related (but more general) than the substructuring methods developed in e.g., [8,7,1]. If the basis functions for M H,i are chosen to be the Lagrange basis, then this procedure is similar to the construction of the local contribution to the Schur complement [39,36].…”
Section: End For End Formentioning
confidence: 99%
“…For the numerical approximation of problem (34) the standard Lagrange finite elements can be used. It is well-known that for this kind of finite elements defined on a regular family of triangulations {T h } h>0 of Ω which induces a quasi-uniform family of triangulations on Γ, assumption H3 of Theorem 4.2 is satisfied with a constant independent of h (see, for instance, [8,11,19]). Moreover it is clear that assumptions H1 and H2 are satisfied with constants independent of h; hence, also for problem (34) we can prove the results reported in Theorems 5.1, 5.3 and 5.4.…”
Section: The Wave Problem In the Frequency Domainmentioning
confidence: 99%
“…But in general, it is more effective to choose a l in each step according to a conjugate gradient algorithm (see, e.g., [6,7]). …”
Section: Error Propagationmentioning
confidence: 99%