Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
Relaxed Two-Stage Multisplitting Algorithm for Linear Complementarity Problem
verfasst von : Ban-xiang Duan, Dong-hai Zeng
Erschienen in: Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.