On the convergence rate of a space decomposition method

DOI10.1007/S102550200045MaRDI QIDQ1862817zbMATH OpenOpenAlexFDO

Authors Guihua Shan, Shuzi Zhou, Jinping Zeng

Publication date 6 November 2003

Published in Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s102550200045

zbMATH Keywords

algorithmboundary-value problemsdomain decomposition methodelliptic partial differential equationsgeometric convergenceminimization on a Banach spacemultigrid methodSchwarz iterative algorithms

Mathematics Subject Classification ID

Boundary value problems for second-order elliptic equations (35J25) Existence theories for problems in abstract spaces (49J27) Decomposition methods (49M27) Numerical optimization and variational techniques (65K10) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55)

Review text

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.

Recommendations

• On the convergence of a space decomposition method
• Convergence rate analysis of an asynchronous space decomposition method for convex Minimization
• Rate of Convergence of Some Space Decomposition Methods for Linear and Nonlinear Problems
• scientific article; zbMATH DE number 1981901
• Non-monotone space decomposition methods for minimization problems

Cites work

• scientific article; zbMATH DE number 3984476 (Why is no real title available?)
• scientific article; zbMATH DE number 4076515 (Why is no real title available?)
• scientific article; zbMATH DE number 467276 (Why is no real title available?)
• Iterative Methods by Space Decomposition and Subspace Correction
• On Monotone and Geometric Convergence of Schwarz Methods for Two-Sided Obstacle Problems
• Rate of Convergence of Some Space Decomposition Methods for Linear and Nonlinear Problems
• Some Nonoverlapping Domain Decomposition Methods

Cited in

(7)

• On the convergence of a space decomposition method
• Rate of Convergence of Some Space Decomposition Methods for Linear and Nonlinear Problems
• scientific article; zbMATH DE number 1138069 (Why is no real title available?)
• scientific article; zbMATH DE number 1981901 (Why is no real title available?)
• Convergence rate analysis of an asynchronous space decomposition method for convex Minimization
• Convergence Rate of a Schwarz Multilevel Method for the Constrained Minimization of Nonquadratic Functionals
• A new subspace correction method for nonlinear unconstrained convex optimization problems

This page was built for publication: On the convergence rate of a space decomposition method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1862817)