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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Cottle RW, Pang JS, Stone RE (1992) The linear complementarity problem. Academic Press, San Diedo
O’Leary DP, White RE (1985) Multisplittings of matrix and parallel solution of linear systems. SIAM J Algebraic Discrete Methods 6:630–640
Frommer A, Szyld DB (1992) H-splittings and two stage iterative methods. Numer Math 63:345–356
Varga RS (1962) Matrix iterative analysis. Prentice–Hall, Englewood Cliffs
Ortega JM, Rheinboldt WC (1970) Iterative solution of nonlinear equations in several variables. Academic, New York
Frommer A, Mayer G (1989) Convergence of relaxed parallel multisplitting methods. Linear Algebra Appl 119:141–152
Bai ZZ, Huang TZ (1994) Accelerated overrelaxation methods for solving linear complementarity problem. J UEST China 23:428–432
Wurentuya HS, Guo PF (2012) Relaxed tow-stage multisplitting methods for linear systems. J Inner Mongolia Univ Nationalities 27(2):148–150
Acknowledgments
This work is supported by the Natural Science Foundation (No. S2011010001841) of Guangdong Province, China.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Duan, Bx., Zeng, Dh. (2013). Relaxed Two-Stage Multisplitting Algorithm for Linear Complementarity Problem. In: Yin, Z., Pan, L., Fang, X. (eds) Proceedings of The Eighth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA), 2013. Advances in Intelligent Systems and Computing, vol 212. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37502-6_66
Download citation
DOI: https://doi.org/10.1007/978-3-642-37502-6_66
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37501-9
Online ISBN: 978-3-642-37502-6
eBook Packages: EngineeringEngineering (R0)