Please use this identifier to cite or link to this item:
|Title:||Convergence rate analysis of an asynchronous space decomposition method for convex minimization||Authors:||Tai, Xue Cheng
|Keywords:||DRNTU::Science::Mathematics::Applied mathematics::Numerical analysis||Issue Date:||2001||Source:||Tai, X. C., & Tseng, P. (2001). Convergence rate analysis of an asynchronous space decomposition method for convex minimization. Mathematics of Computation, 71(239), 1105-1135.||Series/Report no.:||Mathematics of computation.||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 the processors.||URI:||https://hdl.handle.net/10356/90754
|ISSN:||0025-5718||DOI:||10.1090/S0025-5718-01-01344-8.||Rights:||Mathematics of Computation © copyright 2001 American Mathematical Society. The journal's website is located at http://www.ams.org/mcom/.||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||SPMS Journal Articles|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.