Rate of Convergence of Some Space Decomposition Methods for Linear and Nonlinear Problems (Q4210293)
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 1200923
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Rate of Convergence of Some Space Decomposition Methods for Linear and Nonlinear Problems |
scientific article; zbMATH DE number 1200923 |
Statements
Rate of Convergence of Some Space Decomposition Methods for Linear and Nonlinear Problems (English)
0 references
21 September 1998
0 references
domain decomposition
0 references
elliptic equation
0 references
space decomposition
0 references
nonlinear programming in Banach space
0 references
parallel computation
0 references
convergence
0 references
0.8499863743782043
0 references
The authors consider the nonlinear problem \[ \text{minimize}\quad F(v)\quad\text{subject to}\quad v\in V,\tag{1} \] where \(V\) is a reflexive Banach space, and the functional \(F: V\to\mathbb{R}\) is differentiable and convex. They suppose that the space \(V\) can be decomposed into a sum of subspaces. Then two algorithms are proposed to solve the problem (1). One of the algorithms solves the minimization problems sequentially over each subspace, the other solves the minimization problems in parallel over all the subspaces. The convergence of the proposed algorithms is proved.
0 references
