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

Inexact multisplitting methods for linear complementarity problems

โœ Scribed by Jun-Liang Dong


Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
571 KB
Volume
223
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

โœฆ Synopsis


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 methods for linear complementarity problems. Convergence for this new method is proved when the coefficient matrix is an H + -matrix. Then, two specific iteration forms for this inexact multisplitting method are presented, where the inner iterations are implemented either through a matrix splitting method or through a damped Newton method. Convergence properties for both these specific forms are analyzed, where the system matrix is either an H + -matrix or a symmetric matrix.


๐Ÿ“œ SIMILAR VOLUMES


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,

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

A smoothing inexact Newton method for no
โœ Shao-Ping Rui; Cheng-Xian Xu ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 448 KB

In this article, we propose a new smoothing inexact Newton algorithm for solving nonlinear complementarity problems (NCP) base on the smoothed Fischer-Burmeister function. In each iteration, the corresponding linear system is solved only approximately. The global convergence and local superlinear co

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