Multigrid Methods for Elliptic Problems in Unbounded Domains (Q4032014)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 151916
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multigrid Methods for Elliptic Problems in Unbounded Domains |
scientific article; zbMATH DE number 151916 |
Statements
Multigrid Methods for Elliptic Problems in Unbounded Domains (English)
0 references
4 May 1993
0 references
Poisson equation
0 references
optimal error estimates
0 references
number of multigrid iterations
0 references
Sobolev spaces
0 references
mesh grading
0 references
multigrid methods
0 references
unbounded domains
0 references
approximate boundary condition
0 references
finite element
0 references
conditioning
0 references
convergence
0 references
0.7791165709495544
0 references
0.778613269329071
0 references
This paper analyzes multigrid methods for elliptic problems in unbounded domains. To this end, one uses an approximate boundary condition (ABC) method as follows: One first replaces the unbounded domain by a bounded subdomain defined by a ball of radius centered at the origin, and the condition at infinity is replaced by a convenient approximate boundary condition. The optimal error scheme is achieved using a finite element space by grading the mesh in such a way that the element mesh sizes become larger as the distance of the element from the origin increases. One so obtains a sparse system, and it is shown that both the conditioning and the multigrid convergence rates are independent of the radius of the ball. The ball radius in the (ABC)-method must be sufficiently large in order to reduce the truncation error due to the approximate boundary condition.
0 references