In this paper, an additive schwarz algorithm is considered for solving the finite-dimensional nonlinear complementarity problem with M-function. The monotone convergence of the algorithm is obtained with special choic...
详细信息
In this paper, an additive schwarz algorithm is considered for solving the finite-dimensional nonlinear complementarity problem with M-function. The monotone convergence of the algorithm is obtained with special choices of initial values. Moreover, the weighted max-norm bound is obtained for the iterative errors. (c) 2006 Published by Elsevier Inc.
Nonlinear complementarity problem (NCP) is a wide class of problems. In this paper, some two-level additive schwarz algorithms for NCPs with an M-function are developed and analyzed. The algorithms are proved to be co...
详细信息
Nonlinear complementarity problem (NCP) is a wide class of problems. In this paper, some two-level additive schwarz algorithms for NCPs with an M-function are developed and analyzed. The algorithms are proved to be convergent monotonically and can reach the solution of the problem within finite steps. They may also offer a possibility of making use of fast nonlinear solvers for solving the subproblems involved in the algorithms. Some preliminary numerical results are reported. Copyright (C) 2009 John Wiley & Sons, Ltd.
We give several additiveschwarz domain decomposition methods for solving finite element problems which arise from the discretizations of elliptic problems on general unstructured meshes in two and three dimensions. O...
详细信息
暂无评论