Title of article
A class of asynchronous parallel nonlinear accelerated overrelaxation methods for the nonlinear complementarity problems
Author/Authors
Bai، نويسنده , , Zhong-Zhi، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1998
Pages
10
From page
35
To page
44
Abstract
In accordance with the principle of using sufficiently the delayed information, and by making use of the nonlinear multisplitting and the nonlinear relaxation techniques, we present in this paper a class of asynchronous parallel nonlinear multisplitting accelerated overrelaxation (AOR) methods for solving the large sparse nonlinear complementarity problems on the high-speed MIMD multiprocessor systems. These new methods, in particular, include the so-called asynchronous parallel nonlinear multisplitting AOR-Newton method, the asynchronous parallel nonlinear multisplitting AOR-chord method and the asynchronous parallel nonlinear multisplitting AOR-Steffensen method. Under suitable constraints on the nonlinear multisplitting and the relaxation parameters, we establish the local convergence theory of this class of new methods when the Jacobi matrix of the involved nonlinear mapping at the solution point of the nonlinear complementarity problem is an H-matrix.
Keywords
Asynchronous iteration , Local convergence , Nonlinear complementarity problem , Nonlinear multisplitting , Relaxation Method , G1.3
Journal title
Journal of Computational and Applied Mathematics
Serial Year
1998
Journal title
Journal of Computational and Applied Mathematics
Record number
1549096
Link To Document