Convergence and the optimal choice of the relaxation parameter for a class of iterative methods (Q2490213)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Convergence and the optimal choice of the relaxation parameter for a class of iterative methods |
scientific article; zbMATH DE number 5021293
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence and the optimal choice of the relaxation parameter for a class of iterative methods |
scientific article; zbMATH DE number 5021293 |
Statements
Convergence and the optimal choice of the relaxation parameter for a class of iterative methods (English)
0 references
28 April 2006
0 references
The authors consider an iterative scheme, which is specially associated with domain decomposition methods. In particular they address the necessary conditions for the convergence and the existence of an optimal choice of the relaxation parameter. The explicit expression of the optimizing parameter is provided. Two examples are given to illustrate the theoretical results.
0 references
iterative methods
0 references
relaxation parameters
0 references
numerical examples
0 references
domain decomposition
0 references
convergence
0 references
0 references
0.8904352784156799
0 references
0.8069499731063843
0 references
0.7989421486854553
0 references
0.7833559513092041
0 references
