Nonstationary Relaxed Multisplitting Methods for Solving Linear Complementarity Problems with H-Matrices

descriptionPublicationkeyboard_double_arrow_right Article , Preprint 28 Feb 2018Embargo end date: 01 Jan 2018Publisher:Academy and Industry Research Collaboration Center (AIRCC)Journal:International Journal on Computational Science & Applications, volume 8, pages 1-13 (eissn: 2200-0011,

Copyright policy )

Authors: Cuiyu Liu; Chenliang Li;

doi: 10.5121/ijcsa.2018.8101 , 10.48550/arxiv.1803.02541

arXiv: 1803.02541

Nonstationary Relaxed Multisplitting Methods for Solving Linear Complementarity Problems with H-Matrices

- Summary
- Subjects
- Metrics

Abstract

In this paper we consider some non-stationary relaxed synchronous and asynchronous multi-splitting methods for solving the linear complementarity problems with their coefficient matrices being H-matrices. The convergence theorems of the methods are given,and the efficiency is shown by numerical tests.

Related Organizations

Guangxi University
China (People's Republic of)
Guilin University of Electronic Technology
China (People's Republic of)

Keywords

FOS: Mathematics, Mathematics - Numerical Analysis, Numerical Analysis (math.NA), linear complementarity problem, nonstationary, asynchronous, H−matrix.

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average