Rate of convergence of some space decomposition methods for linear and nonlinear problems

• المؤلفون الرئيسيون: Tai, Xue Cheng, Espedal, Magne
• مؤلفون آخرون: School of Physical and Mathematical Sciences
• التنسيق: مقال
• اللغة: English
• منشور في: 2009
• الموضوعات: DRNTU::Science::Mathematics::Analysis
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/90844; http://hdl.handle.net/10220/4603; http://sfxna09.hosted.exlibrisgroup.com:3410/ntu/sfxlcl3?sid=metalib:EBSCO_APH&id=doi:&genre=&isbn=&issn=00361429&date=1998&volume=35&issue=4&spage=1558&epage=&aulast=Tai&aufirst=%20Xue%2DCheng&auinit=&title=SIAM%20Journal%20on%20Numerical%20Analysis&atitle=Rate%20of%20Convergence%20of%20Some%20Space%20Decomposition%20Methods%20for%20Linear%20and%20Nonlinear%20Problems
• المؤسسة: Nanyang Technological University

Convergence of a space decomposition method is proved for a class of convex programming problems. A space decomposition refers to a method that decomposes a space into a sum of subspaces, which could be a domain decomposition or a multilevel method when applied to partial differential equations. Two...