A domain decomposition method for a kind of optimization problems (Q697554)
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: A domain decomposition method for a kind of optimization problems |
scientific article; zbMATH DE number 1801723
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A domain decomposition method for a kind of optimization problems |
scientific article; zbMATH DE number 1801723 |
Statements
A domain decomposition method for a kind of optimization problems (English)
0 references
17 September 2002
0 references
The authors are concerned with the monotone convergence of a multiplicative method for solving a kind of optimization problems. A multiplicative domain decomposition method is introduced and it is proved that the iterative sequence produced by the method converges to the solution of the problem monotonically. Two applications are given.
0 references
domain decomposition
0 references
monotone convergence
0 references
optimization
0 references
numerical examples
0 references
0 references
0 references
0 references
0 references
0.9749075
0 references
0.9576619
0 references
0.95088303
0 references
0.94411826
0 references
0.9340428
0 references
0.9305011
0 references
0.92484885
0 references
0.9225749
0 references
0.9222209
0 references
0 references
