On the convergence rate of a space decomposition method

DOI10.1007/s102550200045zbMath1024.65048OpenAlexW2014645598MaRDI QIDQ1862817

Guihua Shan, S. Z. Zhou, Jin-ping 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

algorithmmultigrid methodelliptic partial differential equationsboundary-value problemsdomain decomposition methodgeometric convergenceminimization on a Banach spaceSchwarz iterative algorithms

Mathematics Subject Classification ID

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

Related Items (1)

A new subspace correction method for nonlinear unconstrained convex optimization problems

Cites Work

• Iterative Methods by Space Decomposition and Subspace Correction
• Rate of Convergence of Some Space Decomposition Methods for Linear and Nonlinear Problems
• Some Nonoverlapping Domain Decomposition Methods
• On Monotone and Geometric Convergence of Schwarz Methods for Two-Sided Obstacle Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

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