Sciweavers

Share
MOC
2002

Convergence rate analysis of an asynchronous space decomposition method for convex Minimization

10 years 4 months ago
Convergence rate analysis of an asynchronous space decomposition method for convex Minimization
Abstract. We analyze the convergence rate of an asynchronous space decomposition method for constrained convex minimization in a reflexive Banach space. This method includes as special cases parallel domain decomposition methods and multigrid methods for solving elliptic partial differential equations. In particular, the method generalizes the additive Schwarz domain decomposition methods to allow for asynchronous updates. It also generalizes the BPX multigrid method to allow for use as solvers instead of as preconditioners, possibly with asynchronous updates, and is applicable to nonlinear problems. Applications to an overlapping domain decomposition for obstacle problems are also studied. The method of this work is also closely related to relaxation methods for nonlinear network flow. Accordingly, we specialize our convergence rate results to the above methods. The asynchronous method is implementable in a multiprocessor system, allowing for communication and computation delays among...
Xue-Cheng Tai, Paul Tseng
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 2002
Where MOC
Authors Xue-Cheng Tai, Paul Tseng
Comments (0)
books