By Topic

Inexact Parallel Relaxed Multisplitting Algorithm for Linear Complementarity Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Duan, B. ; Comput. Eng. Tech. Coll., Guangdong Provincial Inst. for Tech. Personnel, Zhuhai, China ; Xiaoping Zhu ; Jiaoyu Wu

In this paper, the authors first set up the inexact parallel relaxed multisplitting algorithm for solving the linear complementarity problems, which is based on the inexact splitting method, parallel computation and the multisplitting method. This new algorithm provides a specific realization for the multisplitting method and generalizes many existing matrix splitting methods for linear complementarity problems. And then, the global convergence theory of this new algorithm is proved when the coefficient matrix is an H-matrix with positive diagonal elements. Last, a specific iteration form for this inexact multisplitting algorithm is presented, where the inner iterations are implemented through a matrix splitting method. Convergence properties for this specific form are analyzed.

Published in:

Computational Intelligence and Natural Computing, 2009. CINC '09. International Conference on  (Volume:2 )

Date of Conference:

6-7 June 2009