๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A multisplitting method for symmetric linear complementarity problems

โœ Scribed by Naoki Machida; Masao Fukushima; Toshihide Ibaraki


Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
576 KB
Volume
62
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Inexact multisplitting methods for linea
โœ Jun-Liang Dong ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 571 KB

We present an inexact multisplitting method for solving the linear complementarity problems, which is based on the inexact splitting method and the multisplitting method. This new method provides a specific realization for the multisplitting method and generalizes many existing matrix splitting meth

A multiplicative multisplitting method f
โœ Haijian Yang; Qingguo Li ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 589 KB

The convergence of the multiplicative multisplitting-type method for solving the linear complementarity problem with an H-matrix is discussed using classical and new results from the theory of splitting. This directly results in a sufficient condition for guaranteeing the convergence of the multipli

IGAOR and multisplitting IGAOR methods f
โœ Sheng-Guo Li; Hao Jiang; Li-Zhi Cheng; Xiang-Ke Liao ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 264 KB

In this paper, we propose an interval version of the generalized accelerated overrelaxation methods, which we refer to as IGAOR, for solving the linear complementarity problems, LCP (M, q), and develop a class of multisplitting IGAOR methods which can be easily implemented in parallel. In addition,

Two class of synchronous matrix multispl
โœ Mehdi Dehghan; Masoud Hajarian ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 253 KB

Many problems in the areas of scientific computing and engineering applications can lead to the solution of the linear complementarity problem LCP (M, q). It is well known that the matrix multisplitting methods have been found very useful for solving LCP (M, q). In this article, by applying the gene