On the convergence rate of a space decomposition method (Q1862817)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the convergence rate of a space decomposition method |
scientific article |
Statements
On the convergence rate of a space decomposition method (English)
0 references
6 November 2003
0 references
An abstract minimization problem for a \(C^2\)-functional \(F:V\to{\mathbb R}\) whose derivative \(F'\) is Lipschitz continuous and uniformly monotone on each bounded set of a reflexive Banach space \(V\) is considered. A space-decomposition method, relying on a decomposition \(V=V_1+\cdots +V_m\), is scrutinized in connection with the iterative minimization algorithm making partial minimizations on each subspaces \(V_1\), \dots , \(V_m\) whose minimizers are further used to determine a direction for a line-search step to up-date the current iteration. The rate of convergence is proved. It is mentioned that it is a unified framework for both domain decomposition method and multigrid method used in numerical solutions of boundary-value problems for elliptic partial differential equations.
0 references
minimization on a Banach space
0 references
Schwarz iterative algorithms
0 references
geometric convergence
0 references
domain decomposition method
0 references
multigrid method
0 references
algorithm
0 references
boundary-value problems
0 references
elliptic partial differential equations
0 references
0 references
0 references