Advertisement
Published in:
2013 | OriginalPaper | Chapter
Relaxed Two-Stage Multisplitting Algorithm for Linear Complementarity Problem
Authors : Ban-xiang Duan, Dong-hai Zeng
Published in: Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
In this paper, the authors first set up relaxed two-stage algorithm for solving the linear complementarity problem, which is based on the two-stage splitting algorithm, parallel computation and the multisplitting algorithm. This new algorithm provides a specific realization for the multisplitting algorithm and generalizes many existing matrix splitting algorithms for linear complementarity problems and linear systems. And then, they establish the global convergence theory of the algorithm when the system matrix of the linear complementarity problem is an H-matrix, M-matrix, strictly or irreducibly diagonally dominant.