✦ LIBER ✦

IGAOR and multisplitting IGAOR methods for linear complementarity problems

✍ Scribed by Sheng-Guo Li; Hao Jiang; Li-Zhi Cheng; Xiang-Ke Liao

Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 264 KB
Volume: 235
Category: Article
ISSN: 0377-0427
DOI: 10.1016/j.cam.2010.12.005

No coin nor oath required. For personal study only.

✦ Synopsis

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, in regards to the H-matrix with positive diagonal elements, we prove the convergence of these algorithms and illustrate their efficiency through our numerical results.

📜 SIMILAR VOLUMES

Inexact multisplitting methods for linea

Inexact multisplitting methods for linear complementarity problems

✍ 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 multisplitting method for symmetric li

A multisplitting method for symmetric linear complementarity problems

✍ Naoki Machida; Masao Fukushima; Toshihide Ibaraki 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 576 KB

A multiplicative multisplitting method f

A multiplicative multisplitting method for solving the linear complementarity problem

✍ 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

Two class of synchronous matrix multispl

Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems

✍ 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

Convergence of SSOR methods for linear c

Convergence of SSOR methods for linear complementarity problems

✍ Mehdi Dehghan; Masoud Hajarian 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 933 KB

New comparison theorem for the nonlinear

New comparison theorem for the nonlinear multisplitting relaxation method for the nonlinear complementarity problems

✍ Zhong-Zhi Bai 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 445 KB

A new comparison theorem on the monotone convergence rates of the parallel nonlinear multisplitting accelerated overrelaxation (AOR) method for solving the large scale nonlinear complementarity problem is established. Thus, the monotone convergence theory of this class of method is completed.