AbstractIn this paper, we study the splitting method and two-stage splitting method for the linear complementarity problems. Convergence results for these two methods are presented when the system matrix is an H-matrix and the splittings used are H-splitting. Numerical experiments show that the two-stage splitting method has the same or even better numerical performance than the splitting method in some aspects under certain conditions
Abstract. In this paper, we study the convergence of relaxed two-stage multisplitting method using H...
Cover title.Includes bibliographical references (p. 45-48).Partially supported by the U.S. Army Rese...
For solving linear complementarity problems LCP more attention has recently been paid on a class of ...
AbstractIn this paper, we study the splitting method and two-stage splitting method for the linear c...
AbstractThe convergence of the multiplicative multisplitting-type method for solving the linear comp...
We consider a matrix splitting algorithm for the linear complementarity problem where the matrix is ...
AbstractWe present an inexact multisplitting method for solving the linear complementarity problems,...
AbstractOver the years, many methods for solving the linear complementarity problem (LCP) have been ...
Abstract In this paper, we demonstrate a complete version of the convergence theory of the modulus-b...
In the present work we consider the iterative solution of the Linear Complementarity Problem (LCP), ...
We consider iterative methods using splittings for solving symmetric positive semidefinite linear co...
In this paper, we analyze the relationship between projected and (possibly accelerated) modulus-base...
In this paper, we propose two splitting methods for solving horizontal linear complementarity proble...
Abstract-In this paper, we propose two new iterative SAOR methods to solve the linear complementarit...
The preconditioner presented by Hadjidimos et al. (2003) can improve on the convergence rate of the...
Abstract. In this paper, we study the convergence of relaxed two-stage multisplitting method using H...
Cover title.Includes bibliographical references (p. 45-48).Partially supported by the U.S. Army Rese...
For solving linear complementarity problems LCP more attention has recently been paid on a class of ...
AbstractIn this paper, we study the splitting method and two-stage splitting method for the linear c...
AbstractThe convergence of the multiplicative multisplitting-type method for solving the linear comp...
We consider a matrix splitting algorithm for the linear complementarity problem where the matrix is ...
AbstractWe present an inexact multisplitting method for solving the linear complementarity problems,...
AbstractOver the years, many methods for solving the linear complementarity problem (LCP) have been ...
Abstract In this paper, we demonstrate a complete version of the convergence theory of the modulus-b...
In the present work we consider the iterative solution of the Linear Complementarity Problem (LCP), ...
We consider iterative methods using splittings for solving symmetric positive semidefinite linear co...
In this paper, we analyze the relationship between projected and (possibly accelerated) modulus-base...
In this paper, we propose two splitting methods for solving horizontal linear complementarity proble...
Abstract-In this paper, we propose two new iterative SAOR methods to solve the linear complementarit...
The preconditioner presented by Hadjidimos et al. (2003) can improve on the convergence rate of the...
Abstract. In this paper, we study the convergence of relaxed two-stage multisplitting method using H...
Cover title.Includes bibliographical references (p. 45-48).Partially supported by the U.S. Army Rese...
For solving linear complementarity problems LCP more attention has recently been paid on a class of ...